A New Parsing Algorithm for Combinatory Categorial Grammar
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
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.
Language Technology (Computational Linguistics)
IdentifiersURN: urn:nbn:se:liu:diva-114364OAI: oai:DiVA.org:liu-114364DiVA: diva2:789540