The morae of a form in order of their heads, and by index under one head.
The definition is too large to print here; read it in the source.
Docs / Phonology / OptimalityTheory / Candidate
import Linglib.Phonology.OptimalityTheory.Candidate
A candidate pairs an input with an output, each a parse: a moraic form over its own string
(Hayes 1989), prosodic structure above the syllable as trees whose syllable leaves name the
form's syllables, and a metrical grid giving each syllable its stress. The two strings correspond
by a Coindexation, and the morae correspond independently of their segments
(Broselow et al. 1997). The input is parsed like the output, so faithfulness compares
prosody with prosody: identity of corresponding slots under any reading of a parse is the one
counter Candidate.identViol, read at the morae of a
slot for length, and
MAX-μ and
DEP-μ count the morae left without correspondents.
.om nodes of a tree; a study
uses one of the two.io.string, as
Candidate.ofIO does.Candidate.orderMoraCorr pairs the morae
in order, for candidates printed without one.io by the Coindexation counters; this file adds only
the counters that need a parse or the mora correspondence.The morae of a form in order of their heads, and by index under one head.
The definition is too large to print here; read it in the source.
A parse: a moraic form, prosodic structure above the syllable as trees whose syllable leaves name the form's syllables, and a metrical grid over the syllables in nucleus order.
The moraic form, up to the syllable.
The prosodic structure above the syllable.
The stress of each syllable, in nucleus order.
Used by OptimalityTheory.Parse.syllableList, OptimalityTheory.Parse.stress, OptimalityTheory.Parse.stressAt, OptimalityTheory.Parse.weightAt, OptimalityTheory.Parse.feet, OptimalityTheory.Parse.ftBinViol, OptimalityTheory.Parse.onsetViol, OptimalityTheory.Parse.onsetViol_eq_zero_iff, OptimalityTheory.Parse.noSharedMoraViol, OptimalityTheory.Parse.noSharedMoraViol_eq_zero_iff, OptimalityTheory.Parse.complexCodaViol, OptimalityTheory.Candidate, OptimalityTheory.Candidate.identViol, OptimalityTheory.Candidate.identViol_eq_zero
Used in Aitha2026
The syllables in nucleus order.
Built from
Used by OptimalityTheory.Parse.stress
The stress of the syllable named s, its column of the grid.
Built from ,
Used by OptimalityTheory.Parse.stressAt
The feet of the structure above the syllable, each the names of its syllables.
Built from
Used by OptimalityTheory.Parse.ftBinViol
Used in Aitha2026
FT-BIN(μ), minimal binarity: a violation for each foot whose syllables carry fewer than two morae together, a degenerate foot. A foot of more than two morae is the business of a separate constraint on maximal binarity.
Built from ,
ONSET: a violation for each syllable without an onset.
Built from
Used by OptimalityTheory.Parse.onsetViol_eq_zero_iff
Used in VasquezAguilarEtAl2026
NOSHAREDMORA (Broselow et al. 1997): a violation for each mora linked to more than one segment.
Built from
An input–output candidate: the correspondence of the two strings, a parse of each, and an independent correspondence of their morae.
The input–output correspondence of the segments.
The parse of the input.
The parse of the output.
The correspondence of the morae, independent of their segments.
Built from
Used by OptimalityTheory.Candidate.ofIO, OptimalityTheory.Candidate.pairs, OptimalityTheory.Candidate.orderMoraCorr, OptimalityTheory.Candidate.withOrderMoraCorr, OptimalityTheory.Candidate.withOrderMoraCorr_io, OptimalityTheory.Candidate.withOrderMoraCorr_input, OptimalityTheory.Candidate.withOrderMoraCorr_output, OptimalityTheory.Candidate.withOrderMoraCorr_moraCorr, OptimalityTheory.Candidate.identViol, OptimalityTheory.Candidate.identViol_eq_zero, OptimalityTheory.Candidate.maxMoraViol, OptimalityTheory.Candidate.depMoraViol, OptimalityTheory.Candidate.maxMoraViol_eq_zero_iff, OptimalityTheory.Candidate.depMoraViol_eq_zero_iff, OptimalityTheory.Candidate.maxMoraViol_le, OptimalityTheory.Candidate.depMoraViol_le
Used in Aitha2026, BroselowChenHuffman1997, VasquezAguilarEtAl2026
The candidate of a correspondence whose input is the bare input string and whose output form, over the output string, has the given lines.
The definition is too large to print here; read it in the source.
Built from
The corresponding slot pairs: an input position and an output position that share an index of the coindexation.
The definition is too large to print here; read it in the source.
Built from
Used by OptimalityTheory.Candidate.identViol, OptimalityTheory.Candidate.identViol_eq_zero
The correspondence of morae in order: the k-th mora of the input, by head and then by
index, with the k-th mora of the output. A mora survives a change of head, as in compensatory
lengthening, and the surplus of either side has no correspondent.
Built from ,
Used by OptimalityTheory.Candidate.withOrderMoraCorr, OptimalityTheory.Candidate.withOrderMoraCorr_moraCorr
The candidate with its morae corresponding in order.
Built from ,
Used by OptimalityTheory.Candidate.withOrderMoraCorr_io, OptimalityTheory.Candidate.withOrderMoraCorr_input, OptimalityTheory.Candidate.withOrderMoraCorr_output, OptimalityTheory.Candidate.withOrderMoraCorr_moraCorr
Built from ,
Built from ,
Built from ,
Built from , ,
IDENT under a reading g of a parse at a slot: a violation for each corresponding pair
whose readings are both specified and differ. Reading a feature of the melody is
McCarthy & Prince 1995's IDENT(F), and reading Parse.weightAt is identity of length.
Built from , ,
MAX-μ: a violation for each mora of the input without a correspondent.
Built from
Used by OptimalityTheory.Candidate.maxMoraViol_eq_zero_iff, OptimalityTheory.Candidate.maxMoraViol_le
DEP-μ: a violation for each mora of the output without a correspondent.
Built from
Used by OptimalityTheory.Candidate.depMoraViol_eq_zero_iff, OptimalityTheory.Candidate.depMoraViol_le