Types of formalisms in computational phonology

The main formalisms used in computational phonology are:

1. Propositional logic (especially in autosegmental event phonologies).
2. Formal grammars (especially in hierarchical phonologies, such as word syntax).
3. Automata (especially finite state automata in the modelling of spelling and phonemic/allophonic and phonotactic relations, cf. Bird, Carson-Berndsen, Ellison, Gibbon, Karttunen, Kay, Koskenniemi)
4. Attribute-value structures (especially with the unification operation in unification phonologies)
5. Categorial grammars (especially in the categorial phonology of Wheeler)
6. Connectionistic networks (especially in psycholinguistic error studies, and Lakoff's cognitive phonology)