LACL '96 Selected papers from the First 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
Journal of Computer and System Sciences
Grammars for local and long dependencies
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Generalized categorial dependency grammars
Pillars of computer science
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
Dependency tree grammars are proposed in which unbounded discontinuity is resolved through the first available valency saturation. In general, they are expressive enough to generate non-semilinear context sensitive languages, but in the practical situation where the number of non saturated valencies is bounded by a constant, they are weakly equivalent to cf-grammars, are parsable in cubic time, and are stronger than non-projective dependency grammars without long dependencies.