The Importance of Rule Restrictions in CCG
2010 (English)In: Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, Stroudsburg, PA, USA: Association for Computational Linguistics, 2010, 534-543 p.Conference paper (Other academic)
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 isolated 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 CCG with grammar-specific rules, and of other mildly context-sensitive grammar formalisms, including Tree Adjoining Grammar (TAG). Our result also carries over to a multi-modal extension of CCG.
Place, publisher, year, edition, pages
Stroudsburg, PA, USA: Association for Computational Linguistics, 2010. 534-543 p.
, Association for Computational Linguistics (ACL). Annual Meeting Conference Proceedings, ISSN 0736-587X
Language Technology (Computational Linguistics) Language Technology (Computational Linguistics)
Research subject Computational Linguistics
IdentifiersURN: urn:nbn:se:liu:diva-100292ISBN: 978-1-932432-66-4 (Vol. 1)ISBN: 978-1-932432-67-1 (Vol. 2)OAI: oai:DiVA.org:liu-100292DiVA: diva2:661438
48th Annual Meeting of the Association for Computational Linguistics, Uppsala, Sweden, July 11–16, 2010