Formal and computational verification of phonological analyses
Mans Hulden · Phonology · 2017
This article presents a selection of methods to analyse, compare, verify and formally prove properties about phonological generalisations. Drawing from both well-known and recent results in the domains of model checking and automata theory, a useful methodology for automating the task of comparing analyses and inventing counterexamples is explored. The methods are illustrated by practical case studies that are intended to both resolve concrete issues and be representative of typical techniques and results.