Parsing and derivational equivalence
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Discontinuity and the Lambek calculus
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
The combinatory morphemic lexicon
Computational Linguistics
Incremental processing and acceptability
Computational Linguistics
Geometry of lexico-syntactic interaction
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Proof figures and structural operators for categorial grammar
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Maximal incrementality in linear categorial deduction
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
Efficient incremental processing with categorial grammar
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Chart parsing Lambek grammars: modal extensions and incrementality
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A compilation-chart method for linear categorial deduction
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
The complexity of parsing with extended categorial grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Polarized classical non-associative Lambek calculus and formal semantics
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Logic programming of the displacement calculus
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
| Hi-index | 0.00 |
The possibility of multiple equivalent proofs presents a problem for efficient parsing of a number of flexible categorial grammar (CG) frameworks. In this paper I outline a normal form system for a sequent formulation of the product-free associative Lambek Calculus. This leads to a simple parsing approach that yields only normal form proofs. This approach is both safe in that all distinct readings for a sentence will be returned, and optimal in that there is only one normal form proof yielding each distinct meaning.