Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Pregroup Grammars and Chomsky's Earliest Examples

J. Lambek
Journal of Logic, Language, and Information
Vol. 17, No. 2 (Spring 2008), pp. 141-160
Published by: Springer
Stable URL: http://www.jstor.org/stable/41217803
Page Count: 20
  • Download ($43.95)
  • Cite this Item
Pregroup Grammars and Chomsky's Earliest Examples
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
[141]
    [141]
  • Thumbnail: Page 
142
    142
  • Thumbnail: Page 
143
    143
  • Thumbnail: Page 
144
    144
  • Thumbnail: Page 
145
    145
  • Thumbnail: Page 
146
    146
  • Thumbnail: Page 
147
    147
  • Thumbnail: Page 
148
    148
  • Thumbnail: Page 
149
    149
  • Thumbnail: Page 
150
    150
  • Thumbnail: Page 
151
    151
  • Thumbnail: Page 
152
    152
  • Thumbnail: Page 
153
    153
  • Thumbnail: Page 
154
    154
  • Thumbnail: Page 
155
    155
  • Thumbnail: Page 
156
    156
  • Thumbnail: Page 
157
    157
  • Thumbnail: Page 
158
    158
  • Thumbnail: Page 
159
    159
  • Thumbnail: Page 
160
    160