dc.contributor.advisor | Robert C. Berwick. | en_US |
dc.contributor.author | Nguyen, Chieu V | en_US |
dc.contributor.other | Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. | en_US |
dc.date.accessioned | 2011-02-23T15:00:55Z | |
dc.date.available | 2011-02-23T15:00:55Z | |
dc.date.copyright | 2009 | en_US |
dc.date.issued | 2009 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/61298 | |
dc.description | Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009. | en_US |
dc.description | Cataloged from PDF version of thesis. | en_US |
dc.description | Includes bibliographical references (p. 71-73). | en_US |
dc.description.abstract | The Minimalist Program in current linguistic theory seeks to explain linguistic structure in terms of economy principles, under the assumption that the human language faculty is a perfect system that performs only enough work to satisfy interface requirements. We consider processing costs as a property of syntactic computation and propose that these principles of economy may be met by the availability of alternative operations, each favorable in different circumstances. We characterize the basic Merge operation as a collection of three nested operations that apply to three corresponding levels of nested syntactic data types. In this framework, we provide an analysis of coordinate structure that uses a goal of minimizing processing cost to explain a number of peculiar characteristics of coordination, including the Coordination of Likes Constraint, the Coordinate Structure Constraint, and apparent case and agreement violations. | en_US |
dc.description.statementofresponsibility | by Chieu V. Nguyen. | en_US |
dc.format.extent | 73 p. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Massachusetts Institute of Technology | en_US |
dc.rights | M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission. | en_US |
dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | en_US |
dc.subject | Electrical Engineering and Computer Science. | en_US |
dc.title | Primitive computations in phrase construction | en_US |
dc.type | Thesis | en_US |
dc.description.degree | M.Eng. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
dc.identifier.oclc | 702645479 | en_US |