A realization problem is a constraint system with a target output for each of finitely many inputs, which a single grammar must select on every input at once. For OT it is the data of Tesar & Smolensky 1995's ranking problem.
- gen : Input → Finset Output
- marks : Input → Output → ι → ℕ
- inputs : Finset Input
The grammar handles a finite set of inputs.
- target : Input → Output
The grammar must select the target output on each input.
Each target output is a candidate of its input.
Used by RealizationProblem.realizedByRanking, RealizationProblem.instDecidableRealizedByRankingOfDecidableEq, RealizationProblem.ercs, RealizationProblem.mem_ercs, RealizationProblem.realizedByRanking_iff_satisfiedBy, RealizationProblem.grammar, RealizationProblem.mem_extent_grammar, RealizationProblem.IsOTRealizable, RealizationProblem.instDecidableIsOTRealizableOfDecidableEq, RealizationProblem.isOTRealizable_iff_extent_nonempty, RealizationProblem.realizedByPartialOrder, RealizationProblem.realizedByPartialOrder_iff_le, RealizationProblem.IsPartialOrderRealizable, RealizationProblem.IsPartialOrderRealizable.isOTRealizable, RealizationProblem.IsOTRealizable.isPartialOrderRealizable, RealizationProblem.isOTRealizable_iff_isPartialOrderRealizable
Used in Phonology/HarmonicGrammar/Expressivity, CoetzeePater2011