Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5615Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Ristad, Eric Sven | - |
| dc.date | 2004-10-01T20:17:11Z | - |
| dc.date | 2004-10-01T20:17:11Z | - |
| dc.date | 1985-03-01 | - |
| dc.date.accessioned | 2013-10-09T02:40:18Z | - |
| dc.date.available | 2013-10-09T02:40:18Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-837 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5615 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Proponents of generalized phrase structure grammar (GPSG) cite its weak context-free generative power as proof of the computational tractability of GPSG-Recognition. Since context-free languages (CFLs) can be parsed in time proportional to the cube of the sentence length, and GPSGs only generate CFLs, it seems plausible the GPSGs can also be parsed in cubic time. This longstanding, widely assumed GPSG "efficient parsability" result in misleading: parsing the sentences of an arbitrary GPSG is likely to be intractable, because a reduction from 3SAT proves that the universal recognition problem for the GPSGs of Gazdar (1981) is NP-hard. Crucially, the time to parse a sentence of a CFL can be the product of sentence length cubed and context-free grammar size squared, and the GPSG grammar can result in an exponentially large set of derived context-free rules. A central object in the 1981 GPSG theory, the metarule, inherently results in an intractable parsing problem, even when severely constrained. The implications for linguistics and natural language parsing are discussed. | - |
| dc.format | 11 p. | - |
| dc.format | 3087711 bytes | - |
| dc.format | 2405273 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-837 | - |
| dc.subject | GPSG | - |
| dc.subject | parsing | - |
| dc.subject | complexity | - |
| dc.subject | natural language | - |
| dc.subject | linguistics | - |
| dc.subject | snatural language parsing | - |
| dc.title | GPSG-Recognition is NP-Hard | - |
| 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.