Middleton (2026): A Remark on the Ordering of Impoverishment Rules: Differences between Taos and Basque #
Arregi and Nevins divide the postsyntax into modules, impoverishment before metathesis and, within
impoverishment, the paradigmatic rules, conditioned by the node they change, before the
syntagmatic ones. Middleton tests both orders on the verbal agreement prefixes of Taos
(Kiowa-Tanoan). Impoverishment feeds metathesis in Taos as in Basque; but in four Taos
interactions a paradigmatic rule would bleed a syntagmatic one the attested forms need, while in a
fifth they need the bleeding, so the two kinds of impoverishment interleave. The file transcribes
the online appendix's analysis, its rules of impoverishment, metathesis, exponence, epenthesis
and tone, and derives from it the paradigm of Fragments/Taos/Agreement.lean.
Main results #
derive_eq_form: the appendix's rules derive every cell of the paradigm but the nine it leaves open (unaccounted).must_interleave: the orders cases 1 and 5 need respect neither block architecture, each case resting on one bleeding fact (r40_bleeds_r34ator26_bleeds_r29).mopen_tiers: the rules of exponence read their leftmost brackets on the tiers of[±participant]and of number; read on the present arguments alone, they lose the exponents of mopén.r24_feeds_m23,Basque.ondarru_feeds,Basque.zamudio_bleeds: impoverishment feeds metathesis in Taos, and Participant Dissimilation feeds or bleeds Ergative Metathesis in Basque.
Implementation notes #
- Inverse number is the one feature
Feat.inverse, whichArg.Hasreads as containing the dual's values (Taos.dual_le_inverse); the category labels s, d, p, i are exact tests on the number features (Arg.IsSingularand kin). - The paper labels its (35) and (43), the appendix's (40) and (26), paradigmatic, though as
printed each carries a condition on another slot:
r40andr26follow the labels,r40'andr26'the printed rules, and both sets derive the paradigm (derive_eq_form_printed). - Three orderings are this study's repairs of the appendix's sets, forced by cells its listing
would not derive: (32) after (7), (44) after (43), and (44)'s context widened (see
r32,r44). - Exponence is the appendix's rules as
ExponenceRules, each bracket read in the adjacent window of a tier (onTiers), the present arguments keeping an agent impoverishment has left only[+author], as the appendix's trace reading has it; a third person object's number is null (objectNumberNull). The portmanteaux, epenthesis and tone carry the additions the appendix's prose uses but never states (seeexponence).
TODO #
- The nine cells in
unaccounted, with what the pipeline gives them inderive_unaccounted: ∅:2s:∅ and 1:2s:∅ (o; the appendix says it will return to them and does not, and the rules give kǫ), 3i:3p (printed toneless; footnote 5 calls that a typo for high, but (50c) gives a closed final syllable falling, îw), 3i:refl (printed ímó; the rules give footnote 6's corrected ímo), and the three 3d possessives with an object (Table 3 prints ónôm and ónôw, but the tone rule (51h) and the appendix's Tables 8, 14, 17 and 38 have ónóm and ónów, which the rules give). - The paper's (13) is an adjacent swap; the study follows Arregi and Nevins's fronting rule, which the Zamudio auxiliary of (19) needs, and its rejected-order outputs are Arregi and Nevins's stranded forms rather than the paper's starred (17b) and (19b).
References #
- J. Middleton, A remark on the ordering of impoverishment rules: differences between Taos and Basque
- K. Arregi and A. Nevins, Morphotactics
- D. Harbour, Paucity, abundance, and the theory of number
- D. Harbour, Impossible persons
- B. Moskal and P. W. Smith, Towards a theory without adjacency: hyper-contextual VI-rules
Features and arguments #
The paper's (2) and (3): Taos distinguishes three persons and three numbers, and inverse agreement is the paper's (8), one feature here. The dummy object no and the reflexive are the two objects without person.
Equations
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.participant a) (Middleton2026.Feat.participant b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.participant b) (Middleton2026.Feat.author b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.participant b) (Middleton2026.Feat.atomic b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.participant b) (Middleton2026.Feat.minimal b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.participant b) Middleton2026.Feat.inverse = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.participant b) Middleton2026.Feat.dummy = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.participant b) Middleton2026.Feat.refl = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.author b) (Middleton2026.Feat.participant b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.author a) (Middleton2026.Feat.author b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.author b) (Middleton2026.Feat.atomic b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.author b) (Middleton2026.Feat.minimal b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.author b) Middleton2026.Feat.inverse = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.author b) Middleton2026.Feat.dummy = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.author b) Middleton2026.Feat.refl = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.atomic b) (Middleton2026.Feat.participant b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.atomic b) (Middleton2026.Feat.author b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.atomic a) (Middleton2026.Feat.atomic b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.atomic b) (Middleton2026.Feat.minimal b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.atomic b) Middleton2026.Feat.inverse = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.atomic b) Middleton2026.Feat.dummy = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.atomic b) Middleton2026.Feat.refl = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.minimal b) (Middleton2026.Feat.participant b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.minimal b) (Middleton2026.Feat.author b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.minimal b) (Middleton2026.Feat.atomic b_1) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.minimal a) (Middleton2026.Feat.minimal b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.minimal b) Middleton2026.Feat.inverse = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.minimal b) Middleton2026.Feat.dummy = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq (Middleton2026.Feat.minimal b) Middleton2026.Feat.refl = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.inverse (Middleton2026.Feat.participant b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.inverse (Middleton2026.Feat.author b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.inverse (Middleton2026.Feat.atomic b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.inverse (Middleton2026.Feat.minimal b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.inverse Middleton2026.Feat.inverse = isTrue ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.inverse Middleton2026.Feat.dummy = isFalse Middleton2026.instDecidableEqFeat.decEq._proof_35
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.inverse Middleton2026.Feat.refl = isFalse Middleton2026.instDecidableEqFeat.decEq._proof_36
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.dummy (Middleton2026.Feat.participant b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.dummy (Middleton2026.Feat.author b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.dummy (Middleton2026.Feat.atomic b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.dummy (Middleton2026.Feat.minimal b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.dummy Middleton2026.Feat.inverse = isFalse Middleton2026.instDecidableEqFeat.decEq._proof_41
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.dummy Middleton2026.Feat.dummy = isTrue ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.dummy Middleton2026.Feat.refl = isFalse Middleton2026.instDecidableEqFeat.decEq._proof_42
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.refl (Middleton2026.Feat.participant b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.refl (Middleton2026.Feat.author b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.refl (Middleton2026.Feat.atomic b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.refl (Middleton2026.Feat.minimal b) = isFalse ⋯
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.refl Middleton2026.Feat.inverse = isFalse Middleton2026.instDecidableEqFeat.decEq._proof_47
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.refl Middleton2026.Feat.dummy = isFalse Middleton2026.instDecidableEqFeat.decEq._proof_48
- Middleton2026.instDecidableEqFeat.decEq Middleton2026.Feat.refl Middleton2026.Feat.refl = isTrue ⋯
Instances For
Equations
- One or more equations did not get rendered due to their size.
- Middleton2026.instReprFeat.repr Middleton2026.Feat.inverse prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Middleton2026.Feat.inverse")).group prec✝
- Middleton2026.instReprFeat.repr Middleton2026.Feat.dummy prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Middleton2026.Feat.dummy")).group prec✝
- Middleton2026.instReprFeat.repr Middleton2026.Feat.refl prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Middleton2026.Feat.refl")).group prec✝
Instances For
Equations
- Middleton2026.instReprFeat = { reprPrec := Middleton2026.instReprFeat.repr }
The person features are [±participant] and [±author].
Equations
- (Middleton2026.Feat.participant b).IsPerson = True
- (Middleton2026.Feat.author b).IsPerson = True
- x✝.IsPerson = False
Instances For
The number features are [±atomic], [±minimal] and inverse.
Equations
- (Middleton2026.Feat.atomic b).IsNumber = True
- (Middleton2026.Feat.minimal b).IsNumber = True
- Middleton2026.Feat.inverse.IsNumber = True
- x✝.IsNumber = False
Instances For
Equations
- One or more equations did not get rendered due to their size.
Equations
- One or more equations did not get rendered due to their size.
The position of a feature within its argument after Linearization, the paper's (4) and
(5): [±participant] [±author] [±atomic] [±minimal].
Equations
Instances For
An argument is given by its features.
Equations
Instances For
A person bears Harbour's bivalent features (3), [+F] for each feature of its bundle and
[−F] for the others.
Equations
- Middleton2026.personFeats p = [Middleton2026.Feat.participant (decide (Person.Feature.participant ∈ p.toFeatures)), Middleton2026.Feat.author (decide (Person.Feature.author ∈ p.toFeatures))]
Instances For
A valuation bears Harbour's number features (2), each with the values it has received.
Equations
- One or more equations did not get rendered due to their size.
Instances For
An agreement category bears the features of its natural number's valuation; the inverse bears
the one feature Feat.inverse (see the implementation notes).
Equations
- Middleton2026.numberFeats Number.Inverse.Category.singular = Middleton2026.valuationFeats (Number.Inverse.Valuation.ofNumber Number.singular)
- Middleton2026.numberFeats Number.Inverse.Category.dual = Middleton2026.valuationFeats (Number.Inverse.Valuation.ofNumber Number.dual)
- Middleton2026.numberFeats Number.Inverse.Category.plural = Middleton2026.valuationFeats (Number.Inverse.Valuation.ofNumber Number.plural)
- Middleton2026.numberFeats Number.Inverse.Category.inverse = [Middleton2026.Feat.inverse]
Instances For
Instances For
Instances For
Instances For
Instances For
Instances For
Instances For
Instances For
a has f, an inverse valuation containing the dual's values (Taos.dual_le_inverse).
Equations
- a.Has f = (f ∈ a ∨ Middleton2026.Feat.inverse ∈ a ∧ f ∈ Middleton2026.dual)
Instances For
Equations
- a.instDecidablePredFeatHas x✝ = { decide := decide (x✝ ∈ a) || decide (Middleton2026.Feat.inverse ∈ a ∧ x✝ ∈ Middleton2026.dual), reflects_decide := ⋯ }
Equations
The number features.
Equations
- a.number = List.filter (fun (x : Middleton2026.Feat) => decide x.IsNumber) a
Instances For
Second person.
Equations
Instances For
Singular, its [+minimal] possibly already deleted.
Equations
- a.IsAtomicSingular = (Middleton2026.Feat.atomic true ∈ a ∧ Middleton2026.Feat.inverse ∉ a)
Instances For
Has a [±participant] feature.
Equations
- a.HasParticipant = ∃ (b : Bool), Middleton2026.Feat.participant b ∈ a
Instances For
Equations
Equations
- x✝.instDecidablePredIsInverse = { decide := decide (List.elem Middleton2026.Feat.inverse x✝ = true), reflects_decide := ⋯ }
Equations
- x✝.instDecidablePredIsAtomicSingular = { decide := decide (Middleton2026.Feat.atomic true ∈ x✝) && decide (Middleton2026.Feat.inverse ∉ x✝), reflects_decide := ⋯ }
Equations
- One or more equations did not get rendered due to their size.
Delete the features of fs.
Equations
- a.delete fs = List.filter (fun (x : Middleton2026.Feat) => decide (x ∉ fs)) a
Instances For
The agreement prefix #
The prefix of the paper's (1) agrees with the agent, the goal and the object, linearized in that order.
Equations
- Middleton2026.instDecidableEqSlot x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- Middleton2026.instReprSlot.repr Middleton2026.Slot.agent prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Middleton2026.Slot.agent")).group prec✝
- Middleton2026.instReprSlot.repr Middleton2026.Slot.goal prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Middleton2026.Slot.goal")).group prec✝
- Middleton2026.instReprSlot.repr Middleton2026.Slot.object prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Middleton2026.Slot.object")).group prec✝
Instances For
Equations
- Middleton2026.instReprSlot = { reprPrec := Middleton2026.instReprSlot.repr }
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Middleton2026.instReprPrefix = { reprPrec := Middleton2026.instReprPrefix.repr }
The argument in a slot.
Equations
- p.get Middleton2026.Slot.agent = p.agent
- p.get Middleton2026.Slot.goal = p.goal
- p.get Middleton2026.Slot.object = p.object
Instances For
Replace the argument in a slot.
Equations
Instances For
The neighborhood of a slot has its argument in focus and the other two as context, in the order of (1).
Equations
Instances For
The prefix a slot's neighborhood came from.
Equations
- Middleton2026.Prefix.ofAround Middleton2026.Slot.agent x✝ = { agent := x✝.focus, goal := x✝.rightCtx.getD 0 [], object := x✝.rightCtx.getD 1 [] }
- Middleton2026.Prefix.ofAround Middleton2026.Slot.goal x✝ = { agent := x✝.leftCtx.getD 0 [], goal := x✝.focus, object := x✝.rightCtx.getD 0 [] }
- Middleton2026.Prefix.ofAround Middleton2026.Slot.object x✝ = { agent := x✝.leftCtx.getD 1 [], goal := x✝.leftCtx.getD 0 [], object := x✝.focus }
Instances For
The leftmost number bundle is the first slot with a number feature.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The features of the leftmost number bundle.
Equations
- p.leftmostNumberArg = (Option.map p.get p.leftmostNumber).getD []
Instances For
The leftmost person bundle is the first slot with a [±participant] feature.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The leftmost exponed person is second.
Equations
- p.LeftmostSecond = ∃ s ∈ p.leftmostPerson, (p.get s).IsSecond
Instances For
The second argument is the goal, or the object of a prefix without a goal.
Equations
- p.secondArg = if p.goal ≠ [] then Middleton2026.Slot.goal else Middleton2026.Slot.object
Instances For
The present arguments.
Equations
- p.args = List.filter (fun (x : Middleton2026.Arg) => decide (x ≠ [])) [p.agent, p.goal, p.object]
Instances For
Rules of impoverishment #
A rule is the appendix's X → E / context: the slot whose argument changes, and an
ImpoverishmentRule at that slot's neighborhood whose target is the structural change. Rules the
appendix writes with an agent bracket followed by an object bracket apply only without a goal;
the appendix's prose orders (33) before (32), (5) before (7), and (45) before (40).
Apply a change to an argument.
Equations
- (Middleton2026.Change.delete fs).apply x✝ = x✝.delete fs
- Middleton2026.Change.deleteNumber.apply x✝ = List.filter (fun (x : Middleton2026.Feat) => decide ¬x.IsNumber) x✝
- Middleton2026.Change.deletePerson.apply x✝ = List.filter (fun (x : Middleton2026.Feat) => decide ¬x.IsPerson) x✝
- Middleton2026.Change.obliterate.apply x✝ = []
Instances For
A rule of impoverishment over the prefix.
- slot : Slot
The slot whose argument the rule changes.
The rule at that slot's neighborhood.
Instances For
A rule conditioned by its own slot's argument.
Equations
- Middleton2026.Rule.paradigmatic s check c = { slot := s, rule := DistributedMorphology.ImpoverishmentRule.ofFocus check c }
Instances For
Apply the rule to the prefix.
Equations
- r.apply p = p.set r.slot (DistributedMorphology.ImpoverishmentRule.apply (fun (a : Middleton2026.Arg) (c : Middleton2026.Change) => c.apply a) r.rule (p.around r.slot))
Instances For
Equations
The rule is paradigmatic when its condition factors through its own slot.
Equations
- r.Paradigmatic = r.rule.Paradigmatic
Instances For
The rule is syntagmatic when its condition reads another slot.
Equations
- r.Syntagmatic = r.rule.Syntagmatic
Instances For
Apply a sequence of rules in order.
Equations
- Middleton2026.run rs p = List.foldl (fun (p : Middleton2026.Prefix) (r : Middleton2026.Rule) => r.apply p) p rs
Instances For
The block architecture #
Arregi and Nevins's (72), Exponence Conversion > Paradigmatic > Syntagmatic: the
paradigmatic rules form a block before the syntagmatic ones.
A rule sequence respects the block architecture when no syntagmatic rule precedes a paradigmatic one.
Equations
- Middleton2026.ParaThenSyn rs = List.Pairwise (fun (r r' : Middleton2026.Rule) => r'.Paradigmatic → r.Paradigmatic) rs
Instances For
A rule sequence respects the reverse architecture when no paradigmatic rule precedes a syntagmatic one.
Equations
- Middleton2026.SynThenPara rs = List.Pairwise (fun (r r' : Middleton2026.Rule) => r'.Syntagmatic → r.Syntagmatic) rs
Instances For
A paradigmatic block followed by a syntagmatic block respects the architecture.
A paradigmatic and a syntagmatic rule have exactly one order that respects the architecture.
Under the block architecture, a paradigmatic and a syntagmatic rule apply in that order.
The Taos rules #
The appendix's rules of impoverishment, by its numbering; the paper's numbers are in the docstrings.
By rule (1), the goal loses its number after an inverse agent, with an object.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (4), a first person agent loses its number before a second person goal.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By the optional rule (5), a second person agent loses its number before a first dual or inverse goal with no object; the prefix is then the portmanteau ku.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (9), a first singular possessive goal loses [+participant].
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (12), a first person agent loses [+participant] before a second dual or inverse goal.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (24), the paper's (27), a [−author] goal loses [−participant] after a dual agent.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (33), the paper's (41), a [−author] goal loses its singular features between a dual
agent and a third singular object.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (34a), the paper's (32a), a singular object loses its person after an agent.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (34b), the paper's (32b), an inverse [−author] object loses [−participant] after an
agent.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (14), a first dual or inverse agent loses its person before no object, or a singular, dummy or inverse one.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (35), a singular object loses its person after a first inverse possessive goal.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (46), the paper's (37), a first or second singular agent loses [+minimal] before a
singular or dummy object.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (2), the agent loses its number before a third dual or inverse goal, with an object;
"3" is read as [−author], since (24) may already have removed the goal's [−participant].
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (7), on the agent, a second person agent with number and a first person goal both lose their number; the optional (5) bleeds it, leaving the goal's number for ku.
Equations
- One or more equations did not get rendered due to their size.
Instances For
(7), on the goal, before the agent's half so that the agent's number is still there to condition it.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (32), the paper's (40), a singular object loses its person after a singular goal. It runs after (7), not in the appendix's first set, or 2:1s:3s môm comes out mǫ́.
Equations
Instances For
By rule (15), a first person agent is obliterated before a second singular goal.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By the paradigmatic rule (26), the paper's (43), a first person [+minimal] goal loses
[+atomic].
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (45a), the paper's (36b), the object loses its singular features after a [+atomic]
agent.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (45b), the paper's (36a), the dummy object is obliterated after a [+atomic] agent.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By the paradigmatic rule (40), the paper's (35), a third singular agent is obliterated.
Equations
Instances For
Rule (40) as the appendix prints it, [[A __](O)], applies with no goal.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Rule (26) as the appendix prints it, [[G 1 __ +minimal], applies with no agent.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (47), an inverse object loses [−author] after a singular agent.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (3), a first person agent loses [+participant] before a third person goal and an
object when the leftmost number is dual or inverse; "3" is read as [−author], as in (2).
Equations
- One or more equations did not get rendered due to their size.
Instances For
By the paradigmatic rule (11a), the paper's (39), a second singular agent loses
[+participant].
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (11b), a second singular possessive goal loses [−author].
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (29), the paper's (44), at slot s, the leftmost number bundle, when singular, loses
[+minimal] before a third inverse object.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (43), a first singular agent loses [+participant] before no object or a [−atomic]
one.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (44), a first singular agent loses [+minimal] before no object or a plural one. It
runs after (43), not in the first set, or 1s:∅ comes out ti, and the printed intransitive
context [[A +author +atomic __]] is widened to a plural object, or 1s:3p comes out pi.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (38b), the reflexive object is obliterated after a singular agent.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (42), a second singular intransitive agent loses [−author].
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (38a), a third plural object is obliterated after a singular agent.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (48a), an inverse object loses its number after a first singular agent.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (48b), a second singular agent loses its singular features before an inverse object.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The appendix's seven sets of rules of impoverishment in order, with its optional (5) included or not.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The same sets with (40) and (26) as printed.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The 3S:3S transitive prefix is ∅ (Table 15).
Equations
- Middleton2026.prefix3S3S = { agent := Middleton2026.third ++ Middleton2026.singular, goal := [], object := Middleton2026.third ++ Middleton2026.singular }
Instances For
The 3S:3I transitive prefix is í (Table 15).
Equations
- Middleton2026.prefix3S3I = { agent := Middleton2026.third ++ Middleton2026.singular, goal := [], object := Middleton2026.third ++ Middleton2026.inverse }
Instances For
The 3S:no transitive prefix is ∅ (Table 16).
Equations
- Middleton2026.prefix3Sno = { agent := Middleton2026.third ++ Middleton2026.singular, goal := [], object := [Middleton2026.Feat.dummy] }
Instances For
The 2S:3S transitive prefix is o (Table 17).
Equations
- Middleton2026.prefix2S3S = { agent := Middleton2026.second ++ Middleton2026.singular, goal := [], object := Middleton2026.third ++ Middleton2026.singular }
Instances For
The 2S intransitive prefix is ǫ (Table 17).
Equations
- Middleton2026.prefix2S = { agent := Middleton2026.second ++ Middleton2026.singular, goal := [], object := [] }
Instances For
The 1S:3S possessive prefix is ôn (Table 22).
Equations
- Middleton2026.prefix1S3S = { agent := [], goal := Middleton2026.first ++ Middleton2026.singular, object := Middleton2026.third ++ Middleton2026.singular }
Instances For
The 1S:3I possessive prefix is ónôm (Table 22).
Equations
- Middleton2026.prefix1S3I = { agent := [], goal := Middleton2026.first ++ Middleton2026.singular, object := Middleton2026.third ++ Middleton2026.inverse }
Instances For
The 1D:3S:3S ditransitive prefix is opénôm (Table 21).
Equations
- One or more equations did not get rendered due to their size.
Instances For
Case 1 (§4.2.1): object impoverishment precedes agent impoverishment #
The 3S:3S prefix is ∅ (Table 15), so no m, the exponent of a third person object (31), is inserted: the object's third person must be gone at Vocabulary Insertion, which (34a) does only while the agent is still there for its context. The theorems are about the feature bundles the two orders leave; that the block order conflicts with Arregi and Nevins rests on the paper's labelling of (40) as paradigmatic (see the implementation notes).
(35) removes the agent that (32a) needs, so applying it first bleeds (32a).
The block architecture keeps the object's third person, which (31) would expone as m.
The same holds for the 3S:3I prefix and (34b). Syntagmatic first, the object loses
[−participant]; paradigmatic first, it keeps it.
Case 2 (§4.2.2): dummy object impoverishment precedes agent impoverishment #
The 3S:no and 3S:3S prefixes are ∅ and toneless (Table 16), so the paper has the object obliterated and its singular features deleted by (45), which need the singular agent that (40) removes. The 3S:3S half reaches the surface (the block order leaves a singular object, which would be exponed); the dummy half is featural only, since a one-argument prefix with a featureless dummy object is ∅ and toneless under either order.
(35) removes the singular agent that (36a) needs, so applying it first bleeds (36a).
The block architecture keeps the dummy object.
Case 3 (§4.2.3): [+minimal] impoverishment precedes [+participant] impoverishment #
The 2S:3S transitive prefix o differs from the 2S intransitive ǫ (Table 17), so the two
agents differ at Vocabulary Insertion. (46) makes them differ by deleting [+minimal] from the
transitive agent, and needs the [+participant] that (11a) deletes.
The transitive and intransitive 2S prefixes differ.
(39) removes the [+participant] that (37) needs, so applying it first bleeds (37).
The block architecture makes the transitive and intransitive 2S agents identical.
Case 4 (§4.2.4): third singular object impoverishment precedes possessive impoverishment #
The 1S:3S possessive prefix is ôn (Table 22), with no m: the object's third person is deleted by (32), which needs the singular goal that (26) makes non-singular.
The 1S:3S possessive prefix has no m.
(43) makes the goal non-singular, so applying it first bleeds (40).
The block architecture keeps the object's third person, which (31) would expone as m.
(33) before (32) keeps the third person of the object of opénôm (Table 21), the m, by making the goal non-singular before (32) looks at it.
The 1D:3S:3S ditransitive prefix keeps m.
Case 5 (§4.2.5): a paradigmatic rule before a syntagmatic one #
The 1S:3I possessive prefix ónôm keeps n, the exponent of [+minimal] (20): (26) deletes
the goal's [+atomic] first and bleeds (29), which would delete the [+minimal].
The 1S:3I possessive prefix keeps n.
(43) makes the goal non-singular, so applying it first bleeds (44), as the attested n needs.
The two kinds interleave (§4.2, §5) #
Interleaving. An order with (32a) before (35), as case 1 needs, and (43) before (44), as case 5 needs, respects neither block architecture: paradigmatic and syntagmatic impoverishment interleave.
Linearization, metathesis and exponence #
After Linearization the prefix is a string of feature terminals, each tagged with its slot,
in the order of (4) and (5); the appendix's rules of metathesis swap adjacent terminals, the
library's TerminalMetathesisRule, (18) and (22) on the goal as their subscript says and (23) on
the second argument, goal or object. Exponence then reads each terminal in its prefix.
A terminal of the linearized prefix is a slot with a feature.
Equations
Instances For
The linearized prefix.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (18), the goal's [−author] swaps with its following inverse feature, when an agent is
present.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (23), the paper's (26), a [−atomic] agent's [+minimal] swaps with the second
argument's following [−author].
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (22), the paper's (24), the goal's [−author] swaps with its following [−atomic]
before [+minimal], when an agent is present.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The appendix's two sets of rules of metathesis in order.
Equations
Instances For
Equations
- Middleton2026.instDecidableEqRole x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
An exponent and its role.
Equations
- Middleton2026.Morph = (String × Middleton2026.Role)
Instances For
Rules of exponence #
A rule of exponence realizes one of its target features, the first its bundle bears, and discharges
the others, as S ⇔ ǫ leaves a singular's [+minimal] unexponed. Its brackets are conditions on
the arguments around the target's slot, each read in the adjacent window of one tier: the leftmost
brackets [[π and [[ω on the tiers of [±participant] and of number, the others on the tier of
the present arguments. A rule with brackets on several tiers refers to several nodes, as the
hyper-contextual rules of [MS16b] do.
The arguments of a prefix around slot s, each with its slot, absent ones empty, in the order
of (1).
Equations
- p.slotsAround Middleton2026.Slot.agent = { focus := (Middleton2026.Slot.agent, p.agent), rightCtx := [(Middleton2026.Slot.goal, p.goal), (Middleton2026.Slot.object, p.object)] }
- p.slotsAround Middleton2026.Slot.goal = { focus := (Middleton2026.Slot.goal, p.goal), leftCtx := [(Middleton2026.Slot.agent, p.agent)], rightCtx := [(Middleton2026.Slot.object, p.object)] }
- p.slotsAround Middleton2026.Slot.object = { focus := (Middleton2026.Slot.object, p.object), leftCtx := [(Middleton2026.Slot.goal, p.goal), (Middleton2026.Slot.agent, p.agent)] }
Instances For
The tiers on which brackets are read.
- present : Tier
The present arguments: those impoverishment has left a feature, an argument whose features are all deleted dropping out.
- participant : Tier
The arguments with a
[±participant]feature, the person bundles that count as leftmost. - number : Tier
The arguments with number features.
Instances For
Equations
- Middleton2026.instDecidableEqTier x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- Middleton2026.instReprTier = { reprPrec := Middleton2026.instReprTier.repr }
Equations
- One or more equations did not get rendered due to their size.
- Middleton2026.instReprTier.repr Middleton2026.Tier.present prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Middleton2026.Tier.present")).group prec✝
- Middleton2026.instReprTier.repr Middleton2026.Tier.number prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Middleton2026.Tier.number")).group prec✝
Instances For
The arguments a tier keeps.
Equations
- Middleton2026.Tier.present.Keeps x✝ = (x✝.2 ≠ [])
- Middleton2026.Tier.participant.Keeps x✝ = x✝.2.HasParticipant
- Middleton2026.Tier.number.Keeps x✝ = (x✝.2.number ≠ [])
Instances For
Equations
- One or more equations did not get rendered due to their size.
A bracket of a rule of exponence.
- own
(P : Slot × Arg → Prop)
[dec : DecidablePred P]
: Bracket
The target's own argument and slot satisfy
P. - leftmost
(t : Tier)
: Bracket
The target's argument is the leftmost of the tier,
[[π __or[[ω __. - after
(t : Tier)
(P : Slot × Arg → Prop)
[dec : DecidablePred P]
: Bracket
The tier's argument before the target's satisfies
P, as in[πA …][π __]. - leftmostIs
(t : Tier)
(P : Slot × Arg → Prop)
[dec : DecidablePred P]
: Bracket
The tier's leftmost argument satisfies
P, as in[[ω I: the one before the target's, else the target's, else the one after.
Instances For
The tier a bracket is read on.
Equations
- (Middleton2026.Bracket.own P).tier = Middleton2026.Tier.present
- (Middleton2026.Bracket.leftmost t).tier = t
- (Middleton2026.Bracket.after t P).tier = t
- (Middleton2026.Bracket.leftmostIs t P).tier = t
Instances For
What a bracket says of a window.
Equations
- (Middleton2026.Bracket.own P).HoldsAt x✝ = P x✝.focus
- (Middleton2026.Bracket.leftmost t).HoldsAt x✝ = (t.Keeps x✝.focus ∧ x✝.leftCtx = [])
- (Middleton2026.Bracket.after t P).HoldsAt x✝ = ∃ x ∈ x✝.leftCtx.head?, P x
- (Middleton2026.Bracket.leftmostIs t P).HoldsAt x✝ = ((∃ x ∈ x✝.leftCtx.head?, P x) ∨ x✝.leftCtx = [] ∧ (t.Keeps x✝.focus ∧ P x✝.focus ∨ ¬t.Keeps x✝.focus ∧ ∃ x ∈ x✝.rightCtx.head?, P x))
Instances For
Equations
- One or more equations did not get rendered due to their size.
A reading of the brackets assigns each the window it is read in.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Each bracket is read in the adjacent window of the tier f assigns its own: with f = id on
its tier, with a tier sent to .present on the present arguments, null terminals pruned but that
tier not projected.
Equations
Instances For
Each bracket is read in the adjacent window of its tier.
Equations
Instances For
The bundle bears the features fs.
Equations
- Middleton2026.ExponenceRule.bears fs = Middleton2026.Bracket.own fun (x : Middleton2026.Slot × Middleton2026.Arg) => ∀ f ∈ fs, f ∈ x.2
Instances For
The target's slot is s.
Equations
- Middleton2026.ExponenceRule.inSlot s = Middleton2026.Bracket.own fun (x : Middleton2026.Slot × Middleton2026.Arg) => x.1 = s
Instances For
The prefix is the dual agent and the target, [[A D][ __ ]].
Equations
- One or more equations did not get rendered due to their size.
Instances For
The agent precedes the target's argument, [πA …][π __]: present, its features possibly
impoverished, the trace reading of the appendix's discussion after (10).
Equations
Instances For
By rule (39b), 3P ⇔ ∅ / [[A D][ __ ]].
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (36), 3P ⇔ w.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (39d), refl ⇔ ∅ / [[A D][ __ ]].
Equations
- Middleton2026.ExponenceRule.e39d = { targets := [Middleton2026.Feat.refl], brackets := [Middleton2026.ExponenceRule.afterDualAgent], exponent := [] }
Instances For
By rule (37), refl ⇔ mo.
Equations
- Middleton2026.ExponenceRule.e37 = { targets := [Middleton2026.Feat.refl], brackets := [], exponent := [("mo", Middleton2026.Role.full)] }
Instances For
By rule (31), 3 ⇔ m / [O __ ].
Equations
- One or more equations did not get rendered due to their size.
Instances For
A third person object's number has no exponent, this study's addition. The appendix lists none, and without it an object that impoverishment leaves the leftmost number would be exponed by (25), (16) or (30).
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (8), 1 ⇔ t / [[π __ +atomic].
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (10), [+participant] ⇔ m / [[±participant __ −author].
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (13), [+participant] ⇔ k / [[π __ ].
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (17), [−author] ⇔ pi / [πA …][π __] with the leftmost number inverse.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (19), [−author] ⇔ pé / [πA …][π __] with the leftmost number dual.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (16a), I ⇔ o / [[ω __ with the leftmost person second.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (16b), I ⇔ i / [[ω __.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (25), S ⇔ ǫ / [[ω __.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (20), [+minimal] ⇔ n / [[ω __.
Equations
- One or more equations did not get rendered due to their size.
Instances For
By rule (30), [±atomic] ⇔ o / [[ω __.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The rule applies to a terminal of a prefix when it targets the terminal's feature and, read by
read, its brackets hold around the terminal's slot.
Equations
- Middleton2026.ExponenceRule.Applies read r p t = (t.2 ∈ r.targets ∧ ∀ c ∈ r.brackets, c.HoldsAt (read c (p.slotsAround t.1)))
Instances For
Equations
- Middleton2026.ExponenceRule.instDecidableApplies read r p t = { decide := decide (t.2 ∈ r.targets) && decide (∀ x ∈ r.brackets, x.HoldsAt (read x (p.slotsAround t.1))), reflects_decide := ⋯ }
The Vocabulary of the appendix's rules of exponence, a bundle's category before its single features and the contextual rules before the elsewhere ones.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The exponents of a terminal in its prefix come from the first rule of the Vocabulary that applies, realized at the first of its targets the bundle bears and null at the others.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The exponents of a linearized prefix, the portmanteaux (6), (41) and (49) and mây first; the flag marks a portmanteau form, which takes no tone rule. Three additions the appendix uses without stating them: mây for the 2:1 prefixes without an object (its §3.4), (41) and (49) matching an argument's remaining bundle exactly, and portmanteaux taking no tone, without which (6) ku would come out kú.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Epenthesis and tone #
The concatenation of a list of strings (String.join does not reduce under decide).
Equations
- Middleton2026.concat l = List.foldl (fun (x1 x2 : String) => x1 ++ x2) "" l
Instances For
A vowel of the exponents, before tone is assigned.
Equations
- Middleton2026.isVowel c = "aeiouǫé".toList.contains c
Instances For
By the epenthesis rule (27), an onset consonant with no vowel after it, or a coda consonant with none before it, takes the vowel o.
Equations
- One or more equations did not get rendered due to their size.
- Middleton2026.epenthesis x✝ [] = []
Instances For
Equations
- Middleton2026.instDecidableEqTone x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
A toned vowel, as the fragment prints it.
Equations
- Middleton2026.mark Middleton2026.Tone.high 'o' = "ó"
- Middleton2026.mark Middleton2026.Tone.high 'ǫ' = "ǫ́"
- Middleton2026.mark Middleton2026.Tone.high 'i' = "í"
- Middleton2026.mark Middleton2026.Tone.high 'e' = "é"
- Middleton2026.mark Middleton2026.Tone.high 'é' = "é"
- Middleton2026.mark Middleton2026.Tone.high 'u' = "ú"
- Middleton2026.mark Middleton2026.Tone.high 'a' = "á"
- Middleton2026.mark Middleton2026.Tone.falling 'o' = "ô"
- Middleton2026.mark Middleton2026.Tone.falling 'ǫ' = "ǫ̂"
- Middleton2026.mark Middleton2026.Tone.falling 'i' = "î"
- Middleton2026.mark Middleton2026.Tone.falling 'e' = "ê"
- Middleton2026.mark Middleton2026.Tone.falling 'é' = "ê"
- Middleton2026.mark Middleton2026.Tone.falling 'u' = "û"
- Middleton2026.mark Middleton2026.Tone.falling 'a' = "â"
- Middleton2026.mark x✝¹ x✝ = x✝.toString
Instances For
The syllable nuclei of a string from index i, each with whether its syllable is
closed.
Equations
- One or more equations did not get rendered due to their size.
- Middleton2026.syllables [] x✝ = []
- Middleton2026.syllables [c] x✝ = if (!Middleton2026.isVowel c) = true then Middleton2026.syllables [] (x✝ + 1) else [(x✝, false)]
Instances For
The appendix's context-specific tone rules (51b)–(51h), read off the cell: a tone for the
final syllable, some none for none, none where no rule applies. The appendix prints (51f) as
toneless, but its prose and Table 3 make the ∅:3s possessives high, as here; (51h) applies as
printed (see the TODO).
Equations
- One or more equations did not get rendered due to their size.
Instances For
By the tone rules (50) and (51), a one-argument prefix is toneless; otherwise the final syllable, mo aside, is high if open and falling if closed, pé is high, and the syllable before it is high unless it precedes pi or pé.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The derivation #
Spell-Out: the prefix of a cell of the paradigm.
Equations
- One or more equations did not get rendered due to their size.
Instances For
A prefix expones its present arguments, less an object silenced by the allomorphs (39b,d).
Equations
Instances For
The surface form of a cell under a rule system results from Spell-Out, impoverishment, Linearization, metathesis, exponence, epenthesis and tone.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The surface form of a cell under the appendix's seven sets, with or without the optional (5).
Equations
- Middleton2026.derive optional c = Middleton2026.deriveWith (Middleton2026.impoverishment optional) c
Instances For
The cells of the paradigm the appendix leaves unaccounted for (see the TODO).
Equations
- One or more equations did not get rendered due to their size.
Instances For
Every other cell of the paradigm derives, with or without the optional (5).
What the pipeline gives the unaccounted cells.
With (40) and (26) as printed, the same cells derive; the bundles differ only where a 3S:3S:O ditransitive keeps its agent, whose exponent is ∅ anyway.
The leftmost brackets are read on tiers. In mopén, 1S:2D:∅, impoverishment leaves the
agent only [+author]: present, so it stands before the goal for (19), but on neither the
[±participant] nor the number tier, so the goal's person and number are leftmost there, the
elevation of the appendix's discussion after (10). Read on the present arguments, the participant
bracket loses m, the number brackets o, pé and n, and both together everything.
Impoverishment precedes metathesis in Taos (§3.2) #
opén, the 1D:3:no prefix of the paper's (25), needs (24) to remove the goal's
[−participant] before (23) can swap the agent's [+minimal] with the goal's [−author];
without (24) the two are not adjacent and the string stays in the order of o-n-pé.
The 1D:3S:no prefix after impoverishment.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Without (24), (23) finds [−participant] in the way and does nothing.
Applied to the prefix as Spell-Out leaves it, (24) feeds (23): it removes the goal's
[−participant] that separates the agent's [+minimal] from the goal's [−author].
Impoverishment precedes metathesis in Basque (§3.1) #
The finite auxiliary of (10) is a string of terminals: the absolutive clitic, T, and the
ergative and dative clitics. Participant Dissimilation, the paper's (16) and (18) after Arregi
and Nevins's (25), obliterates a clitic in the Feature Markedness module; T-Noninitiality, the
paper's (12), is repaired in the Linear Operations module by Ergative Metathesis (13) or
L-Support, one module as in Arregi and Nevins's §6.2.4. T bears [+tense] for their [+past],
and the dative-clitic conditions of their Ergative Metathesis and the [+motion] restriction of
Participant Dissimilation, which the two auxiliaries do not reach, are left out.
A Basque terminal is a list of Minimalist features.
Equations
Instances For
A clitic bears its case and its person and number features.
Equations
- Middleton2026.Basque.clitic c φ = ⟨Minimalist.FeatureType.case, c⟩ :: φ
Instances For
First person, in the Minimalist inventory.
Equations
- Middleton2026.Basque.firstφ = [⟨Minimalist.FeatureType.participant, true⟩, ⟨Minimalist.FeatureType.author, true⟩]
Instances For
Second person, in the Minimalist inventory.
Equations
- Middleton2026.Basque.secondφ = [⟨Minimalist.FeatureType.participant, true⟩, ⟨Minimalist.FeatureType.author, false⟩]
Instances For
T, past tense.
Equations
Instances For
The epenthetic L of L-Support, a terminal without features.
Equations
Instances For
Under Participant Dissimilation a [+participant +author] clitic is obliterated when another
clitic of the word bears trigger; Arregi and Nevins's [+motion] restriction and their First
Singular Clitic Impoverishment, which keep first singular clitics out of it, are not modelled.
Equations
- One or more equations did not get rendered due to their size.
Instances For
In Ondarru, the paper's (16), the trigger is an ergative participant clitic.
Equations
Instances For
In Zamudio, the paper's (18), the trigger is any participant clitic.
Equations
Instances For
Under Ergative Metathesis, the paper's (13) after Arregi and Nevins's (105), a word-initial T is preceded by the first ergative clitic that follows it, without (105a)'s conditions on an intervening dative clitic.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Ergative Metathesis preserves the number of terminals.
L-Support: an L before a word-initial T.
Equations
- Middleton2026.Basque.lSupportRepair d = if ∃ t ∈ List.head? d, ⟨Minimalist.FeatureType.tense, true⟩ ∈ t then Middleton2026.Basque.lSupport :: d else d
Instances For
The Linear Operations module applies the two repairs of T-Noninitiality.
Equations
Instances For
Feature Markedness before Linear Operations, the order of Figure 1.
Equations
Instances For
Linear Operations before Feature Markedness, the order both papers reject.
Equations
Instances For
The Ondarru auxiliary of (17), s-endu-n 'you saw us': a first plural absolutive clitic, past T, and a second singular ergative clitic.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The Zamudio auxiliary of (19), y-a-tzu-e-n 'we accompanied you lot': past T, a second plural dative clitic, and a first plural ergative clitic.
Equations
- One or more equations did not get rendered due to their size.
Instances For
In Ondarru with markedness first, Participant Dissimilation obliterates the absolutive clitic, leaving T initial, and Ergative Metathesis then fronts the ergative clitic, giving s-endu-n.
In Ondarru with the linear module first, T is not initial, so neither repair applies, and after the absolutive clitic goes T is stranded initial, Arregi and Nevins's (17b) eu-su-n.
In Ondarru, Participant Dissimilation feeds Ergative Metathesis (§3.1.3), T being initial only once the absolutive clitic is gone.
In Zamudio with markedness first, Participant Dissimilation obliterates the ergative clitic, so no ergative is left to front and L-Support repairs the initial T, giving y-a-tzu-e-n.
In Zamudio with the linear module first, Ergative Metathesis fronts the ergative clitic, which Participant Dissimilation then obliterates, stranding T initial, the form Arregi and Nevins's §6.2.4 rejects.
In Zamudio, Participant Dissimilation bleeds Ergative Metathesis (§3.1.4) by removing the ergative clitic that would front.