Input Strictly Local opaque maps

Abstract

This paper gives a computational characterisation of opaque interactions in phonology. Specifically, a range of opaque interactions are shown to be Input Strictly Local (ISL) maps (Chandlee 2014), which are string-to-string functions that determine output based only on contiguous sequences of input symbols. Examples from Baković’s (2007) extended typology of counterfeeding, counterbleeding, self-destructive feeding, non-gratuitous feeding and cross-derivational feeding, as well as a case of fed counterfeeding from Kavitskaya & Staroverov (2010), are all given ISL analyses, which show that these interactions can be computed based on sequences of bounded length in the input. It is discussed how ISL maps are restrictive in their typological predictions, have guaranteed learning results and known methods for generation and recognition, and thus compare favourably to rule-based and constraint-based approaches to these interactions.