A New Parsing Algorithm for Combinatory Categorial Grammar

Open Webpage

Marco Kuhlmann, Giorgio Satta

Published: 29 Oct 2014, Last Modified: 24 Mar 2025OpenReview Archive Direct UploadEveryoneCC BY 4.0
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(n6), as a previous algorithm by Vijay-Shanker and Weir (1993), but is easier to understand, implement, and prove correct.