Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition

Studia Logica 87 (2-3):199-224 (2007)
  Copy   BIBTEX

Abstract

The paper presents a way to transform pregroup grammars into contextfree grammars using functional composition. The same technique can also be used for the proof-nets of multiplicative cyclic linear logic and for Lambek calculus allowing empty premises

Categories

Keywords

Reprint years

DOI

10.1007/s11225-007-9084-3

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Extended Pregroup Grammars Applied to Natural Languages.Aleksandra Kiślak-Malinowska - 2012 - Logic and Logical Philosophy 21 (3):229-252.
Pregroup Grammars and Chomsky’s Earliest Examples.J. Lambek - 2008 - Journal of Logic, Language and Information 17 (2):141-160.
Toward discourse representation via pregroup grammars.Anne Preller - 2007 - Journal of Logic, Language and Information 16 (2):173-194.
Product-free Lambek calculus and context-free grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
On Commutative and Nonassociative Syntactic Calculi and Categorial Grammars.Maciej Kandulski - 1995 - Mathematical Logic Quarterly 41 (2):217-235.
Normal form of derivations in the nonassociative and commutative lambek calculus with product.Maciej Kandulski - 1993 - Mathematical Logic Quarterly 39 (1):103-114.
Should Pregroup Grammars be Adorned with Additional Operations?Joachim Lambek - 2007 - Studia Logica 87 (2-3):343-358.
Lambek grammars as combinatory categorial grammars.G. Jäger - 2001 - Logic Journal of the IGPL 9 (6):781-792.
On the equivalence of Ajdukiewicz-Lambek calculus and simple phrase structure grammars.Wojciech Zielonka - 1976 - Bulletin of the Section of Logic 5 (2):1-4.
Exploring feature agreement in French with parallel pregroup computations.Joachim Lambek - 2010 - Journal of Logic, Language and Information 19 (1):75-88.
A faithful representation of non-associative Lambek grammars in abstract categorial grammars.Christian Retoré & Sylvain Salvati - 2010 - Journal of Logic Language and Information 19 (2):185-200.
Sequentially indexed grammars.Jan van Eijck - unknown
On reduction systems equivalent to the Lambek calculus with the empty string.Wojciech Zielonka - 2002 - Studia Logica 71 (1):31-46.
Learnability of Pregroup Grammars.Denis Béchet, Annie Foret & Isabelle Tellier - 2007 - Studia Logica 87 (2-3):225-252.
Should Pregroup Grammars Be Adorned with Additional Operations? To Michael Moortgat on His First Half Century.Joachim Lambek - 2007 - Studia Logica 87 (2-3):343 - 358.

Analytics

Added to PP
2009-01-28

Downloads
23 (#664,515)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Type Logics and Pregroups.Wojciech Buszkowski - 2007 - Studia Logica 87 (2-3):145-169.

Add more citations

References found in this work

The Mathematics of Sentence Structure.Joachim Lambek - 1958 - Journal of Symbolic Logic 65 (3):154-170.
Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.
Quantales and (noncommutative) linear logic.David N. Yetter - 1990 - Journal of Symbolic Logic 55 (1):41-64.
The structure of multiplicatives.Vincent Danos & Laurent Regnier - 1989 - Archive for Mathematical Logic 28 (3):181-203.

View all 7 references / Add more references