Dependency Trees and the Strong Generative Capacity of CCG
2009 (English)In: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics, Stroudsburg, PA, USA: Association for Computational Linguistics, 2009, 460-468 p.Conference paper (Refereed)
We propose a novel algorithm for extracting dependencies from CCG derivations. Unlike earlier proposals, our dependency structures are always tree-shaped. We then use these dependency trees to compare the strong generative capacities of CCG and TAG and obtain surprising results: Although both formalisms generate the same string languages, their strong generative capacities are equivalent if we ignore word order, and incomparable if we take it into account.
Place, publisher, year, edition, pages
Stroudsburg, PA, USA: Association for Computational Linguistics, 2009. 460-468 p.
, Association for Computational Linguistics. European Chapter (EACL). Proceedings of the Conference, ISSN 1525-2450
Language Technology (Computational Linguistics) Language Technology (Computational Linguistics)
Research subject Computational Linguistics
IdentifiersURN: urn:nbn:se:liu:diva-100290OAI: oai:DiVA.org:liu-100290DiVA: diva2:661459
Twelfth Conference of the European Chapter of the Association for Computational Linguistics (EACL) Athens, Greece, 30 mars-3 April 2009