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.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/6821 |
| Date | 01 September 1989 |
| Creators | Ristad, Eric Sven |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 93 p., 10445845 bytes, 3991998 bytes, application/postscript, application/pdf |
| Relation | AITR-1170 |
Page generated in 0.0026 seconds