The importance of rule restrictions in Combinatory Categorial Grammar

Marco Kuhlmann, Alexander Koller, and Giorgio Satta

In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL), Uppsala, 2010.

Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and cross-linguistic variation is visible only in the lexicon. In this paper, we show that the weak generative capacity of this pure form of CCG is strictly smaller than that of other mildly context-sensitive grammar formalisms, including tree-adjoining grammar. Our result carries over also to the multi-modal extension of CCG.

Download: Download

BibTeX Entry
@InProceedings{ccg-acl2010,
	author = {Marco Kuhlmann and Alexander Koller and Giorgio Satta},
	title = {The importance of rule restrictions in Combinatory Categorial Grammar},
	year = {2010},
	address = {Uppsala},
	booktitle = {Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL)}
}

Back: Publications