Polarized Non-projective Dependency Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
The complexity of recognition of linguistically adequate dependency grammars
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for 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
COLING '92 Proceedings of the 14th 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
Generalized categorial dependency grammars
Pillars of computer science
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Abstract automata and a normal form for categorial dependency grammars
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
Polarized dependency (PD-) grammars are proposed as a means of efficient treatment of discontinuous constructions. PD-grammars describe two kinds of dependencies: local, explicitly derived by the rules, and long, implicitly specified by negative and positive valencies of words. If in a PD-grammar the number of non-saturated valencies in derived structures is bounded by a constant, then it is weakly equivalent to a cf-grammar and has a O(n3)-time parsing algorithm. It happens that such bounded PD-grammars are strong enough to express such phenomena as unbounded raising, extraction and extraposition.