@inproceedings{f9b361ccc3674e6fb7b9113685502988,
title = "Recursive prosody is not finite-state",
abstract = "This paper investigates bounds on the generative capacity of prosodic processes, by focusing on the complexity of recursive prosody in coordination contexts in English (Wagner, 2010). Although all phonological processes and most prosodic processes are computationally regular string languages, we show that recursive prosody is not. The output string language is instead parallel multiple context-free (Seki et al., 1991). We evaluate the complexity of the pattern over strings, and then move on to a characterization over trees that requires the expressivity of multi bottom-up tree transducers. In doing so, we provide a foundation for future mathematically grounded investigations of the syntax-prosody interface.",
author = "Hossep Dolatian and \{De Santo\}, Aniello and Thomas Graf",
note = "Publisher Copyright: {\textcopyright} 2021 The Association for Computational Linguistics and The Asian Federation of Natural Language Processing.; 18th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology, SIGMORPHON 2021 ; Conference date: 05-08-2021",
year = "2021",
language = "English",
series = "SIGMORPHON 2021 - 18th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology, Proceedings of the Workshop",
publisher = "Association for Computational Linguistics (ACL)",
pages = "11--22",
editor = "Garrett Nicolai and Kyle Gorman and Ryan Cotterell",
booktitle = "SIGMORPHON 2021 - 18th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology, Proceedings of the Workshop",
}