36 search results - page 6 / 8 » Disfluencies, language comprehension, and Tree Adjoining Gra... |
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...
74
Voted
COGSCI
2004
14 years 9 months ago
2004
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
85
Voted
ESSLLI
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
ACL
1992
14 years 10 months ago
1992
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
COLING
1996
14 years 10 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...