Lambek Calculus for Transformational Grammar

نویسنده

  • Thomas L. Cornell
چکیده

In this paper we present a formalization of some ideas from Chomsky (1995) in the framework of multimodal type logical grammar (e.g., Moortgat (1996) and refs). This project is in many respects rather straightforward, but makes use of aspects of the type logical machinery which are generally not used, or at least not used for these purposes, in categorial grammar. This allows us to investigate to some degree the relation between analyses of extraction phenomena based on hypothetical reasoning—the classical categorial approach—and those based on movement, seen here as a complex of structural rules fed by product types appearing in lexical type formulas.

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

ثبت نام

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

منابع مشابه

Book Review: Categorial Grammar: Logical Syntax, Semantics, and Processing by Glyn V. Morrill

The title of this book, Categorial Grammar: Logical Syntax, Semantics, and Processing, indicates that this will be a book about categorial grammar. In the preface, however, several strains of categorial grammar are discussed, including combinatory categorial grammar (Steedman 2000), pregroup grammar (Lambek 1999), and abstract categorial grammar (de Groote 2001), and it is clarified that the bo...

متن کامل

Cyclic pregroups and natural language: a computational algebraic analysis

The calculus of pregroups is introduced by Lambek [1999] as an algebraic computational system for the grammatical analysis of natural languages. Pregroups are non commutative structures, but the syntax of natural languages shows a diffuse presence of cyclic patterns exhibited in different kinds of word order changes. The need of cyclic operations or transformations was envisaged both by Z. Harr...

متن کامل

Product-Free Lambek Calculus and Context-Free Grammars

In this paper we prove the Chomsky Conjecture (all languages recognized by the Lambek calculus are context-free) for both the full Lambek calculus and its product-free fragment. For the latter case we present a construction of context-free grammars involving only product-free types.

متن کامل

Lambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars

Two recent extension of the nonassociative Lambek calculus, the LambekGrishin calculus and the multimodal Lambek calculus, are shown to generate class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.

متن کامل

Parsing for Semidirectional Lambek Grammar is NP-Complete

We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call semidirectional. In semidirectional Lambek calculus SDL there is an additional nondirectional abstraction rule allowing the formula abstracted over to appear anywhere in the premise sequent’s left-hand side, thus permitting non-peripheral extraction. SDL grammars are able to gener...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 1999