uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Dependency Trees and the Strong Generative Capacity of CCG
Department of Computational Linguistics, Saarland University.
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Languages, Department of Linguistics and Philology. (Datorlingvistik)ORCID iD: 0000-0002-2492-9872
2009 (English)Conference paper (Refereed)
Abstract [en]

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
2009. 460-468 p.
, Association for Computational Linguistics. European Chapter (EACL). Proceedings of the Conference, ISSN 1525-2450
National Category
Language Technology (Computational Linguistics) Language Technology (Computational Linguistics)
Research subject
Computational Linguistics
URN: urn:nbn:se:uu:diva-100714OAI: oai:DiVA.org:uu-100714DiVA: diva2:210871
Twelfth Conference of the European Chapter of the Association for Computational Linguistics (EACL) Athens, 30 mars-3 april 2009
Available from: 2009-04-06 Created: 2009-04-06 Last updated: 2013-07-17

Open Access in DiVA

No full text

Other links


Search in DiVA

By author/editor
Kuhlmann, Marco
By organisation
Department of Linguistics and Philology
Language Technology (Computational Linguistics)Language Technology (Computational Linguistics)

Search outside of DiVA

GoogleGoogle Scholar

Total: 182 hits
ReferencesLink to record
Permanent link

Direct link