(Enter summary)
Abstract: )
Gerald Penn
Computational Linguistics Program,
Carnegie Mellon University
and
OTS Utrecht
gpenn+@cmu.edu
Overview
A method is described for proving the weak
equivalence theorem between natural-deduction
style Lambek Categorial Grammmars (LCG) and
Context-Free Grammars (CFG). The method is
achieved using a simple representation for derivations
from the associative, product-free Lambek
Calculus in the LF meta-language [10], which can
be adapted to the representation of other... (Update)
Cited by: More
A Graph-Theoretic Approach to Sequent Derivability in the Lambek.. - Penn (2001)
(Correct)
Active bibliography (related documents): More All
0.3: Extending Lambek Grammars to Basic Categorial Grammars - Buszkowski (1996)
(Correct)
0.3: Product-free Lambek calculus and context-free grammars - Pentus (1997)
(Correct)
0.2: Lambek Grammars Are Context Free - Pentus (1993)
(Correct)
Similar documents based on text: More All
0.6: Parsing for Semidirectional Lambek Grammar is NP-Complete - Dörre (1996)
(Correct)
0.5: A Study Of Variants Of The Lambek Calculus And An.. - Huang, Parker (1992)
(Correct)
0.4: Structural Facilitation and Structural Inhibition - Morrill (1994)
(Correct)
Related documents from co-citation: More All
2: Higher-order Linear Logic Programming of Categorial Dedution
- Morrill - 1995
2: The Complexity of Parsing with Extended Categorial Grammars (context) - Koenig - 1990
2: Chart parsing lambek grammars: Model extensions and incrementatlity (context) - Hepple - 1992
BibTeX entry: (Update)
Penn, G., On the connection between context-free grammars and lambek categorial grammars, Technical Report CMU-LCL-96-2, Laboratory for Computational Linguistics, Carnegie Mellon University (1996). http://citeseer.ist.psu.edu/penn96connection.html More
@misc{ penn96connection,
author = "G. Penn",
title = "the connection between context-free grammars and lambek categorial grammars",
text = "Penn, G., On the connection between context-free grammars and lambek categorial
grammars, Technical Report CMU-LCL-96-2, Laboratory for Computational Linguistics,
Carnegie Mellon University (1996).",
year = "1996",
url = "citeseer.ist.psu.edu/penn96connection.html" }
Citations (may not include all citations):
434
A Framework for Defining Logics
- Harper, Honsell et al. - 1993
257
Logic Programming in a Fragment of Intuitionistic Linear Log..
- Hodas, Miller - 1994
210
Logic Programming in the LF Logical Framework
- Pfenning - 1991
90
A Linear Logical Framework
- Cervesato, Pfenning - 1995
53
Prolog and Natural-Language Analysis (context) - Pereira, Shieber - 1987
42
Type-Logical Grammar (context) - Morrill - 1994
35
Lambek Grammars are Context-Free
- Pentus - 1992
30
Natural Language Processing in PROLOG: An Introduction to Co.. (context) - Gazdar, Mellish - 1989
22
On Categorial and Phrase Structure Grammars (context) - Bar-Hillel, Gaifman et al. - 1960
18
Generative Power of Categorial Grammars (context) - Buszkowski - 1988
17
Studied Flexibility: Categories and Types in Syntax and Sema.. (context) - Hendriks - 1993
16
Generalized Quantification and Discontinuous Type Constructo.. (context) - Moortgat - 1991
16
The Multiplicative Fragment of Linear Logic is NP-Complete (context) - Kanovich - 1991
13
Chart Parsing Lambek Grammars: Modal Extensions and Incremen..
- Hepple - 1992
10
Lectures on Type-Logical Semantics (context) - Carpenter - 1996
5
The Equivalence of Two Concepts of Categorial Grammar (context) - Cohen - 1967
3
The Complexity of Parsing with Extended Categorial Grammars (context) - Koenig - 1990
1
Investigations in Logic (context) - Aarts - 1995
1
Formal Grammars and Languages (context) - Gladkij - 1973
1
The Horn Gragment of Linear Logic is NP-Complete (context) - Kanovich - 1991
1
A Type-Logical Account of Plurality (context) - Carpenter - 1995
1
An LF Implementation of Gentzen's Theorem for Lambek Categor.. (context) - Penn - 1996
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC