A New Parsing Algorithm for Combinatory Categorial Grammar

Abstract

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 6 ), as a previous algorithm by Vijay-Shanker and Weir (1993), but is easier to understand, implement, and prove correct.