Linear processing with pregroups

Studia Logica 87 (2-3):171 - 197 (2007)
Pregroup grammars have a cubic recognition algorithm. Here, we define a correct and complete recognition and parsing algorithm and give sufficient conditions for the algorithm to run in linear time. These conditions are satisfied by a large class of pregroup grammars, including grammars that handle coordinate structures and distant constituents.
Keywords Philosophy   Computational Linguistics   Mathematical Logic and Foundations   Logic
Categories (categorize this paper)
DOI 10.2307/40210807
 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: 16,667
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
Anne Preller (2007). Toward Discourse Representation Via Pregroup Grammars. Journal of Logic, Language and Information 16 (2):173-194.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

12 ( #205,927 of 1,726,249 )

Recent downloads (6 months)

2 ( #289,836 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

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