Docs / Morphology / Inflection

Inflectional paradigms

import Linglib.Morphology.Inflection · namespace Morphology

Source

An inflectional paradigm builds the forms of each lexeme at each cell from a stem, its lexical material, and inflectional material, joined by one morphotactics. Corbett defines canonical inflection by comparing them: across the cells of a lexeme the stem stays the same while the inflectional material differs, and across lexemes at one cell the stems differ while the inflectional material stays the same. A canonical paradigm satisfies the four comparisons and realizes every cell by exactly one form. When forms decompose uniquely, the comparisons entail that every cell has its own form, as Stump observes, and a canonical paradigm has neither a suppletive stem nor a suppletive affix.

Implementation notes

The morphotactics is one function for every cell and lexeme, so Corbett's first row, the same composition throughout, holds by construction. Theories supply the paradigm: Distributed Morphology the exponents of a root and of the head beside it, Paradigm Function Morphology a linkage's form correspondents and its realization rules. Two paradigms analyse the same forms when their realizations are equal.

References

  • Corbett 2007, Canonical typology, suppletion, and possible words
  • Stump 2016, Inflectional Paradigms: Content and Form at the Syntax-Morphology Interface formalized

Declarations

L44–50
L56–57
L71–73
L80–82
L89–105
L110–116

In an unambiguous canonical paradigm the distinct cells of a lexeme have distinct forms, and so do corresponding cells of distinct lexemes, Corbett's comparison of outcomes.

theorem InflectionalParadigm.IsCanonical.realize_disjointL118–130
{L : Type u_1} {C : Type u_2} {Z : Type u_3} {I : Type u_4} {F : Type u_5} {P : InflectionalParadigm L C Z I F} [DecidableEq F] [DecidableEq Z] [DecidableEq I] (h : P.IsCanonical) (hP : P.IsUnambiguous) :
(∀ (l : L), Pairwise (Function.onFun Disjoint (P.realization.realize l))) ∧ ∀ (c : C), Pairwise (Function.onFun Disjoint fun (l : L) => P.realization.realize l c)

Built from , , ,

A canonical paradigm has no suppletive stem, and no cell whose inflectional material is suppletive across lexemes.

theorem InflectionalParadigm.IsCanonical.not_isSuppletiveL132–138
{L : Type u_1} {C : Type u_2} {Z : Type u_3} {I : Type u_4} {F : Type u_5} {P : InflectionalParadigm L C Z I F} [DecidableEq F] [DecidableEq Z] [DecidableEq I] (h : P.IsCanonical) :
(∀ (l : L), ¬P.stem.IsSuppletive l) ∧ ∀ (c : C), ¬P.inflection.transpose.IsSuppletive c

Built from , , ,