Prolog and natural-language analysis
Prolog and natural-language analysis
Computational Linguistics
The interface between phrasal and functional constraints
Computational Linguistics
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Lexical rules in constraint-based grammars
Computational Linguistics
Incremental interpretation of Categorial Grammar
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Co-evolution of language and of the language acquisition device
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
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Memoization of coroutined constraints
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
An efficient algorithm for surface generation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Hi-index | 0.00 |
We propose a generalization of Categorial Grammar in which lexical categories are defined by means of recursive constraints. In particular, the introduction of relational constraints allows one to capture the effects of (recursive) lexical rules in a computationally attractive manner. We illustrate the linguistic merits of the new approach by showing how it accounts for the syntax of Dutch cross-serial dependencies and the position and scope of adjuncts in such constructions. Delayed evaluation is used to process grammars containing recursive constraints.