Efficient Processing Of Flexible Categorial Grammar

نویسنده

  • Gosse Bouma
چکیده

From a processing point of view, however, flexible categorial systems are problematic, since they introduce spurious ambiguity. In this paper, we present a flexible categorial grammar which makes extensive use of the p roduc t -ope ra to r , f i rs t in t roduced by Lambek (1958). The grammar has the property that for every reading of a sentence, a strictly left-branching derivation can be given. This leads to the definition of a subset of the grammar, for which the spurious ambiguity problem does not arise and efficient processing is possible. 1. Flexibility vs. Ambiguity Categorial Grammars owe much of their popularity to the fact that they allow for various degrees of flexibility with respect to constituent structure. From a processing point of view, however, flexible categorial systems are problematic, since they introduce spurious ambiguity. The best known example of a flexible categorial grammar is a grammar containing the reduction rules appl icat ion and c o m p o sition, and the category changing rule raising 1 • * I would like to thank Esther K0nig, Erik-Jan van der Linden, Michael Moortgat, Adriaan van Paassen and the participants of the Edinburgh Categorial Grammar Weekend, who made useful comments to earlier presentations of this material. All remaining errors and misconceptions are of course my own. 1 Throughout this paper we will be using the notation of Lambek (1958), in which A/B and B\A are a right-directional and a ( i ) application : A/B B ==> A B B\A ==> A composition: A/B B/C ==> NC C\B B~, ==> C ~ raising : A ==> (B/A)\B A ==> B/(A\B) With this grammar many alternative constituent structures for a sentence can be generated, even where this does not correspond to semantic ambiguities. From a linguistic point of view, this has many advantages. Various kind of arguments for giving up traditional conceptions of constituent structure can be given, but the most convincing and well-documented case in favour of flexible constituent structure is coordination (see Steedman (1985), Dowty (1988), and Zwarts (1986)). The standard assumption in generative grammar is that coordination always takes place between between constituents. Rightnode raising constructions and other instances of non-constituent conjunction are problematic, because it is not clear what the status of the coordinated elements in these constructions is. Flexible categorial grammar presents an elegant solution for such cases, since, next to canonical constituent structures, it also admits various other constituent structures. Therefore, the sentences in (2) can be considered to be ordinary instances of coordination (of two categories slap and ( v p / a p ) \ v p , respectively). (2) a. John sold and Mary bought a book s/vp vp/np s/vp vp/np np

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Incremental Processing with Categorial Grammar

Some problems are discussed that arise for incremental processing using certain exible categorial grammars, which involve either undesirable parsing properties or failure to allow combinations useful to incrementality. We suggest a new calculus which, though`designed' in relation to categorial interpretations of some notions of dependency grammar, seems to provide a degree of exibility that is ...

متن کامل

Efficient Combinatory Categorial Grammar Parsing

Efficient wide-coverage parsing is integral to large-scale NLP applications. Unfortunately, parsers for linguistically motivated formalisms, e.g. HPSG and TAG, are often too inefficient for these applications. This paper describes two modifications to the standard CKY chart parsing algorithm used in the Clark and Curran (2006) Combinatory Categorial Grammar (CCG) parser. The first modification ...

متن کامل

Categorial Morphosyntax: Transparency of the Morphology-Syntax-Semantics Interface

Encapsulation of morphology and syntax as separate domains of representation and processing causes many problems at the interfaces, such as rebracketing, reordering, and tampering with the representations of the information domains. These recomputations usually arise due to mismatches with the semantic bracketing. We propose a lexicalist framework based on Combinatory Categorial Grammar (CCG) t...

متن کامل

Normal Form Theorem Proving for the Lambek Calculus

The possibility of multiple equivalent proofs presents a problem for efficient parsing of a number of flexible categorial grammar (CG) frameworks. In this paper I outline a normal form system for a sequent formulation of the product-free associative Lambek Calculus. This le,'~ls to a simple parsing approach that yields only normal form proofs. This approach is both ~afe in that all distinct rea...

متن کامل

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

A B S T R A C T Steedman (1985, 1987) and others have proposed that Categorial Grammar, a theory of syntax in which grammatical categories are viewed as functions, be augmented with operators such as functional composition and type raising in order to analyze • noncanonical" syntactic constructions such as whextraction and node raising. A consequence of these augmentations is an explosion of se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989