Sciweavers

415 search results - page 55 / 83
» Tree Unification Grammar
Sort
View
139
Voted
LACL
2005
Springer
15 years 9 months ago
Linguistic Facts as Predicates over Ranges of the Sentence
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...
Benoît Sagot
142
Voted
ICDAR
2003
IEEE
15 years 9 months ago
Parsing N-Best Lists of Handwritten Sentences
This paper investigates the application of a probabilistic parser for natural language on the list of the Nbest sentences produced by an off-line recognition system for cursive h...
Matthias Zimmermann, Jean-Cédric Chappelier...
127
Voted
EMNLP
2004
15 years 5 months ago
Induction of Greedy Controllers for Deterministic Treebank Parsers
Most statistical parsers have used the grammar induction approach, in which a stochastic grammar is induced from a treebank. An alternative approach is to induce a controller for ...
Tom Kalt
122
Voted
TAPD
1998
81views more  TAPD 1998»
15 years 5 months ago
A Generalized CYK Algorithm for Parsing Stochastic CFG
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
Jean-Cédric Chappelier, Martin Rajman
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 3 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan