A New Parsing Algorithm for Combinatory Categorial Grammar | Zendy

Marco Kuhlmann | Zendy; Giorgio Satta | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A New Parsing Algorithm for Combinatory Categorial Grammar

Author(s) -

Marco Kuhlmann,

Giorgio Satta

Publication year - 2014

Publication title -

transactions of the association for computational linguistics

Language(s) - English

Resource type - Journals

ISSN - 2307-387X

DOI - 10.1162/tacl_a_00192

Subject(s) - combinatory categorial grammar , computer science , parsing , categorial grammar , decomposition , algorithm , grammar , polynomial , programming language , theoretical computer science , link grammar , artificial intelligence , generative grammar , mildly context sensitive grammar formalism , mathematics , linguistics , phrase structure rules , attribute grammar , ecology , mathematical analysis , philosophy , biology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research