The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
Coordination in an Axiomatic Grammar
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Incremental interpretation of Categorial Grammar
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
An integrated model of semantic and conceptual interpretation from dependency structures
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Incremental interpretation: applications, theory, and relationship to dynamic semantics
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Non-constituent coordination: theory and practice
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Disambiguation of super parts of speech (or supertags): almost parsing
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Concurrent lexicalized dependency parsing: the ParseTalk model
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Cross-serial dependencies are not hard to process
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Annotation of gene products in the literature with gene ontology terms using syntactic dependencies
IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
| Hi-index | 0.00 |
The paper describes two equivalent grammatical formalisms. The first is a lexicalised version of dependeney grammar, and this can be used to provide tree-structured analyses of sentences (though some-what flatter than those usually provided by phrase structure grammars). The second is a new formalism, 'Dynamic Dependency Grammar', which uses axioms and deduction rules to provide analyses of sentences in terms of transitions between states.A reformulation of dependency grammar using state transitions is of interest on several grounds. Firstly, it can be used to show that incremental interpretation is possible without requiring notions of overlapping, or flexible constituency (as in some versions of categorial grammar), and without destroying a transparent link between syntax and semantics. Secondly, the reformulation provides a level of description which can act as an intermediate stage between the original grammar and a parsing algorithm. Thirdly, it is possible to extend the reformulated grammars with further axioms and deduction rules to provide coverage of syntactic constructions such as coordination which are difficult to encode lexically.