A theory of individual-level predicates based on blind mandatory implicatures : constraint promotion for optimality theory
Name
608244155-MIT.pdf
Description
Full printable version
Size
24.67 MB
Format
Adobe PDF
Checksum (MD5)
c3da829ac04e07b7ca0779bf3c9ec1ca
Author(s)
Magri, Giorgio, 1975-
Advisor(s)
Adam Albright and Danny Fox.
Date Issued
2009
Publisher
Massachusetts Institute of Technology
Abstract
Part I of this dissertation proposes an implicature-based theory of individual-level predicates. The idea is that we cannot say '#John is sometimes tall' because the sentence triggers the scalar implicature that the alternative 'John is always tall' is false and this implicature mismatches with the piece of common knowledge that tallness is a permanent property. Chapter 1 presents the idea informally. This idea faces two challenges. First, this scalar implicature must be mandatory and furthermore blind to common knowledge. Second, it is not clear how this idea extends to other properties of individual-level predicates. Chapter 2 makes sense of the surprising nature of these special mismatching implicatures within the recent grammatical framework for scalar implicatures of Chierchia (2004) and Fox (2007a). Chapter 3 shows how this implicature-based account can be extended to other properties of individuallevel predicates, such as restrictions on their bare plural subjects, on German word order and extraction, and on Q-adverbs. Part H of this dissertation develops a theory of update rules for the OT on-line algorithm that perform constraint promotion too, besides demotion. Chapter 4 explains why we need constraint promotion, by arguing that demotion-only update rules are unable to model Hayes' (2004) early stage of the acquisition of phonology. Chapter 5 shows how to get constraint promotion, by means of two different techniques. One technique shares the combinatoric flavor of Tesar and Smolensky's analysis of demotion-only update rules.
(cont.) The other technique consists of adapting to OT results from the theory of on-line algorithms for linear classification. The latter technique has various consequences interesting on their own, explored in Chapter 8. Chapters 6 and 7 start the investigation of the properties of update rules that perform promotion too, concentrating on the characterization of the final vector and on the number of updates.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. [283]-293).
Subjects
Linguistics and Philosophy.
MIT Department
Massachusetts Institute of Technology. Department of Linguistics and Philosophy
Terms of Use
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.
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.
Persistent DSpace Link
