liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
A New Parsing Algorithm for Combinatory Categorial Grammar
Linköping University, Department of Computer and Information Science, Human-Centered systems. Linköping University, The Institute of Technology. (Cognition, Interaction and Language Technology)ORCID iD: 0000-0002-2492-9872
University of Padua.
2014 (English)In: Transactions of the Association for Computational Linguistics, ISSN 2307-387X, Vol. 2, no 2014, 405-418 p.Article in journal (Refereed) Published
Abstract [en]

We present a polynomial-time parsing algorithm for CCG, based on a new decomposition of derivations into small, shareable parts. Our algorithm has the same asymptotic complexity, O(n⁶), as a previous algorithm by Vijay-Shanker and Weir (1993), but is easier to understand, implement, and prove correct.

Place, publisher, year, edition, pages
Association for Computational Linguistics, 2014. Vol. 2, no 2014, 405-418 p.
National Category
Language Technology (Computational Linguistics)
URN: urn:nbn:se:liu:diva-114364OAI: diva2:789540
Available from: 2015-02-19 Created: 2015-02-19 Last updated: 2015-02-26

Open Access in DiVA

No full text

Other links

ACL Anthology

Search in DiVA

By author/editor
Kuhlmann, Marco
By organisation
Human-Centered systemsThe Institute of Technology
Language Technology (Computational Linguistics)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 32 hits
ReferencesLink to record
Permanent link

Direct link