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.

A Computational Account of Tone Sandhi Interaction

“…Though the empirical scope of this paper's analysis is small (three sandhi rules in a single language), the results of that analysis contribute to a larger catalogue of the computational classifications of various types of process interaction. It was shown in Chandlee et al (2018) that cases of various types of opaque interactions are all ISL (both the individual maps and the combined maps). The case of Tianjin offers another way rules can interact and, unlike the cases of opacity reviewed previously, we see that interaction indeed does increase complexity.…”

Unbounded circumambient patterns in segmental phonology

“…In formalisms that use cyclic rule application or level-ordering, derivational stages of input–output maps are given formal interpretations and theoretical significance. In contrast, no formal status is given to the non-surface outputs of intermediate transductions in current work exploring the subregular hierarchy (Chandlee & Heinz 2018, Chandlee et al 2018). In this way, the formal language theory adopted here is similar to Optimality Theory, where the analytical focus is on properties of holistic input–output maps, regardless of whether they are characterised as multiple independent processes in other formalisms; here, too, only properties of the total input–output mapping are relevant to a pattern's complexity.…”

Proceedings of the 19th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology

“…If one further limits the state space of a sequential transducer so that it consists of all and only those states that record the previous k symbols in the input string, one obtains an input strictly k-local (ISL-k) transducer. As pointed out in Chandlee et al (2018), a transduction is guaranteed to be ISL-k if it can be described by a finite set of rewrite rules of the form a → b | u v such that a, b ∈ Σ, u, v ∈ Σ * , and the combined length of u and v is at most k − 1. Crucially, the output of one rewrite rule cannot serve as the input for another rewrite rule.…”

“…Within computational and mathematical phonology, there is ample work on formalizing segmental and suprasegmental phonological processes that are word-bounded, such as by using finite state acceptors (FSAs) and transducers (FSTs) (Kaplan and Kay, 1994;Roche and Schabes, 1997;Hulden, 2009;Chandlee, 2014;Heinz, 2018), or using equivalent logical transductions (Potts and Pullum, 2002;Jardine, 2016;Strother-Garcia, 2019;Dolatian, 2020;Dolatian et al, 2021b). Until recently however, there was little work on the computational machinery required by sentence-level or phrase-level phonology (prosodic phonology).…”