The Complexity of Recognition of Linguistically Adequate Dependency Grammars
cmp-lg
2008-02-03 v1 Computation and Language
Abstract
Results of computational complexity exist for a wide range of phrase structure-based grammar formalisms, while there is an apparent lack of such results for dependency-based formalisms. We here adapt a result on the complexity of ID/LP-grammars to the dependency framework. Contrary to previous studies on heavily restricted dependency grammars, we prove that recognition (and thus, parsing) of linguistically adequate dependency grammars is NP-complete.
Keywords
Cite
@article{arxiv.cmp-lg/9709001,
title = {The Complexity of Recognition of Linguistically Adequate Dependency Grammars},
author = {Peter Neuhaus and Norbert Broeker},
journal= {arXiv preprint arXiv:cmp-lg/9709001},
year = {2008}
}
Comments
8 pages, requires LaTeX2e, epsfig, latexsym, amsmath