Paper

Decomposing phonological transformations in serial derivations

---

Abstract

While most phonological transformations have been shown to be subsequential, there are tonal processes that do not belong to any subregular class, thereby making it difficult to identify a tighter bound on the complexity of phonological processes than the regular languages. This paper argues that a tighter bound obtains from examining the way transformations are computed: when derived in serial, phonological processes can be decomposed into iterated subsequential maps.

Keywords: Phonology, serial derivations, parallel derivations, tone, finite state transducers, Serial Subsequential Hypothesis

How to Cite:

Lamont, A., (2018) “Decomposing phonological transformations in serial derivations”, Society for Computation in Linguistics 1(1), 91-101. doi: https://doi.org/10.7275/R55X273D