Computational Structure of GPSG Models: Revised Generalized Phrase Structure Grammar

dc.creator	Ristad, Eric Sven
dc.date	2004-10-20T19:58:16Z
dc.date	2004-10-20T19:58:16Z
dc.date	1989-09-01
dc.date.accessioned	2013-10-09T02:47:06Z
dc.date.available	2013-10-09T02:47:06Z
dc.date.issued	2013-10-09
dc.identifier	AITR-1170
dc.identifier	http://hdl.handle.net/1721.1/6821
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	The primary goal of this report is to demonstrate how considerations from computational complexity theory can inform grammatical theorizing. To this end, generalized phrase structure grammar (GPSG) linguistic theory is revised so that its power more closely matches the limited ability of an ideal speaker--hearer: GPSG Recognition is EXP-POLY time hard, while Revised GPSG Recognition is NP-complete. A second goal is to provide a theoretical framework within which to better understand the wide range of existing GPSG models, embodied in formal definitions as well as in implemented computer programs. A grammar for English and an informal explanation of the GPSG/RGPSG syntactic features are included in appendices.
dc.format	93 p.
dc.format	10445845 bytes
dc.format	3991998 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AITR-1170
dc.subject	linguistics
dc.subject	complexity
dc.subject	GPSG
dc.subject	natural language
dc.subject	scomputational structure
dc.subject	computational complexity
dc.title	Computational Structure of GPSG Models: Revised Generalized Phrase Structure Grammar

Files in this item

Files	Size	Format	View
There are no files associated with this item.