Hostname: page-component-77c78cf97d-d2fvj Total loading time: 0 Render date: 2026-04-24T15:48:54.441Z Has data issue: false hasContentIssue false

All dissimilation is computationally subsequential

Published online by Cambridge University Press:  01 January 2026

Amanda Payne*
Affiliation:
University of Delaware

Abstract

This article presents a computational analysis of the 185 dissimilation patterns in the typological surveys by Suzuki (1998) and Bennett (2013), and shows that dissimilation is computationally less complex than has been previously shown. Dissimilation patterns are grouped into three general types (basic, blocking, and polarity), each of which can be modeled with a subsequential finite-state transducer. This lends support to the claim that phonological patterns are not only regular, but in fact subsequential, which is a more restrictive class of patterns computationally and provides a stronger bound on the types of processes expected in natural language phonology.

Information

Type
Phonological Analysis
Copyright
Copyright © 2019 Linguistic Society of America

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Supplementary material: File

Payne supplementary material

Payne supplementary material
Download Payne supplementary material(File)
File 306.5 KB