179 search results - page 1 / 36 » Lambek Grammars Are Context Free |
LICS
1993
IEEE
13 years 9 months ago
1993
IEEE
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are context free.
BIRTHDAY
2009
Springer
14 years 7 days ago
2009
Springer
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
LACL
2001
Springer
13 years 10 months ago
2001
Springer
Lambek [13] introduces pregroups as a new framework for syntactic structure. In this paper we prove some new theorems on pregroups and study grammars based on the calculus of free...
DLT
2009
13 years 3 months ago
2009
Abstract. We consider algorithms for approximating context
JOLLI
2010
13 years 3 months ago
2010
One way of coping with agreement of features in French is to perform two parallel computations, one in the free pregroup of syntactic types, the other in that of feature types. Tec...