Lexicalization and generative power in CCG

23Citations
Citations of this article
89Readers
Mendeley users who have this article in their library.

Abstract

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 categorial formalism for which this equivalence has been established differs significantly from the versions of CCG that are in use today. In particular, it allows restriction of combinatory rules on a per grammar basis, whereas 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 lexicalized versions of the classical CCG formalism are strictly less powerful than TAG.

Cite

CITATION STYLE

APA

Kuhlmann, M., Koller, A., & Satta, G. (2015). Lexicalization and generative power in CCG. Computational Linguistics, 41(2), 187–219. https://doi.org/10.1162/COLI_a_00219

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free