Answers are grounded in this paper and cite their sources.
This paper presents a set of mathematical and computational tools for manipulating and rea-soning about regular languages and regular relations and argues that they provide a solid basis for computational phonology. It shows in detail how this framework applies to ordered sets of context-sensitive rewriting rules and also to grammars in Koskenniemi's two-level formalism. This analysis provides a common representation of phonological constraints that supports efficient generation and recognition by a single simple interpreter.
No takes yet. Share an insight, caveat, or question.
Kaplan et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: