# Computing Optimal Forms in Optimality Theory : Basic Syllabification

@inproceedings{Tesar1995ComputingOF, title={Computing Optimal Forms in Optimality Theory : Basic Syllabification}, author={Bruce Tesar}, year={1995} }

- Published 1995

In Optimality Theory, grammaticality is defined in terms of optimization over a large (often infinite) space of candidates. This raises the question of how grammatical forms might be computed. This paper presents an analysis of the Basic CV Syllable Theory (Prince & Smolensky 1993) showing that, despite the nature of the formal definition, computing the optimal form does not require explicitly generating and evaluating all possible candidates. A specific algorithm is detailed which computes the… CONTINUE READING