The Complexity of Recognition of Linguistically Adequate Dependency Grammars
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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.
8 pages, requires LaTeX2e, epsfig, latexsym, amsmath
8 pages, requires LaTeX2e, epsfig, latexsym, amsmath