Docs / Studies / Studies.MartinezParicioKager2015

The Binary-to-Ternary Rhythmic Continuum in Stress Typology: Layered Feet and Non-Intervention Constraints

Martínez-Paricio, V. & Kager, R. (2015). Phonology, 32(3), 459–504

Martínez-Paricio & Kager 2015 derive ternary rhythm from a foot with one layer of recursion: a weak syllable adjoined to a binary foot. A candidate is a metrical tree whose word node dominates maximal feet and unfooted syllables, and every constraint on the distribution of feet is a categorical alignment in the non-intervention format of McCarthy 2003, which a candidate violates at most once for each locus. Over every parsing of an eight-syllable word, the ranking for Cayuvava selects two ternary feet and two unfooted syllables, the ranking for Chugach and Estonian closes the word with a binary foot, and the ranking for Garawa gives binary feet, with one ternary foot in odd parity.

Implementation notes

  • Candidates are Prosody.MetricalTrees with every weight zero, since the systems are quantity-insensitive. A strong syllable is a foot head; a strong foot under a foot is the minimal foot of a layered one, and a strong foot under the word carries primary stress.
  • A layered foot is a foot node over a foot and a syllable, well formed under Prosody.IsFoot, which admits a foot under a foot as Prosody.IsWord admits the recursive word of Itô & Mester 2009.
  • The projections are read as the paper defines them, from a node's mother and daughters: a foot is non-minimal when a daughter of it is a foot, and the feet the word immediately dominates are the maximal ones.
  • gen lists the parsings of a word into unfooted syllables and unary, binary and ternary feet with heads foot-initial and the adjunct on the right, the abstraction over headedness and primary stress under which the paper prints its tableaux. The rankings accordingly leave out the constraints on foot form and on the head foot. A candidate has at least one foot, as the paper's candidates have exactly one head foot; a word without feet violates no constraint on the word.

TODO

  • The paper's count of seven maximal feet under its three restrictions on GEN is not derived; feet lists the seven.
  • The factorial typology over all sixteen constraints, 316 patterns in the paper's computation, is not reproduced.

References

Non-intervention alignment

L71–73
L76–82
L84–90

A non-intervention constraint assigns no more violations than there are loci, whatever the number of separators.

theorem intervened_le_countPL92–98
{α : Type u_1} (locus sep : α → Prop) [DecidablePred locus] [DecidablePred sep] (e : Edge) (l : List α) :
intervened locus sep e l ≤ List.countP (fun (x : α) => decide (locus x)) l

Built from

Foot projections

The constraints

Feet

Words

Optima over every parsing