Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Type-driven natural language analysis
Type-driven natural language analysis
Parsing and derivational equivalence
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
A lazy way to chart-parse with Categorial Grammars
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
A definite clause version of Categorial Grammar
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Categorial unification grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
Unification Categorial Grammar: a concise, extendable grammar for natural language processing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
The combinatory morphemic lexicon
Computational Linguistics
An Abductive Mechanism for Natural Language Processing Based on Lambek Calculus
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Incremental processing and acceptability
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
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
Efficient incremental processing with categorial grammar
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
A psycholinguistically motivated parser for CCG
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Algorithms for generation in Lambek Theorem Proving
ACL '90 Proceedings of the 28th 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
Normal form theorem proving for the Lambek Calculus
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
The complexity of parsing with extended categorial grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
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 logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction1 style parsing method.In natural language processing, the task of a parser usually consists in finding derivations for all different readings of a sentence. The original Lambek Calculus, when it is used as a parser/theorem prover, has the undesirable property of allowing for the derivation of more than one proof for a reading of a sentence, in the general case.In order to overcome this inconvenience and to turn Lambek Calculus into a reasonable parsing method, we show the existence of "relative" normal form proof trees and make use of their properties to constrain the proof procedure in the desired way.