A Lazy Way to Chart-parse with Categorial Grammars

Remo Pareschi, Mark Steedman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

There has recently been a revival of interest in Categorial Grammars (CG) among computational linguists. The various versions noted below which extend pure CG by including operations such as functional composition have been claimed to offer simple and uniform accounts of a wide range of natural language (NL) constructions involving bounded and unbounded "movement" and coordination "reduction" in a number of languages. Such grammars have obvious advantages for computational applications, provided that they can be parsed efficiently. However, many of the proposed extensions engender proliferating semantically equivalent surface syntactic analyses. These "spurious analyses" have been claimed to compromise their efficient parseability.The present paper describes a simple parsing algorithm for our own "combinatory" extension of CG. This algorithm offers a uniform treatment for "spurious" syntactic ambiguities and the "genuine" structural ambiguities which any processor must cope with, by exploiting the associativity of functional composition and the procedural neutrality of the combinatory rules of grammar in a bottom-up, left-to-right parser which delivers all semantically distinct analyses via a novel unification-based extension of chart-parsing.
Original languageEnglish
Title of host publicationACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Place of PublicationStroudsburg, PA, USA
PublisherAssociation for Computational Linguistics
Pages81-88
Number of pages8
DOIs
Publication statusPublished - 1987

Fingerprint

Dive into the research topics of 'A Lazy Way to Chart-parse with Categorial Grammars'. Together they form a unique fingerprint.

Cite this