Kevin McMullin


2020

pdf bib
Modelling non-local maps as Strictly Piecewise Functions
Phillip Burness | Kevin McMullin
Proceedings of the Society for Computation in Linguistics 2020

pdf bib
Multi-Tiered Strictly Local Functions
Phillip Burness | Kevin McMullin
Proceedings of the 17th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology

Tier-based Strictly Local functions, as they have so far been defined, are equipped with just a single tier. In light of this fact, they are currently incapable of modelling simultaneous phonological processes that would require different tiers. In this paper we consider whether and how we can allow a single function to operate over more than one tier. We conclude that multiple tiers can and should be permitted, but that the relationships between them must be restricted in some way to avoid overgeneration. The particular restriction that we propose comes in two parts. First, each input element is associated with a set of tiers that on their own can fully determine what the element is mapped to. Second, the set of tiers associated to a given input element must form a strict superset-subset hierarchy. In this way, we can track multiple, related sources of information when deciding how to process a particular input element. We demonstrate that doing so enables simple and intuitive analyses to otherwise challenging phonological phenomena.

2019

pdf bib
Efficient learning of Output Tier-based Strictly 2-Local functions
Phillip Burness | Kevin McMullin
Proceedings of the 16th Meeting on the Mathematics of Language