Parsing Free Word-Order Languages in Polynomial Time
| dc.creator | Becker, Tilman | |
| dc.creator | Rambow, Owen | |
| dc.date | 1994-11-03 | |
| dc.date.accessioned | 2026-07-07T09:09:38Z | |
| dc.date.available | 2026-07-07T09:09:38Z | |
| dc.description | 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. | |
| dc.description | 4 pages, uuencoded compressed ps file | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9411008 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9411008 | |
| dc.identifier | In {\em 3e Colloque International sur les Grammaires d'Arbres Adjoints (TAG+3)} | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151105 | |
| dc.subject | Computation and Language | |
| dc.title | Parsing Free Word-Order Languages in Polynomial Time | |
| dc.type | text |