Docs / Phonology / OptimalityTheory / ViolationProfile

Violation profiles

import Linglib.Phonology.OptimalityTheory.ViolationProfile · namespace OptimalityTheory

The violations of a candidate under constraints in rank order form its violation profile, and profiles are compared lexicographically: strict domination is mathlib's lexicographic order on Fin n → ℕ, position 0 the most dominant constraint. A profile along a list of constraints is ViolationProfile.ofList, and the harmony order it induces on candidates is the order bidirectional optimality theory evaluates over, well-founded on any candidate set.

References

Declarations

The violation profile of a candidate under a list of constraints in rank order.

def ViolationProfile.ofListL44–45
{C : Type u_1} (ranking : List (Constraint C)) :
C → ViolationProfile ranking.length

Built from ,

Used by ViolationProfile.ofList_cons_lt_iff, ViolationProfile.not_ofList_nil_lt, ViolationProfile.minimalFor_ofList_nil, ViolationProfile.minimalFor_ofList_cons, ViolationProfile.strictMono_ofList

Used in Phonology/OptimalityTheory/Evaluation, Blutner2000, DeHoopMalchukov2008, Jaeger2002, Krifka2007 and 1 more

L47–50
L52–64
L71
L73–74
L76–78
L80–88