Lexicalization and Generative Power in CCG

Author:

Kuhlmann Marco1,Koller Alexander2,Satta Giorgio3

Affiliation:

1. Linköping University

2. University of Potsdam

3. University of Padua

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.

Publisher

MIT Press - Journals

Subject

Artificial Intelligence,Computer Science Applications,Linguistics and Language,Language and Linguistics

Reference12 articles.

1. Ajdukiewicz, Kazimierz. 1935. Die syntaktische Konnexität. Studia Philosophica, 1:1–27.

2. Baldridge, Jason. 2002. Lexically Specified Derivational Control in Combinatory Categorial Grammar. Ph.D. thesis, University of Edinburgh, Edinburgh, UK.

3. Baldridge, Jason and Geert-Jan M. Kruijff. 2003. Multi-modal combinatory categorical grammar. In Tenth Conference of the European Chapter of the Association for Computational Linguistics (EACL), pages 211–218, Budapest.

4. Bar-Hillel, Yehoshua, Haim Gaifman, and Eli Shamir. 1960. On categorial and phrase structure grammars. Bulletin of the Research Council of Israel, 9F(1):1–16. Reprinted in Yehoshua Bar-Hillel. Language and Information: Selected Essays on Their Theory and Application, pages 99–115. Addison-Wesley, 1964.

5. Efficient normal-form parsing for combinatory categorial grammar

Cited by 21 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Computational Complexity of Natural Morphology Revisited;Transactions of the Association for Computational Linguistics;2024

2. Fine-tuning Transformer-based MT Using Syntactic Guides;2023 18th International Joint Symposium on Artificial Intelligence and Natural Language Processing (iSAI-NLP);2023-11-27

3. Trustworthy Formal Natural Language Specifications;Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software;2023-10-18

4. Combinatory categorial grammars as generators of weighted forests;Information and Computation;2023-10

5. A role of functional morphemes in Korean categorial grammars;Korean Linguistics;2023-06-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3