60 search results - page 6 / 12 » Incremental Parser Generation for Tree Adjoining Grammars |
ACL
1998
15 years 29 days ago
1998
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
ACL
1998
15 years 29 days ago
1998
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
ACL
2001
15 years 1 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...
69
Voted
COLING
1999
14 years 11 months ago
1999
languages into a general system for describing parsers. Eachparser performs abstract computations using theoperations ofasemiring. Thesystem allows asingle, simple representation t...
117
Voted
FBIT
2007
IEEE
15 years 6 months ago
2007
IEEE
—Standard genetic programming genotypes are generally highly disorganized and poorly structured, with little code replication. This is also true of existing developmental genetic...