Search for: All records

Some phonologically significant generalizations result from processes, often formalized as rewrite rules, while others result from interactions among independently motivated processes, often formalized in terms of serial ordering. We adopt these general formalizations of processes and interactions to address two questions. One is the interaction question: what are all the possible forms of interaction between two processes? The other is the opacity question: what makes an interactions between two processes opaque? We show that these questions are best addressed with a rigorous algebraic formalization of processes and their pairwise interactions, describing the complete formal typology of process interactions and identifying the formal properties of those interactions that lead to different types of opacity. 

Recent work has claimed that (non-tonal) phonological patterns are subregular (Heinz 2011a,b, 2018; Heinz and Idsardi 2013), occupying a delimited proper subregion of the regular functions—the weakly deterministic (WD) functions (Heinz and Lai 2013; Jardine 2016). Whether or not it is correct (McCollum et al. 2020a), this claim can only be properly assessed given a complete and accurate definition of WD functions. We propose such a definition in this article, patching unintended holes in Heinz and Lai’s (2013) original definition that we argue have led to the incorrect classification of some phonological patterns as WD. We start from the observation that WD patterns share a property that we call unbounded semiambience, modeled after the analogous observation by Jardine (2016) about non-deterministic (ND) patterns and their unbounded circumambience. Both ND and WD functions can be broken down into compositions of deterministic (subsequential) functions (Elgot and Mezei 1965; Heinz and Lai 2013) that read an input string from opposite directions; we show that WD functions are those for which these deterministic composands do not interact in a way that is familiar from the theoretical phonology literature. To underscore how this concept of interaction neatly separates the WD class of functions from the strictly more expressive ND class, we provide analyses of the vowel harmony patterns of two Eastern Nilotic languages, Maasai and Turkana, using bimachines, an automaton type that represents unbounded bidirectional dependencies explicitly. These analyses make clear that there is interaction between deterministic composands when (and only when) the output of a given input element of a string is simultaneously dependent on information from both the left and the right: ND functions are those that involve interaction, while WD functions are those that do not. 

This work is about two ‘generation problems’ for classic Optimality Theory, chain shifts and saltations. The issues for OT posed by traditional analyses of chain shifts and saltations have led to various embellishments of the classic theory, typically in the form of novel constraint types. Reiss (2021a,b) proposes a general solution to the problem of chain shifts and saltations that relies more directly on different assumptions about representations than about constraints. Specifically, Reiss assumes that underlying representations may be underspecified, and that a map ‘counts’ as a chain shift or as a saltation so long as the surface alternants from a uniform underlying representation match the respective observed alternants. We report here on three results from our ongoing formal assessment of Reiss’s proposed solution.