Work

A New Parsing Algorithm for Combinatory Categorial Grammar

Year: 2014

Type: article

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.

Source: Transactions of the Association for Computational Linguistics

DOI: 10.1162/tacl_a_00192

Authors: Marco Kuhlmann, Giorgio Satta

Institutions: Linköping University, University of Padua

Language: English

Topic: Natural Language Processing Techniques

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Ministero dell’Istruzione, dell’Università e della Ricerca

OpenAlex ID: W2114282531

FWCI: 1.329

Cites: 23

Cited by: 13

Related to: 10