Complexity of Human Language Comprehension
dc.date.accessioned | 2004-11-19T17:17:53Z | |
dc.date.accessioned | 2018-11-24T10:23:46Z | |
dc.date.available | 2004-11-19T17:17:53Z | |
dc.date.available | 2018-11-24T10:23:46Z | |
dc.date.issued | 1988-12-01 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/7341 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/7341 | |
dc.description.abstract | The goal of this article is to reveal the computational structure of modern principle-and-parameter (Chomskian) linguistic theories: what computational problems do these informal theories pose, and what is the underlying structure of those computations? To do this, I analyze the computational complexity of human language comprehension: what linguistic representation is assigned to a given sound? This problem is factored into smaller, interrelated (but independently statable) problems. For example, in order to understand a given sound, the listener must assign a phonetic form to the sound; determine the morphemes that compose the words in the sound; and calculate the linguistic antecedent of every pronoun in the utterance. I prove that these and other subproblems are all NP-hard, and that language comprehension is itself PSPACE-hard. | en_US |
dc.format.extent | 49 p. | en_US |
dc.format.extent | 5602405 bytes | |
dc.format.extent | 2090110 bytes | |
dc.language.iso | en_US | |
dc.subject | linguistic theory | en_US |
dc.subject | natural language | en_US |
dc.subject | computational complexity | en_US |
dc.subject | government-binding | en_US |
dc.subject | phonology | en_US |
dc.subject | syntax | en_US |
dc.title | Complexity of Human Language Comprehension | en_US |
Files in this item
Files | Size | Format | View |
---|---|---|---|
AIM-964.pdf | 2.090Mb | application/pdf | View/ |
AIM-964.ps | 5.602Mb | application/postscript | View/ |