PROLOG and Natural Language Analysis
PROLOG and Natural Language Analysis
Polynomial time parsing of Combinatory Categorial Grammars
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Functor-driven natural language generation with categorial-unification grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
The combinatory morphemic lexicon
Computational Linguistics
Generating contextually appropriate intonation
EACL '93 Proceedings of the sixth 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
Generative power of CCGs with generalized type-raised categories
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
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Realization of natural language interfaces using lazy functional programming
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
The form of rules in combinatory categorial grammars (CCG) is constrained by three principles, called "adjacency", "consistency" and "inheritance". These principles have been claimed elsewhere to constrain the combinatory rules of composition and type raising in such a way as to make certain linguistic universals concerning word order under coordination follow immediately. The present paper shows that the three principles have a natural expression in a unification-based interpretation of CCG in which directional information is an attribute of the arguments of functions grounded in string position. The universals can thereby be derived as consequences of elementary assumptions. Some desirable results for grammars and parsers follow, concerning type-raising rules.