17 search results - page 2 / 4 » The Use of Shared Forests in Tree Adjoining Grammar Parsing |
COLING
1999
13 years 5 months ago
1999
languages into a general system for describing parsers. Eachparser performs abstract computations using theoperations ofasemiring. Thesystem allows asingle, simple representation t...
ACL
1990
13 years 6 months ago
1990
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
ICAART
2009
INSTICC
13 years 3 months ago
2009
INSTICC
ACL
1990
13 years 6 months ago
1990
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
ACL
1998
13 years 6 months 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...