Docs / Phonology / OptimalityTheory / Candidate

Candidates

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.

Implementation notes

  • A parse adds to the moraic form only what lies above the syllable: the trees' syllable leaves are marked with the form's syllable names, and the grid lists the stress of each syllable in nucleus order. Words appear both as the form's word tier and as .om nodes of a tree; a study uses one of the two.
  • The input and output strings live in the coindexation, and each parse's melody repeats its side's string; a study's constructor builds the parses over io.string, as Candidate.ofIO does.
  • The mora correspondence is a field of its own, and Candidate.orderMoraCorr pairs the morae in order, for candidates printed without one.
  • Segmental faithfulness is read off io by the Coindexation counters; this file adds only the counters that need a parse or the mora correspondence.

TODO

  • With morae corresponding in order, MAX-μ is the surplus of input morae over output morae and DEP-μ the surplus of output morae; neither is proved.

References

Declarations

L66–74
L86–88
L90–91
L96–99
L116–117
L121–131
L137–146
L154–158
L160–161
L163
L165
L167
L169

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.

def OptimalityTheory.Candidate.identViolL171–175
{α : Type u_1} (c : Candidate α) {β : Type u_2} [DecidableEq β] (g : Parse α → ℕ → Option β) :
ℕ
  • c.identViol g = List.countP (fun (p : ℕ × ℕ) => decide (∃ a ∈ g c.input p.1, ∃ b ∈ g c.output p.2, a ≠ b)) c.pairs

Built from , ,

Used by OptimalityTheory.Candidate.identViol_eq_zero

L177–184
L204