Docs / Phonology / OptimalityTheory / Evaluation

Evaluation under a ranking

import Linglib.Phonology.OptimalityTheory.Evaluation · namespace OptimalityTheory

Under a ranking, a candidate's violations are read in rank order and compared lexicographically: the optimal candidates are those of least profile, the harmonic ordering of forms of Prince & Smolensky 1993. Violations are given by a map v, with v c k the number of violations of the constraint k by the candidate c, and the candidates by a finite set.

One candidate beats another iff some constraint preferring it dominates every constraint preferring the other, ties do not depend on the ranking, and the optimal candidates are the survivors of filtration along the ranking.

References

Declarations

L36–37
L39
L41–42
L46–48
L50
L52–53
L74–80
L96–101
L103–110
L112–115
L117–119
L121–125
L127–136
L138–145
L147–157
L159–162
L164–167
L169–183
L185–217
L224–229
L231–236
L239–256