Next: Formal Grammars
The main formalisms used in computational phonology are:
- Propositional logic (especially in autosegmental event phonologies).
- Formal grammars (especially in hierarchical phonologies, such as word syntax).
- 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)
- Attribute-value structures (especially with the unification operation in unification phonologies)
- Categorial grammars (especially in the categorial phonology of Wheeler)
- Connectionistic networks (especially in psycholinguistic error studies, and Lakoff's cognitive phonology)
Fri Nov 28 02:24:58 MET 1997