DSpace Repository

Complexity of Human Language Comprehension

Show simple item record

dc.creator Ristad, Eric Sven
dc.date 2004-11-19T17:17:53Z
dc.date 2004-11-19T17:17:53Z
dc.date 1988-12-01
dc.date.accessioned 2013-10-09T02:49:15Z
dc.date.available 2013-10-09T02:49:15Z
dc.date.issued 2013-10-09
dc.identifier AIM-964
dc.identifier http://hdl.handle.net/1721.1/7341
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description 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.
dc.format 49 p.
dc.format 5602405 bytes
dc.format 2090110 bytes
dc.format application/postscript
dc.format application/pdf
dc.language en_US
dc.relation AIM-964
dc.subject linguistic theory
dc.subject natural language
dc.subject computational complexity
dc.subject government-binding
dc.subject phonology
dc.subject syntax
dc.title Complexity of Human Language Comprehension

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account