Parsing Free Word-Order Languages in Polynomial Time
cmp-lg
2008-02-03 v1 Computation and Language
Abstract
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.
Cite
@article{arxiv.cmp-lg/9411008,
title = {Parsing Free Word-Order Languages in Polynomial Time},
author = {Tilman Becker and Owen Rambow},
journal= {arXiv preprint arXiv:cmp-lg/9411008},
year = {2008}
}
Comments
4 pages, uuencoded compressed ps file