Treating coordination in logic grammars
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
A state-transition grammar for data-oriented parsing
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Dynamics, dependency grammar and incremental interpretation
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
| Hi-index | 0.01 |
For some time there has been interest in the idea of parsing as deduction. Here we present a grammatical formalism, 'Axiomatic Grammar', which is based upon a small number of linguistically motivated axioms and deduction rules. Each axion or rule combines a 'category' with a string of words to form a further category. This contrasts with the usual 'tree-structure' approach to syntactic analysis where constituents are combined with each other to form a further constituent.We describe a grammar for English which has a good coverage of 'non-constituent' coordination. The grammar has been integrated with a toy semantics, and has been implemented in a left-to-right parser with incremental semantic interpretation. The parser does not suffer from spurious ambiguity.