Pregroup grammars and Chomsky's earliest examples

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 Computational linguistics  Categorial grammars  Pregroup grammars
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 12,068
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

16 ( #108,418 of 1,101,833 )

Recent downloads (6 months)

1 ( #306,516 of 1,101,833 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.