Grammar, interpretation, and processing from the lexicon
Lexical representation and process
Parsing and derivational equivalence
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Incremental interpretation of Categorial Grammar
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Mixing modes of linguistic description in Categorial Grammar
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Higher-order linear logic programming of categorial deduction
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Predictive combinators: a method for efficient processing of combinatory Categorial Grammars
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Efficient normal-form parsing for combinatory categorial grammar
ACL '96 Proceedings of the 34th 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
Normal form theorem proving for the Lambek Calculus
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
Recent work has seen the emergence of a common framework for parsing categorial grammar (CG) formalisms that fall within the 'type-logical' tradition (such as the Lambek calculus and related systems), whereby some method of linear logic theorem proving is used in combination with a system of labelling that ensures only deductions appropriate to the relevant grammatical logic are allowed. The approaches realising this framework, however, have not so far addressed the task of incremental parsing --- a key issue in earlier work with 'flexible' categorial grammars. In this paper, the approach of (Hepple, 1996) is modified to yield a linear deduction system that does allow flexible deduction and hence incremental processing, but that hence also suffers the problem of 'spurious ambiguity'. This problem is avoided via normalisation.