Pregroup grammars and Chomsky's earliest examples
Journal of Logic, Language and Information 17 (2) (2008)
| Abstract | Pregroups are partially ordered monoids in which each element has two “adjoints”. Pregroup grammars provide a computational approach to natural languages by assigning to each word in the mental dictionary a type, namely an element of the pregroup freely generated by a partially ordered set of basic types. In this expository article, the attempt is made to introduce linguists to a pregroup grammar of English by looking at Chomsky’s earliest examples. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesAnne Preller & Mehrnoosh Sadrzadeh (2011). Semantic Vector Models and Functional Models for Pregroup Grammars. Journal of Logic, Language and Information 20 (4):419-443.
Joachim Lambek (2007). Should Pregroup Grammars Be Adorned with Additional Operations? To Michael Moortgat on His First Half Century. Studia Logica 87 (2/3):343 - 358.
Anne Preller (2007). Toward Discourse Representation Via Pregroup Grammars. Journal of Logic, Language and Information 16 (2).
Joachim Lambek (2007). Should Pregroup Grammars Be Adorned with Additional Operations? Studia Logica 87 (2-3).
Anne Preller (2007). Linear Processing with Pregroups. Studia Logica 87 (2-3):171 - 197.
Denis Béchet (2007). Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition. Studia Logica 87 (2-3):199 - 224.
Nissim Francez & Michael Kaminski (2007). Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages. Studia Logica 87 (2-3):295 - 321.
Michael Kaminski (2010). Extending Free Pregroups with Lower Bounds. Studia Logica 95 (3).
Denis Béchet, Annie Foret & Isabelle Tellier (2007). Learnability of Pregroup Grammars. Studia Logica 87 (2-3):225 - 252.
Joachim Lambek (2010). Exploring Feature Agreement in French with Parallel Pregroup Computations. Journal of Logic, Language and Information 19 (1).
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads16 ( #75,663 of 556,776 )Recent downloads (6 months)1 ( #64,847 of 556,776 )How can I increase my downloads? |
My notes
Discussion
