ML p(r)ior | Parsing Free Word-Order Languages in Polynomial Time
Processing...

Parsing Free Word-Order Languages in Polynomial Time

1994-11-03
9411008 | cmp-lg
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 which are beyond the class LCFRS (which includes regular TAG). Our algorithm is based on a CYK-style parser for TAGs.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations