Quantifier-free tree transductions

Ikawa, Shiori; Ohtaka, Akane; Jardine, Adam

doi:10.7275/k1gj-bq24

Cited by 2 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, our mappings are essentially just firstorder logic predicates. In this respect, recent work on phonological transformations has shown that they can be handled with Quantifier-Free string transductions (Chandlee and Lindell, in in review;Strother-Garcia, 2019;Chandlee and Jardine, 2019b), and in the future it would be interesting to see if our mappings could be further refined to work in terms of Quantifier-Free tree transductions (Ikawa et al, 2020;Dolatian, 2020).…”

Section: Broad Complexity Considerationsmentioning

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: Broad Complexity Considerationsmentioning

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

Quantifier-free tree transductions

Cited by 2 publications

References 4 publications

Logical Transductions for the Typology of Ditransitive Prosody

Logical Transductions for the Typology of Ditransitive Prosody

Recursive prosody is not finite-state

Contact Info

Product

Resources

About