9 search results - page 1 / 2 » Lambek Grammars Based on Pregroups |
LACL
2001
Springer
13 years 9 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...
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...
LACL
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
ICGI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first ...
ACL
2001
13 years 6 months ago
2001
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation...