Imdlawn Tashlhiyt Berber Syllabification is Quantifier-Free

Strother‐Garcia, Kristina

doi:10.7275/r5j67f4d

Cited by 3 publications

(1 citation statement)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we illustrate the use of Monadic Second Order (MSO) logic to define tree-to-tree transductions. MSO transductions are equivalent to regular functions (Filiot, 2015), and have been commonly employed to model both segmental and autosegmental phonological processes (Jardine, 2016;Chandlee and Jardine, 2019a;Strother-Garcia, 2018).…”

Section: Logical Tree Transductionsmentioning

confidence: 99%

Logical Transductions for the Typology of Ditransitive Prosody

Vu¹,

Santo²,

Dolatian³

2022

Proceedings of the 19th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology

View full text Add to dashboard Cite

Given the empirical landscape of possible prosodic parses, this paper examines the computations required to formalize the mapping from syntactic structure to prosodic structure. In particular, we use logical tree transductions to define the prosodic mapping of ditransitive verb phrases in SVO languages, building off of the typology described in Kalivoda (2018). Explicit formalization of syntax-prosody mapping revealed a number of unanswered questions relating to the fine details of theoretical assumptions behind prosodic mapping.

show abstract

Section: Logical Tree Transductionsmentioning

confidence: 99%

Logical Transductions for the Typology of Ditransitive Prosody

Vu¹,

Santo²,

Dolatian³

2022

Proceedings of the 19th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology

View full text Add to dashboard Cite

show abstract

Recursive prosody is not finite-state

Dolatian¹,

Santo²,

Graf³

2021

Proceedings of the 18th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology

View full text Add to dashboard Cite

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.

show abstract

Q-Theory Representations are Logically Equivalent to Autosegmental Representations

Danis¹,

Jardine²

2019

View full text Add to dashboard Cite

Imdlawn Tashlhiyt Berber Syllabification is Quantifier-Free

Cited by 3 publications

References 24 publications

Logical Transductions for the Typology of Ditransitive Prosody

Logical Transductions for the Typology of Ditransitive Prosody

Recursive prosody is not finite-state

Q-Theory Representations are Logically Equivalent to Autosegmental Representations

Contact Info

Product

Resources

About