An efficient context-free parsing algorithm
Communications of the ACM
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Slot Grammar: A System for Simpler Construction of Practical Natural Language Grammars
Proceedings of the International Symposium on Natural Language and Logic
On the complexity of ID/LP parsing 1
Computational Linguistics
A logical treatment of semi-free word order and bounded discontinuous constituency
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Chart parsing according to the slot and filler principle
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Restricted parallelism in object-oriented lexical parsing
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
An Earley-type recognizer for dependency grammar
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Polarized Non-projective Dependency Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Formal aspects and parsing issues of dependency theory
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Separating surface order and syntactic relations in a dependency grammar
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Pseudo-projectivity: a polynomially parsable non-projective dependency grammar
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Grammars for local and long dependencies
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
On the complexity of non-projective data-driven dependency parsing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
A robust and hybrid deep-linguistic theory applied to large-scale parsing
ROMAND '04 Proceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data
Non-projective dependency parsing in expected linear time
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Grading knowledge: extracting degree information from texts
Grading knowledge: extracting degree information from texts
A transition-based parser for 2-planar dependency structures
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
| Hi-index | 0.00 |
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.