Search for: All records

This paper investigates the role recursive structures play in prosody. In current understanding, phonological phrasing is computed by a general syntax–prosody mapping algorithm. Here, we are interested in recursive structure that arises in response to morphosyntactic structure that needs to be mapped. We investigate the types of recursive structures found in prosody, specifically: For a prosodic category κ, besides the adjunctive type of recursion κ[κ x], κ[x κ], is there also the coordinative type κ[κ κ]? Focusing on the prosodic forms of compounds in two typologically rather different languages, Danish and Japanese, we encounter three types of recursive word structures: coordinative ω[ω ω], left-adjunctive ω[f ω], right-adjunctive ω[ω f] and the strictly layered compound structure ω[f f]. In addition, two kinds of coordinative φ-compounds are found in Japanese, one with a non-recursive (strictly layered) structure φ[ω ω], a mono-phrasal compound consisting of two words, and one with coordinative recursion φ[φ φ], a bi-phrasal compound. A cross-linguistically rare type of post-syntactic compound has this biphrasal structure, a fact to be explained by its sentential origin. 

Analyses of Irish phonological phrasing (Elfner 2012 et seq.) have been influential in shaping Match Theory (Selkirk 2011), an OT approach to mapping syntactic to prosodic structure. We solve two constraint ranking paradoxes concerning the relative ranking of Match and StrongStart. Irish data indicate that while XPs with silent heads can fail to map to phonological phrases in certain circumstances, overtly headed XPs cannot. They also indicate that rebracketing due to the constraint StrongStart occurs only sentence-initially, contrary to predictions. We account for these puzzles by invoking Van Handel's (2019) Match constraint which sees only XPs with overt heads, and by positing a new version of StrongStart which only applies to material at the left edge of the intonational phrase. Our analysis is developed using the Syntax-Prosody in Optimality Theory application (SPOT) and OTWorkplace. 

SPOT (Syntax Prosody in Optimality Theory app; http://spot.sites.ucsc.edu) automates candidate generation and evaluation for work on the syntax-prosody interface. SPOT is intended to facilitate the creation and comparison of multiple versions of an analysis, in service of refining constraint definitions and theory development. The codebase is available at https://github.com/syntax-prosody-ot. This paper briefly explains the motivation for the SPOT app, then walks through the process of creating an analysis in SPOT. We show how to create input syntactic trees, either manually or automatically; how to select a constraint set; and how to generate tableaux with candidates, constraints, and violation counts. Finally, we show how to use the output of SPOT to calculate rankings and typologies using an OT application. 

This paper proposes to subsume Syntax-Prosody Match Theory under General Correspondence Theory, which distinguishes purely existential MAX/DEP constraints (requiring nothing but the existence of a correspondent in the output/input, which can be rather different from the input element) from IDENT and other faithfulness constraints. Exact correspondence (preservation of edges, no deletion, no insertion, uniqueness of mapping, order preservation, etc.) is enforced by Syntax-Prosody and Prosody-Syntax Alignment and by standard Faithfulness. The empirical topic is the impossibility of phrase-final enclisis in English (*I don't know where Tom's vs. Tom's here) and its proper explanation. 

Abstract Much recent work on the syntax-prosody interface has been based in Optimality Theory. The typical analysis explicitly considers only a small number of candidates that could reasonably be expected to be optimal under some ranking, often without an explicit definition of GEN. Manually generating all the possible candidates, however, is prohibitively time-consuming for most input structures – the Too Many Candidates Problem. Existing software for OT uses regular expressions for automated generation and evaluation of candidates. However, regular expressions are too low in the Chomsky Hierarchy of language types to represent trees of arbitrary size, which are needed for syntax-prosody work. This paper presents a new computational tool for research in this area: Syntax-Prosody in Optimality Theory (SPOT). For a given input, SPOT generates all prosodic parses under certain assumptions about GEN, and evaluates them against all constraints in CON. This allows for in-depth comparison of the typological predictions made by different theories of GEN and CON at the syntax-prosody interface.