Lexicalization and Generative Power in CCG

Marco Kuhlmann, Alexander Koller, and Giorgio Satta

Computational Linguistics, 41(2):187-219, 2015.

The weak equivalence of Combinatory Categorial Grammar (CCG) and Tree-Adjoining Grammar (TAG) is a central result of the literature on mildly context-sensitive grammar formalisms. However, the version of CCG for which this equivalence has been established differs significantly from the version that is in use today. In particular, it allows to restrict combinatory rules on a per grammar basis, while modern CCG assumes a universal set of rules, isolating all cross-linguistic variation in the lexicon. In this article we investigate the formal significance of this difference. Our main result is that current lexicalized forms of CCG are strictly less powerful than TAG.

Download: Download

BibTeX Entry
	author = {Marco Kuhlmann and Alexander Koller and Giorgio Satta},
	title = {Lexicalization and Generative Power in {CCG}},
	journal = {Computational Linguistics},
	year = 2015,
	volume = 41,
	number = 2,
	pages = {187--219}

Back: Publications