Efficient Normal-Form Parsing for Combinatory Categorial Grammar

  title={Efficient Normal-Form Parsing for Combinatory Categorial Grammar},
  author={Jason Eisner},
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures whatever true semantic ambiguities are in the input. This paper addresses the problem for a fairly general form of Combinatory Categorial Grammar, by means of an efficient, correct, and easy to implement normal-form parsing technique. The parser is proved to find exactly one parse in each semantic equivalence class of… 

Figures from this paper

Informed Parsing for Coordination with Combinatory Categorial Grammar

This work proposes to address ambiguities in coordination in natural language parsing with predicate argument structures and semantic co-occurrence similarity information, and presents encouraging results.

Data and models for statistical parsing with combinatory categorial grammar

This dissertation presents an algorithm which translates the phrase-structure analyses of the Penn Treebank to CCG derivations, and proposes a generative model that captures the local and non- local dependencies in the predicate-argument structure, and investigates the impact of modelling non-local in addition to local dependencies.

A Logical Basis for the D Combinator and Normal Form in CCG

Two ways to derive the D rules are shown: one based on unary composition and the other based on a logical characterization of CCG’s rule base (Baldridge, 2002).

Lexicalization and Generative Power in CCG

The weak equivalence of Combinatory Categorial Grammar (CCG) and Tree-Adjoining Grammar (TAG) is a central result of the literature on mildly context-sensitive grammar formalisms. However, the

Tractable Parsing for CCGs of Bounded Degree

It is shown that the parsing complexity of CCG is exponential only in the maximum degree of composition, when that degree is fixed, and parsing can be carried out in polynomial time.

Hat Categories: Representing Form and Function Simultaneously in Combinatory Categorial Grammar

Combinatory Categorial Grammar (CCG, Steedman, 2000) is a lexicalised grammar formalism, which means that each word is associated with a category that specifies its argument structure and grammatical

Efficient Parsing for CCGs with Generalized Type-raised Categories

First, it is shown that an experimental parser runs polynomially in practice on a realistic fragment of Japanese by eliminating spurious ambiguity and excluding genuine ambiguities, and a worst-case polynomial recognition algorithm for CCG-GTRC is presented by extending thePolynomial algorithm for the standard CCGs.

Acquiring Compact Lexicalized Grammars from a Cleaner Treebank

An algorithm which translates the Penn Treebank into a corpus of Combinatory Categorial Grammar (CCG) derivations is presented and it is demonstrated how the combination of preprocessing and type-changing rules minimizes the lexical coverage problem.

Functional Combinatory Categorial Grammar

The grammar is demon- strated by extracting an FCCG-annotated corpus from the Penn treebank using the com- binator calculator described in (Foreman & McMichael, 2004) and is motivated by the need to provide good coverage outside that relatively narrow training domain.



Predictive Combinators: a Method for Efficient Processing of Combinatory Categorial Grammars

This work proposes a method for deriving new, specialized combinators and replacing the orginal basic combinators with these derived ones, and examples of these predictive combinators are offered and their effects illustrated.

Parsing as Natural Deduction

This work shows the existence of "relative" normal form proof trees and makes use of their properties to constrain the proof procedure in the desired way.

Polynomial Time Parsing of Combinatory Categorial Grammars

A polynomial time parsing algorithm for Combinatory Categorial Grammar that extends the CKY algorithm for CFG by generating a representation of the parse trees in two phases.

Efficient Processing of Flexible Categorial Grammar

This paper presents a flexible categorial grammar which makes extensive use of the product-operator, first introduced by Lambek (1958), which has the property that for every reading of a sentence, a strictly left-branching derivation can be given.

A Lazy way to Chart-Parse with Categorial Grammars

The present paper describes a simple parsing algorithm for the "combinatory" extension of Categorial Grammars, which offers a uniform treatment for "spurious" syntactic ambiguities and the "genuine" structural ambiguITIES which any processor must cope with.

Parsing Some Constrained Grammar Formalisms

A scheme to extend a recognition algorithm for Context-Free Grammars that can be used to derive polynomial-time recognition algorithms for a set of for-malisms that generate a superset of languages generated by CFG is presented.

Type Raising, Functional Composition, and Non-Constituent Conjunction

A very striking feature of the system of categorial grammar in Ades and Steedman (1982) and Steeds (1985) is its appeal to the operation of functional composition as a highly general rule of natural language grammars.

Parsing and Derivational Equivalence

This paper shows how notions of derivation-reduction and normal form can be used to avoid unnecessary work while parsing with grammars exhibiting derivational equivalence.

A Psycholinguistically Motivated Parser for CCG

This work explores the proposal that the competence grammar is a Combinatory Categorial Grammar (CCG), and addresses the problem of the proliferating analyses that stem from CCG's associativity of derivation.

The Mathematics of Sentence Structure

An effective rule (or algorithm) for distinguishing sentences from nonsentences is obtained, which works not only for the formal languages of interest to the mathematical logician, but also for natural languages such as English, or at least for fragments of such languages.