Lexicalization and Generative Power in CCG
2015 (English)In: Computational linguistics - Association for Computational Linguistics (Print), ISSN 0891-2017, E-ISSN 1530-9312, Vol. 41, no 2, 215-247 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
Massachusetts Institute of Technology Press (MIT Press): STM Titles / MIT Press , 2015. Vol. 41, no 2, 215-247 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:liu:diva-121145DOI: 10.1162/COLI_a_00219ISI: 000359625700002OAI: oai:DiVA.org:liu-121145DiVA: diva2:852259