Welcome! I am a computational linguist, specializing in theoretical phonology. My research program is focused on identifying the computational properties of phonological grammars and showing how such properties contribute to our understanding of phonological typology and learning. In particular, I demonstrate the role that computational restrictions on input-output maps play in delimiting the set of ‘possible’ phonological processes. These same restrictions also serve as inductive biases that enable efficient learning of such maps from a finite amount of positive data. This work is necessarily inter-disciplinary, combing insights and methodologies from theoretical linguistics, computer science, grammatical inference, and psycholinguistics.
My CV is available here.
Recent and Upcoming Activity
- Giving a talk at LSA in January in New Orleans: ‘Non-derived Environment Blocking: a Computational Account’
- Co-organizing an NSF-funded Workshop on Formal Language Theory in Linguistics at this year’s meeting of the Society for Computation in Linguistics, co-located with the LSA Annual Meeting in January.
- Poster presentation at this year’s NELS at MIT: “A Computational Analysis of Tone Sandhi Ordering Paradoxes”, co-authored with Christopher Oakden (Rutgers University)
- Giving a talk at this year’s AMP at Stony Brook University.
- Two talks at the Mathematics of Language conference: ‘Quantifier-free least fixed point functions for phonology’, co-authored with Adam Jardine, and ‘Learning with Partially Ordered Representations’, co-authored with Remi Eyraud, Jeffrey Heinz, Adam Jardine and Jonathan Rawski
- ‘A Computational Account of Tone Sandhi Interaction’ now published in the Proceedings of AMP 2018.
- ‘Autosegmental Input Strictly Local Functions’ (co-authored with Adam Jardine) is now published in TACL volume 7.