31 search results - page 1 / 7 » Learnability of Pregroup Grammars |
ICGI
2004
Springer
13 years 9 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 ...
LACL
2001
Springer
13 years 8 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 2 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...
LATA
2010
Springer
14 years 1 months ago
2010
Springer
We study pregroup grammars with letter promotions p(m) q(n) . We show that the Letter Promotion Problem for pregroups is solvable in polynomial time, if the size of p(n)
ISMIR
2004
Springer
13 years 9 months ago
2004
Springer
Pregroups had been conceived as an algebraic tool to recognize grammatically well-formed sentences in natural languages [3]. Here we wish to use pregroups to recognize well-formed...