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.

pdf

Additional Information

ISSN
1535-0665
Print ISSN
0097-8507
Pages
pp. e353-e371
Launched on MUSE
2017-12-21
Open Access
No
Back To Top

This website uses cookies to ensure you get the best experience on our website. Without cookies your experience may not be seamless.