2 papers
cmp-lg1994
Parsing Free Word-Order Languages in Polynomial Time
Tilman Becker, Owen Rambow
We present a parsing algorithm with polynomial time complexity for a large subset of V-TAG languages. V-TAG, a variant of multi-component TAG, can handle free-word order phenomena…
cmp-lg1994
Lexicalization and Grammar Development
B. Srinivas, Dania Egedi, Christy Doran +1
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Featu…