Docs / Phonology / Prosody / Domination
Constraints on prosodic domination
import Linglib.Phonology.Prosody.Domination · namespace Prosody
Selkirk 1996 decomposes the Strict Layer Hypothesis into four constraints on which prosodic
category may dominate which. Layeredness forbids a node from dominating a higher level and
Headedness requires every node above the syllable to dominate the next level down; Exhaustivity
forbids a node of a level from immediately dominating a node more than one level down, and
Nonrecursivity forbids it from dominating its own level. Each is a violation count on the
prosodic tree. The three stated of a node and its daughters count such pairs; Headedness, like
the Parse-into-ℓ of Itô & Mester 2003, is an alignment of the positions of the tree under
dominance, each node of one family needing a partner in another below or above it.
Layeredness, counted on mothers and daughters, holds of everything a node dominates, and in a layered tree Nonrecursivity on mothers and daughters is the absence of recursion at any depth. A tree is strictly layered exactly when it violates none of the four, and a tree satisfying Headedness has a node at every level below its root.
The constraints are facts about one map, from the nodes of a structure ordered by dominance to the categories. Layeredness says that the map is antitone, and the Strict Layer Hypothesis that it grades the nodes: a daughter is one category below its mother and a node without daughters is of the lowest. Nothing in that reading asks the nodes to form a tree.
Implementation notes
The constraints are stated for trees over any linearly ordered categories and any marks, the
lowest category in the role of the syllable, so they apply to a tree with or without prominence
and to hierarchies with other categories than those of Level. Exhaustivity and Nonrecursivity
take the level of the dominating node as an argument, as Selkirk 1996 ranks them level by
level; noRec is the unindexed No-Recursion of
Itô & Mester 2009. Headedness reads "dominates" at any depth, so that a prosodic word whose
only foot lies inside a prosodic word it dominates satisfies it.
References
- Selkirk 1996, The Prosodic Structure of Function Words formalized
- Itô & Mester 2003, Japanese Morphophonemics: Markedness and Word Structure
- Itô & Mester 2009, The Extended Prosodic Word formalized
Declarations
- x✝¹.instDecidableRelCovBy x✝ = decidable_of_iff (x✝¹.toNat + 1 = x✝.toNat) ⋯
Counting mothers and daughters
The number of pairs of a node of a tree and a daughter of it whose levels stand in the
relation r.
The definition is too large to print here; read it in the source.
Used by countDaughters_eq_zero_iff, layeredness, nonrecursivity, noRec, exhaustivity
Built from
Layeredness and Nonrecursivity
Layeredness (Selkirk 1996): one violation for each node immediately dominating a node of a higher level.
- layeredness = countDaughters fun (x1 x2 : L) => x1 < x2
Built from
Used by layeredness_eq_zero_iff, noLevelRecursion_iff, noRec_eq_zero_iff_noLevelRecursion, isStrictlyLayered_iff, layeredness_eq_zero_iff_antitone, IsConstituent.layeredness_eq_zero
Nonrecursivity with respect to the level ℓ (Selkirk 1996): one violation for each
ℓ-node that an ℓ-node immediately dominates.
- nonrecursivity ℓ = countDaughters fun (a k : L) => a = ℓ ∧ k = ℓ
Built from
Used by nonrecursivity_eq_zero_iff, noRec_eq_zero_iff, NoLevelRecursion.nonrecursivity_eq_zero, noLevelRecursion_iff, isStrictlyLayered_iff, IsConstituent.level_covBy_of_mem_children
Used in Phonology/Prosody/Phrase, HartmannZimmermann2004, MartinezParicioKager2015, Selkirk1996
No-Recursion (Itô & Mester 2009) counts the pairs of a node and a daughter sharing a level, an element parsed into the same category twice.
- noRec = countDaughters fun (x1 x2 : L) => x1 = x2
Built from
Used by noRec_eq_zero_iff, noRec_eq_zero_iff_noLevelRecursion
Used in Phonology/Prosody/Grid, Phonology/Prosody/Word, ItoMester2009
A node dominates only nodes of its own level or below, at any depth, when no node immediately dominates a higher level.
Built from
Built from
No-Recursion is satisfied exactly when Nonrecursivity is at every level.
Built from ,
Maximal and minimal projections
The projections of a level ℓ (Itô & Mester 2009) are its extremal nodes under dominance.
The maximal ℓ-projections are the ℓ-nodes no ℓ-node dominates, and the minimal ones are
the ℓ-nodes dominating no ℓ-node. Since the root is the least position, these are the Minimal
and Maximal members of the ℓ-positions. That no ℓ-node dominates another at any depth says that
the ℓ-positions form an antichain, and it collapses the two. nonrecursivity ℓ counts only a
daughter, so ω(f(ω)), which recurses through an intervening foot, satisfies it while its
maximal and minimal ω-projections differ; that tree violates Layeredness, and
in a layered tree the two agree. The intonational utterance υ
is the maximal ι-projection.
The category of the node at a position of t.
Used by layeredness_eq_zero_iff_antitone, isStrictlyLayered_iff_covBy, IsStrictlyLayered.strictAnti_levelAt, IsStrictlyLayered.gradeMaxOrder
The positions of t at the level ℓ.
- levelPositions ℓ t = RoseTree.positionsWhere (fun (s : RoseTree (Constituent L M)) => s.value.level = ℓ) t
Used by maximalProjections, minimalProjections, NoLevelRecursion, NoLevelRecursion.subsingleton_inter_Iic, parseInto_eq_zero_iff
The maximal ℓ-projections of t, its topmost ℓ-nodes.
- maximalProjections ℓ t = {p : GornAddress | Minimal (fun (x : GornAddress) => x ∈ levelPositions ℓ t) p}
Built from
The minimal ℓ-projections of t, its bottommost ℓ-nodes.
- minimalProjections ℓ t = {p : GornAddress | Maximal (fun (x : GornAddress) => x ∈ levelPositions ℓ t) p}
Built from
No ℓ-node of t dominates another, at any depth.
- NoLevelRecursion ℓ t = IsAntichain (fun (x1 x2 : GornAddress) => x1 ≤ x2) (levelPositions ℓ t)
Built from
Used by instDecidableNoLevelRecursion, maximalProjections_eq_minimalProjections, NoLevelRecursion.subsingleton_inter_Iic, NoLevelRecursion.nonrecursivity_eq_zero, noLevelRecursion_iff, noRec_eq_zero_iff_noLevelRecursion
Used in Bennett2018
The definition is too large to print here; read it in the source.
Built from
The absence of recursion collapses the projections: where no ℓ-node dominates another,
every ℓ-node is at once topmost and bottommost.
Built from , ,
Where no ℓ-node dominates another, at most one ℓ-node dominates a given position: the
positions dominating it form a chain, which meets an antichain in at most one member. A tree
without recursion therefore stacks no more nodes over a terminal than there are levels.
Built from ,
A tree in which no ℓ-node dominates another satisfies Nonrecursivity at ℓ.
Built from ,
Nonrecursivity is local under Layeredness: in a layered tree, no ℓ-node dominates
another at any depth exactly when none immediately dominates another, since every node between
two ℓ-nodes is itself of level ℓ.
Built from , ,
In a layered tree, No-Recursion is satisfied exactly when no node dominates another of its level at any depth.
Built from , ,
Exhaustivity
Exhaustivity with respect to the level ℓ (Selkirk 1996): one violation for each node
more than one level down that an ℓ-node immediately dominates.
- exhaustivity ℓ = countDaughters fun (a k : L) => a = ℓ ∧ k < a ∧ ¬k ⋖ a
Built from
Used by exhaustivity_eq_zero_iff, isStrictlyLayered_iff, IsConstituent.level_covBy_of_mem_children
Used in Phonology/Prosody/Phrase, Selkirk1996
Built from
Headedness and the Strict Layer Hypothesis
Headedness (Selkirk 1996): one violation for each node above the lowest level that dominates no node of the next level down.
The definition is too large to print here; read it in the source.
Used by headedness_eq_zero_iff, exists_isSubtree_level_eq, isStrictlyLayered_iff
Used in Selkirk1996
Built from
Parse-into-ℓ (Itô & Mester 2003): one violation for each terminal, a node of the lowest
level without daughters, that no ℓ-node dominates.
The definition is too large to print here; read it in the source.
Used by parseInto_eq_zero_iff
Used in Phonology/Prosody/Word, BeckerEtAl2025, ItoMester2009
Built from ,
Headedness fills the hierarchy: a tree satisfying Headedness has a node at every level from its root down, so that an utterance of a single syllable is a syllable, a foot, a word and a phrase at once (Selkirk 1996).
Built from
A tree is strictly layered when every node above the lowest level has daughters and every daughter is of the next level down, the Strict Layer Hypothesis that Selkirk 1996 decomposes.
- IsStrictlyLayered t = RoseTree.Licensed (fun (a : Constituent L M) (ks : List (Constituent L M)) => (a.level ≠ ⊥ → ks ≠ []) ∧ ∀ k ∈ ks, k.level ⋖ a.level) t
Used by instDecidableIsStrictlyLayered, isStrictlyLayered_iff_forall, isStrictlyLayered_iff, isStrictlyLayered_iff_covBy, IsStrictlyLayered.strictAnti_levelAt, IsStrictlyLayered.gradeMaxOrder
Used in Selkirk1996
The definition is too large to print here; read it in the source.
Built from
The Strict Layer Hypothesis is the four constraints together (Selkirk 1996): a tree is strictly layered exactly when it violates none of Layeredness, Headedness, Exhaustivity and Nonrecursivity.
Built from , , , ,
The hierarchy grades dominance
The positions of a tree are ordered by dominance, the root least, and levelAt sends each to
its category. Selkirk's constraints are order-theoretic properties of this map.
Layeredness says the category map is antitone: a position dominated by another is of its category or below.
Built from ,
The Strict Layer Hypothesis says the hierarchy grades dominance: a tree is strictly layered exactly when each daughter is one category below its mother and each position without daughters is of the lowest category.
Built from ,
In a strictly layered tree a dominated position is of a strictly lower category.
Built from ,
The positions of a strictly layered tree are graded by the hierarchy, the root highest and the positions without daughters lowest.
- h.gradeMaxOrder = { grade := fun (p : t.Positions) => OrderDual.toDual (levelAt p), grade_strictMono := ⋯, covBy_grade := ⋯, isMax_grade := ⋯ }
Built from ,
Well-formed constituents
A well-formed constituent satisfies Layeredness.
Built from
The daughters of a constituent that satisfies Exhaustivity and Nonrecursivity at its own level are of the next level down.
Built from ,