Paradigms: forms over ordered cells #
The morphologist's primary observable: a paradigm assigns a surface
form to each of n linearly ordered cells. One type serves both
research lines that consume it — realization-pattern typology (*ABA and
contiguity, Morphology/Paradigm/Contiguity.lean) and paradigm-cell
information theory (implicative structure and complexity,
Morphology/Paradigm/Complexity.lean). [AM13a]'s
inflection classes are paradigms with frequency weights
(ParadigmSystem); [Bob12]-style realization patterns are
paradigms over graded cells.
Main declarations #
Paradigm n F— assignment of a form to each of thencellsParadigmSystem n Form— paradigms with frequency weights, organized by inflection classcellDistribution,jointCellDistribution— empirical form distributions at cellseComplexity— count of inflection classes (Ackerman-Malouf E-complexity)
A paradigm over n linearly ordered cells: the form occupying
each cell. The single carrier for realization patterns
([Bob12]'s AAA/ABB/ABC shapes; see
Morphology/Paradigm/Contiguity.lean) and for inflection-class rows
([AM13a]; a weighted system of paradigms is a
ParadigmSystem).
Equations
- Morphology.Paradigm n F = (Fin n → F)
Instances For
A paradigm system: paradigms (inflection classes) paired with frequency weights.
- entries : List (Paradigm numCells Form × ℚ)
Instances For
Group a tagged list by key, summing associated ℚ values.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Empirical distribution of forms at cell c: pairs each surface form with
the total frequency of inflection classes realizing it at c.
Equations
- ps.cellDistribution c = Morphology.groupBySum (List.map (fun (x : Morphology.Paradigm n Form × ℚ) => match x with | (ic, f) => (ic c, f)) ps.entries)
Instances For
Joint empirical distribution of forms at cell pair (ci, cj).
Equations
- One or more equations did not get rendered due to their size.
Instances For
E-complexity ([AM13a]): the number of inflection classes in the paradigm system.
Equations
- ps.eComplexity = ps.entries.length