The filtration of the candidates s along a list of constraints, most dominant first: each
constraint in turn keeps the candidates that violate it least. v c k is the number of violations
of the constraint k by the candidate c.
- filtration v s [] = s
- filtration v s (k :: l) = filtration v (s.argmin fun (x : C) => v x k) l
Used by filtration_nil, filtration_cons, filtration_append, mem_filtration, filtration_subset, filtration_append_subset, filtration_nonempty, apply_eq_of_mem_filtration, filtration_cons_of_forall_eq, filtration_eq_singleton_iff, notMem_filtration_of_forall_le, mem_filtration_append_filter, Constraint.eval
Used in Phonology/OptimalityTheory/Evaluation, Phonology/OptimalityTheory/Grammar, Aitha2026, UchiharaMendozaRuiz2021, Vago2017