Search Results for author: Thomas Graf

Found 18 papers, 0 papers with code

Recursive prosody is not finite-state

no code implementations ACL (SIGMORPHON) 2021 Hossep Dolatian, Aniello De Santo, Thomas Graf

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).

Trees probe deeper than strings: an argument from allomorphy

no code implementations NAACL (SIGMORPHON) 2022 Hossep Dolatian, Shiori Ikawa, Thomas Graf

The trigger and target can either be linearly adjacent or non-adjacent, and either the trigger precedes the target (inwardly sensitive) or the target precedes the trigger (outwardly sensitive).

Sanskrit n-Retroflexion is Input-Output Tier-Based Strictly Local

no code implementations WS 2018 Thomas Graf, Connor Mayer

Sanskrit /n/-retroflexion is one of the most complex segmental processes in phonology.

Cannot find the paper you are looking for? You can Submit a new open access paper.