Docs / Phonology / OptimalityTheory / Realization

Realization problems

import Linglib.Phonology.OptimalityTheory.Realization · namespace OptimalityTheory

A realization problem is a constraint system with a target output for each of finitely many inputs: the tableaux of an analysis with their winners. A ranking realizes it when it picks the target on every input. Provided no competitor ties a target, that is to satisfy its ERCs, and a relation on the constraints realizes it iff its grammar lies below the problem's.

References

Declarations

L27–37
L41–45

OT-realization is ERC satisfaction

Provided no competitor ties the target's violation profile, σ realizes the target iff σ satisfies every winner–loser ERC (Prince 2002).

theorem RealizationProblem.realizedByRanking_iff_satisfiedByL65–77
{Input : Type u_1} {Output : Type u_2} {ι : Type u_3} {n : ℕ} {P : RealizationProblem Input Output ι} {σ : Ranking.Enumeration ι n} (hvp : ∀ i ∈ P.inputs, ∀ o ∈ P.gen i, o ≠ P.target i → P.marks i (P.target i) ≠ P.marks i o) :
P.realizedByRanking σ ↔ ∀ α ∈ P.ercs, ERC.SatisfiedBy σ α

Built from , ,

L82–89
L91–93
L100–106

Realization by a partial order

L110–115

A partial order realizes the target iff its grammar lies below the problem's: every one of its linear extensions is a ranking that realizes the target.

theorem RealizationProblem.realizedByPartialOrder_iff_leL117–126
{Input : Type u_1} {Output : Type u_2} {ι : Type u_3} {n : ℕ} [DecidableEq ι] {P : RealizationProblem Input Output ι} {r : ι → ι → Prop} (hvp : ∀ i ∈ P.inputs, ∀ o ∈ P.gen i, o ≠ P.target i → P.marks i (P.target i) ≠ P.marks i o) :

Built from , ,

L128–131
L147–151