Publication:
The Linearization of V(P)-doubling Constructions

Simple item page
dc.contributor.advisorKyle Johnson
dc.contributor.advisorRajesh Bhatt
dc.contributor.advisorEllen Woolford
dc.contributor.advisorLuiz Amaral
dc.contributor.authorYin, Rong
dc.contributor.departmentUniversity of Massachusetts Amherst
dc.date2024-03-27 18:40:32
dc.date.accessioned2024-04-26T15:52:53Z
dc.date.available2024-04-26T15:52:53Z
dc.date.submittedFebruary
dc.date.submitted2022
dc.description.abstractWhen an item moves, it is usually pronounced once but in some cases, it is pronounced multiple times. So, a question is: What determines whether a moved item gets pronounced in only one of its positions or in multiple positions? This dissertation aims at providing an answer to this question by designing a linearization process that yields the correct phonetic realization of a moved item, with a focus on V(P) movement. In particular, this dissertation provides a detailed analysis of how V(P)-doubling cases are linearized and thus show how a V(P) ends up being pronounced multiple times. Regarding the proposed linearization process in this dissertation, following Kusmer (2019), I assume that the basic linearization process contains Candidates Generator G, which generates a set of precedence relations, and Constraints, which pick the right subset from G. As for the Constraints, I adapt the Totality Constraint and the Asymmetry Constraint from Kayne (1994), the Anti-reflexivity Constraint from Partee, ter Meulen and Wall (1990), and Language Specific Constraints from Wilder (1999) and Kusmer (2019). In addition, I propose an Ordering Deletion rule that gets rid of redundant precedence relations and a Set-to-String algorithm that turns a set of precedence relations into a string. Furthermore, I adopt the idea from Fox and Pesetsky (2005) that linearization of precedence relations is implemented in a cyclic way. Also, I employ the idea behind Nunes (2004)'s morphological reanalysis that a higher level node can be linearized instead of the nodes it contains given certain circumstances. Finally, I present the predictions made by the proposed linearization process, which can be evaluated against more data for future research.
dc.description.degreeDoctor of Philosophy (PhD)
dc.description.departmentLinguistics
dc.identifier.doihttps://doi.org/10.7275/27078593.0
dc.identifier.orcidhttps://orcid.org/0000-0002-4452-1436
dc.identifier.urihttps://hdl.handle.net/20.500.14394/18821
dc.relation.urlhttps://scholarworks.umass.edu/cgi/viewcontent.cgi?article=3527&context=dissertations_2&unstamped=1
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.source.statuspublished
dc.subjectlinearization
dc.subjectverb-doubling
dc.subjectVP-doubling
dc.subjectMandarin Chinese
dc.subjectsyntax
dc.subjectSyntax
dc.titleThe Linearization of V(P)-doubling Constructions
dc.typeopenaccess
dc.typedissertation
digcom.contributor.authorisAuthorOfPublication|email:rongyin25@gmail.com|institution:University of Massachusetts Amherst|Yin, Rong
digcom.identifierdissertations_2/2487
digcom.identifier.contextkey27078593
digcom.identifier.submissionpathdissertations_2/2487
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Yin.pdf
Size:
900.03 KB
Format:
Adobe Portable Document Format
Name: Yin.pdf
Size: 900.03 KB
Kind: Adobe PDF
Collections
Dissertations