643 search results - page 3 / 129 » Parsing And Derivational Equivalence |
ACL
2011
14 years 1 months ago
2011
ACL
2001
14 years 11 months ago
2001
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation langu...
ACL
1996
14 years 11 months ago
1996
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures...
NAACL
2003
14 years 11 months ago
2003
We introduce two probabilistic models that can be used to identify elementary discourse units and build sentence-level discourse parse trees. The models use syntactic and lexical ...
CADE
1999
Springer
15 years 1 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...