Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6447Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Ristad, Eric Sven | - |
| dc.date | 2004-10-04T14:56:34Z | - |
| dc.date | 2004-10-04T14:56:34Z | - |
| dc.date | 1986-04-01 | - |
| dc.date.accessioned | 2013-10-09T02:45:28Z | - |
| dc.date.available | 2013-10-09T02:45:28Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-895 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6447 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | This paper is a formal analysis of whether generalized phrase structure grammar's (GPSG) weak context-free generative power will allow it to achieve three of its central goals: (1) to characterize all and only the natural language grammars, (2) to algorithmically determine membership and generative power consequences of GPSG's and (3) to embody the universalism of natural language entirely in the formal system. I prove that "=E*?" is undecidable for GPSGs and, on the basis of this result and the unnaturalness of E*, I argue that GPSG's three goals and its weak context-free generative power conflict with each other: there is no algorithmic way of knowing whether any given GPSG generates a natural language or an unnatural one. The paper concludes with a diagnosis of the result and suggests that the problem might be met by abandoning the weak context-free framework and assuming substantive constraints. | - |
| dc.format | 1619510 bytes | - |
| dc.format | 644622 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-895 | - |
| dc.title | Defining Natural Language Grammars in GPSG | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.