Multi-Input Strictly Local Functions for Templatic Morphology


This paper presents an automata-theoretic characterization of templatic morphology. We generalize the Input Strictly Local class of functions, which characterize a majority of concatenative morphology, to consider multiple lexical inputs. We show that strictly local asynchronous multi-tape transducers successfully capture this typology of nonconcatenative template filling. This characterization and restriction uniquely opens up representational issues in morphological computation.

In Proceedings of the Society for Computation in Linguistics
Jon Rawski
Jon Rawski

I am a PhD student working at the interface of mathematics, linguistics, cognitive science, and algorithmic learning theory.