computational phonology

Structure and Learning in Natural Language

My doctoral dissertation, examining the relationship between abductive inference and algebraically structured hypothesis spaces, giving a general form for grammar learning over arbitrary linguistic structure.

Typology Emerges from Simplicity in Representations and Learning

We derive the well-studied subregular classes of formal languages, which computationally characterize natural language typology, purely from the perspective of algorithmic learning problems.

Computational Restrictions on Iterative Prosodic Processes

We formalize various iterative prosodic processes including stress, syllabification and epenthesis using logical graph transductions, showing that the necessary use of fixed point operators without quantification restricts them to a structured subclass of subsequential functions.

Computational Locality in Nonlinear Morphophonology

We present an automata-theoretic analysis of locality in nonlinear phonology and morphology.

Strong Generative Capacity of Morphological Processes

We analyze divergences in strong generative capacity between morphological processes that are equivalent in weak generative capacity.

The Computational Power of Harmony

We overview vowel harmony computationally, describing necessary and sufficient conditions on phonotactics, processes, and learning.

Phonological Abstractness in the Mental Lexicon

We overview the notion of phonological abstractness, various types of evidence for it, and consequences for linguistics and psychology.

The Logical Nature of Phonology Across Speech and Sign

This article examines whether the computational properties of phonology hold across spoken and signed languages, using model theory and logical transductions.

Probing RNN Encoder-Decoder Generalization of Subregular Functions using Reduplication

We analyze the expressivity of a variety of recurrent encoder-decoder networks, showing they are limited to learning subsequential functions, and connecting RNNs with attention mechanisms to a class of deterministic 2-way transducers.

Multi-Input Strictly Local Functions for Templatic Morphology

We provide an automata-theoretic characterization of templatic morphology, extending strict locality to consider n-ary functions.