Parsing discontinuous constituents in dependency grammar
Computational Linguistics
Computational Linguistics - Special issue on inheritance: I
Concurrent, object-oriented natural language parsing: the ParseTalk model
International Journal of Human-Computer Studies - Special issue: object-oriented approaches in artificial intelligence and human-computer interaction
An efficient context-free parsing algorithm
Communications of the ACM
Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
Parsing some constrained grammar formalisms
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
Three new probabilistic models for dependency parsing: an exploration
COLING '96 Proceedings of the 16th 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
A Fully Lexicalized Grammar for French Based on Meaning-Text Theory (Invited Talk)
CICLing '01 Proceedings of the Second International Conference on Computational Linguistics and Intelligent Text Processing
Grammars for local and long dependencies
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
The simple truth about dependency and phrase structure representations: an opinion piece
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
The paper investigates the problem of providing a formal device for the dependency approach to syntax, and to link it with a parsing model. After reviewing the basic tenets of the paradigm and the few existing mathematical results, we describe a dependency formalism which is able to deal with long-distance dependencies. Finally, we present an Earley-style parser for the formalism and discuss the (polynomial) complexity results.