A New Parsing Algorithm for Combinatory Categorial Grammar
2014-01-01TACL 2014Unverified0· sign in to hype
Marco Kuhlmann, Giorgio Satta
Unverified — Be the first to reproduce this paper.
ReproduceAbstract
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(n6), as a previous algorithm by Vijay-Shanker and Weir (1993), but is easier to understand, implement, and prove correct.