Skip to main content
    • Aa
    • Aa

Formal and computational verification of phonological analyses*

  • Mans Hulden (a1)

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.

Corresponding author
Hide All

Thanks to Dale Gerdemann, Mike Hammond and Lauri Karttunen for useful insights and discussion around various versions of this work. Thanks also to the editors and anonymous reviewers for many helpful comments and pointers. All errors are my own.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

  • ISSN: 0952-6757
  • EISSN: 1469-8188
  • URL: /core/journals/phonology
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
Type Description Title
Supplementary Materials

Hulden supplementary material
Hulden supplementary material 1

 PDF (29 KB)
29 KB
Supplementary Materials

Hulden supplementary material
Hulden supplementary material 2

 Unknown (8 KB)
8 KB


Full text views

Total number of HTML views: 5
Total number of PDF views: 43 *
Loading metrics...

Abstract views

Total abstract views: 105 *
Loading metrics...

* Views captured on Cambridge Core between 14th August 2017 - 26th September 2017. This data will be updated every 24 hours.