Can I read Parsing Free Word-Order Languages in Polynomial Time on EtoBox?

Parsing Free Word-Order Languages in Polynomial Time by Becker, Tilman; Rambow, Owen is a scholarly article available to read on EtoBox.

What is Parsing Free Word-Order Languages in Polynomial Time about?

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.

Author

Becker, Tilman; Rambow, Owen

Published

1994

Language

EN