Sciweavers

Share
31 search results - page 1 / 7
» Learnability of Pregroup Grammars
Sort
View
ICGI
2004
Springer
10 years 9 months ago
Learnability of Pregroup Grammars
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 ...
Denis Béchet, Annie Foret, Isabelle Tellier
LACL
2001
Springer
10 years 8 months ago
Lambek Grammars Based on Pregroups
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...
Wojciech Buszkowski
JOLLI
2010
84views more  JOLLI 2010»
10 years 2 months ago
Exploring Feature Agreement in French with Parallel Pregroup Computations
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...
Joachim Lambek
LATA
2010
Springer
11 years 1 months ago
Pregroup Grammars with Letter Promotions
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)
Wojciech Buszkowski, Zhe Lin
ISMIR
2004
Springer
105views Music» more  ISMIR 2004»
10 years 9 months ago
Pregroup Grammars for Chords
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...
Richard Terrat
books