𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stochastic Lambek Categorial Grammars

✍ Scribed by Guillaume Bonfante; Philippe de Groote

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
407 KB
Volume
53
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extending Lambek grammars to basic categ
Extending Lambek grammars to basic categorial grammars
✍ Wojciech Buszkowski πŸ“‚ Article πŸ“… 1996 πŸ› Springer Netherlands 🌐 English βš– 931 KB

Pentus (1992) proves the equivalence of LCG's and CFG's, and CFG's are equivalent to BCG's by the Gaifman theorem (Bar-Hillel et al., 1960). This paper provides a procedure to extend any LCG to an equivalent BCG by affixing new types to the lexicon; a procedure of that kind was proposed as early,

The equivalence of Nonassociative Lambek
The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars
✍ Maciej Kandulski πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 699 KB

Besides this introduction the paper contains four sections. I n section 1 we describe three equivalent axiomatizations of NLP. the third one playing important role in what follows. I n section 2 we deal with a system AC: (the Ajdukiewicz calculus with product) and prove the equivalence of AC-grammar

Non-associative Lambek Categorial Gramma
Non-associative Lambek Categorial Grammar in Polynomial Time
✍ Erik Aarts; Kees Trautwein πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 455 KB

We present a new axiomatization of the non-associative Lambek calculus. We prove that it takes polynomial time to reduce any non-associative Lambek categorial grammar to an equivalent context-free grammar. Since it is possible to recognize a sentence generated by a context-free grammar in polynomial