Coordination Types

Shared types for cross-linguistic coordination morphology, used by Fragment lexicons and Phenomena/Coordination studies.

CoordRole

The role of a coordination morpheme in the @cite{mitrovic-sauerland-2014} decomposition and beyond:

• j — set intersection (conjunction proper)
• mu — subset/additive (MU particle)
• disj — disjunction
• advers — adversative ("but")
• negDisj — negative disjunction ("nor")
• negCoord — negative coordination ("neither...nor")

Boundness

Whether a morpheme is a free word or a bound clitic/suffix. Relevant to acquisition: @cite{clark-2017} argues free morphemes are acquired more readily than bound ones.

CoordEntry

Unified coordination morpheme entry used by all Fragment lexicons.

ConjunctionStrategy

Cross-linguistic conjunction strategy from @cite{mitrovic-sauerland-2014}: languages vary in which semantic pieces (J, MU, type-shifter) are overtly realized.

inductive Features.Coordination.CoordRole : Type

Role of a coordination morpheme.

• j : CoordRole

  J particle: set intersection / conjunction proper (English "and", Hungarian "es", Georgian "da")

• mu : CoordRole

  MU particle: subset/additive (Hungarian "is", Georgian "-c", Japanese "mo")

• disj : CoordRole

  Disjunction (English "or", Hungarian "vagy")

• advers : CoordRole

  Adversative (English "but", Hungarian "de")

• negDisj : CoordRole

  Negative disjunction (Irish "na" = "nor")

• negCoord : CoordRole

  Negative coordination (Latin "neque/nec" = "neither...nor")

@[implicit_reducible]

instance Features.Coordination.instDecidableEqCoordRole : DecidableEq CoordRole

Equations

• Features.Coordination.instDecidableEqCoordRole x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

def Features.Coordination.instReprCoordRole.repr : CoordRole → Nat → Std.Format

Equations

• One or more equations did not get rendered due to their size.

@[implicit_reducible]

instance Features.Coordination.instReprCoordRole : Repr CoordRole

Equations

• Features.Coordination.instReprCoordRole = { reprPrec := Features.Coordination.instReprCoordRole.repr }

def Features.Coordination.instBEqCoordRole.beq : CoordRole → CoordRole → Bool

Equations

• Features.Coordination.instBEqCoordRole.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)

@[implicit_reducible]

instance Features.Coordination.instBEqCoordRole : BEq CoordRole

Equations

• Features.Coordination.instBEqCoordRole = { beq := Features.Coordination.instBEqCoordRole.beq }

inductive Features.Coordination.Boundness : Type

Morphological boundness: free word vs bound clitic/suffix.

• free : Boundness

  Independent word (Hungarian "is", English "and")

• bound : Boundness

  Clitic or suffix (Georgian "-c", Latin "-que")

@[implicit_reducible]

instance Features.Coordination.instDecidableEqBoundness : DecidableEq Boundness

Equations

• Features.Coordination.instDecidableEqBoundness x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

@[implicit_reducible]

instance Features.Coordination.instReprBoundness : Repr Boundness

Equations

• Features.Coordination.instReprBoundness = { reprPrec := Features.Coordination.instReprBoundness.repr }

def Features.Coordination.instReprBoundness.repr : Boundness → Nat → Std.Format

Equations

• One or more equations did not get rendered due to their size.

@[implicit_reducible]

instance Features.Coordination.instBEqBoundness : BEq Boundness

Equations

• Features.Coordination.instBEqBoundness = { beq := Features.Coordination.instBEqBoundness.beq }

def Features.Coordination.instBEqBoundness.beq : Boundness → Boundness → Bool

Equations

• Features.Coordination.instBEqBoundness.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)

structure Features.Coordination.CoordEntry : Type

A coordination morpheme entry, used by all Fragment lexicons.

• form : String

  Surface form of the morpheme.

• gloss : String

  Gloss / translation.

• role : CoordRole

  Role in the M&S decomposition.

• boundness : Boundness

  Whether this morpheme is free or bound.

• alsoAdditive : Bool

  Does this morpheme also serve as an additive/focus particle?

• alsoQuantifier : Bool

  Does this morpheme also serve as a quantifier particle? Japanese "mo" and "ka" both do — this field tracks the coordination-quantification connection.

• correlative : Bool

  Can this morpheme be used in correlative (bisyndetic) patterns? Latin "et...et", "aut...aut".

• note : String

  Notes on usage or distribution.

@[implicit_reducible]

instance Features.Coordination.instDecidableEqCoordEntry : DecidableEq CoordEntry

Equations

• Features.Coordination.instDecidableEqCoordEntry = Features.Coordination.instDecidableEqCoordEntry.decEq

def Features.Coordination.instDecidableEqCoordEntry.decEq (x✝ x✝¹ : CoordEntry) : Decidable (x✝ = x✝¹)

Equations

• One or more equations did not get rendered due to their size.

@[implicit_reducible]

instance Features.Coordination.instReprCoordEntry : Repr CoordEntry

Equations

• Features.Coordination.instReprCoordEntry = { reprPrec := Features.Coordination.instReprCoordEntry.repr }

def Features.Coordination.instReprCoordEntry.repr : CoordEntry → Nat → Std.Format

Equations

• One or more equations did not get rendered due to their size.

@[implicit_reducible]

instance Features.Coordination.instBEqCoordEntry : BEq CoordEntry

Equations

• Features.Coordination.instBEqCoordEntry = { beq := Features.Coordination.instBEqCoordEntry.beq }

def Features.Coordination.instBEqCoordEntry.beq : CoordEntry → CoordEntry → Bool

Equations

• One or more equations did not get rendered due to their size.
• Features.Coordination.instBEqCoordEntry.beq x✝¹ x✝ = false

inductive Features.Coordination.ConjunctionStrategy : Type

Cross-linguistic conjunction strategy.

@cite{mitrovic-sauerland-2014} decompose DP conjunction into three semantic pieces: J (set intersection), MU (subset), and a type-shifter. Languages vary in which pieces are overtly realized.

• jOnly : ConjunctionStrategy

  Only J particle overt (e.g., English "and", Hungarian "es", Georgian "da")

• muOnly : ConjunctionStrategy

  Only MU particles overt (e.g., Japanese "mo...mo", Hungarian "is...is", Georgian "-c...-c")

• jMu : ConjunctionStrategy

  Both J and MU overt (e.g., Hungarian "is es...is", Georgian "-c da...-c")

@[implicit_reducible]

instance Features.Coordination.instDecidableEqConjunctionStrategy : DecidableEq ConjunctionStrategy

Equations

• Features.Coordination.instDecidableEqConjunctionStrategy x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

@[implicit_reducible]

instance Features.Coordination.instReprConjunctionStrategy : Repr ConjunctionStrategy

Equations

• Features.Coordination.instReprConjunctionStrategy = { reprPrec := Features.Coordination.instReprConjunctionStrategy.repr }

def Features.Coordination.instReprConjunctionStrategy.repr : ConjunctionStrategy → Nat → Std.Format

Equations

• One or more equations did not get rendered due to their size.

def Features.Coordination.ConjunctionStrategy.overtMorphemeCount : ConjunctionStrategy → Nat

Number of overt functional morphemes per strategy.

Under @cite{mitrovic-sauerland-2016}, the underlying structure always has 3 semantic pieces (J + MU1 + MU2). What varies is how many are pronounced.

Equations

• Features.Coordination.ConjunctionStrategy.jOnly.overtMorphemeCount = 1
• Features.Coordination.ConjunctionStrategy.muOnly.overtMorphemeCount = 2
• Features.Coordination.ConjunctionStrategy.jMu.overtMorphemeCount = 3

def Features.Coordination.ConjunctionStrategy.semanticPieceCount : Nat

Under @cite{mitrovic-sauerland-2016}, there are always 3 semantic pieces. The transparency ratio measures how many are overtly realized.

Equations

• Features.Coordination.ConjunctionStrategy.semanticPieceCount = 3

def Features.Coordination.ConjunctionStrategy.predictedTransparency : ConjunctionStrategy → Nat

@cite{mitrovic-sauerland-2016} + Transparency Principle predicts: more overt morphemes -> easier to acquire (closer to 1-to-1 form-meaning mapping).

Equations

• Features.Coordination.ConjunctionStrategy.predictedTransparency = Features.Coordination.ConjunctionStrategy.overtMorphemeCount

inductive Features.Coordination.CoordSymmetry : Type

Structural symmetry of a coordinate phrase.

The three groups of analyses for selection-violating coordination (@cite{schwarzer-2026}) disagree on this parameter:

• Bottom-up accounts assume asymmetric structure: the first conjunct is structurally more prominent (c-commands the second), so only it must satisfy the selector's c-selectional requirements.
• Linear/temporal closeness accounts are compatible with either, but their predictions derive from linear/temporal order, not structure.
• Symmetric accounts (@cite{neeleman-etal-2022}, @cite{przepiorkowski-2024}) posit flat or multidominance structures with no structural prominence.

• symmetric : CoordSymmetry

  Flat or multidominance: no conjunct is structurally more prominent.

• asymmetric : CoordSymmetry

  Binary &P: first conjunct is structurally more prominent (c-commands the second conjunct).

@[implicit_reducible]

instance Features.Coordination.instDecidableEqCoordSymmetry : DecidableEq CoordSymmetry

Equations

• Features.Coordination.instDecidableEqCoordSymmetry x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

def Features.Coordination.instReprCoordSymmetry.repr : CoordSymmetry → Nat → Std.Format

Equations

• One or more equations did not get rendered due to their size.

@[implicit_reducible]

instance Features.Coordination.instReprCoordSymmetry : Repr CoordSymmetry

Equations

• Features.Coordination.instReprCoordSymmetry = { reprPrec := Features.Coordination.instReprCoordSymmetry.repr }

@[implicit_reducible]

instance Features.Coordination.instBEqCoordSymmetry : BEq CoordSymmetry

Equations

• Features.Coordination.instBEqCoordSymmetry = { beq := Features.Coordination.instBEqCoordSymmetry.beq }

def Features.Coordination.instBEqCoordSymmetry.beq : CoordSymmetry → CoordSymmetry → Bool

Equations

• Features.Coordination.instBEqCoordSymmetry.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)