The No-Reference Hypothesis: A Modular Approach to the Syntax-Phonology Interface
Permanent link
https://hdl.handle.net/10037/8438View/ Open
Thesis introduction (PDF)
Paper I. Lexical and Functional Decomposition in Syntax: A view from Phonology. Šurkalović, D. Also available in Poznan Studies in Contemporary Linguistics, 47(2), 2011, pp. 399–425 (PDF)
Paper II. Modularity, Linearization and Phase-Phase Faithfulness in Kayardild. Šurkalović, D. Also available in Iberia: An International Journal of Theoretical Linguistics, 3(1), 2011, pp. 81-118. (PDF)
Paper III. Modularity, Phase-Phase Faithfulness and Prosodification of Function Words in English. Šurkalović, D. Also available in Nordlyd, 40(1), 2013, pp. 301-322 (PDF)
Thesis entire (PDF)
Date
2016-01-22Type
Doctoral thesisDoktorgradsavhandling
Author
Šurkalović, DraganaAbstract
This dissertation investigates the interface of syntax and phonology in a fully modular view of language, deriving the effects of syntactic structure on prosodification without referring to that structure in the phonological computation. It explores the effects of the Multiple Spell-Out Hypothesis and ‘syntax-all-the-way-down approaches’, specifically Nanosyntax, on the phonological computation. The dissertation addresses three issues for modularity: (i) phonology can see edges of syntactic constituents, (ii) phonology distinguishes between lexical and functional elements in syntax, and (iii) phonology recognizes Information Structure marking features. The No-Reference Hypothesis is presented as the solution. It states that phonological computation needs to proceed in phases in order to achieve domain mapping while maintaining an input to phonology consisting of purely phonological information. The dissertation provides an explicit account of how the outputs of different phases get linearized wrt each other, providing arguments that spell-out does not proceed in chunks but produces cumulative cyclic input to phonology. An analysis is provided, using data from English, Kayardild and Ojibwa, showing how prosodic domains can be derived from phases by phonological computation being faithful to the prosodification output of the previous phase. The analysis is formalized by introducing Phase-Phase Faithfulness constraints to Optimality Theory.
Publisher
UiT Norges arktiske universitetUiT The Arctic University of Norway
Metadata
Show full item recordCollections
Copyright 2016 The Author(s)
The following license file are associated with this item: