WALS Feature 26A: Prefixing vs. Suffixing in Inflectional Morphology

@cite{dryer-2013-wals}

Auto-generated from WALS v2020.4 CLDF data. Do not edit by hand — regenerate with python3 scripts/gen_wals.py 26A.

Chapter 26, 969 languages.

inductive Core.WALS.F26A.PrefixSuffixPreference : Type

WALS 26A values.

• littleAffixation : PrefixSuffixPreference
• stronglySuffixing : PrefixSuffixPreference
• weaklySuffixing : PrefixSuffixPreference
• equalPrefixingAndSuffixing : PrefixSuffixPreference
• weaklyPrefixing : PrefixSuffixPreference
• strongPrefixing : PrefixSuffixPreference

instance Core.WALS.F26A.instDecidableEqPrefixSuffixPreference : DecidableEq PrefixSuffixPreference

Equations

• Core.WALS.F26A.instDecidableEqPrefixSuffixPreference x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

instance Core.WALS.F26A.instBEqPrefixSuffixPreference : BEq PrefixSuffixPreference

Equations

• Core.WALS.F26A.instBEqPrefixSuffixPreference = { beq := Core.WALS.F26A.instBEqPrefixSuffixPreference.beq }

def Core.WALS.F26A.instBEqPrefixSuffixPreference.beq : PrefixSuffixPreference → PrefixSuffixPreference → Bool

Equations

• Core.WALS.F26A.instBEqPrefixSuffixPreference.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)

instance Core.WALS.F26A.instReprPrefixSuffixPreference : Repr PrefixSuffixPreference

Equations

• Core.WALS.F26A.instReprPrefixSuffixPreference = { reprPrec := Core.WALS.F26A.instReprPrefixSuffixPreference.repr }

def Core.WALS.F26A.instReprPrefixSuffixPreference.repr : PrefixSuffixPreference → Nat → Std.Format

Equations

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

def Core.WALS.F26A.allData : List (Datapoint PrefixSuffixPreference)

Complete WALS 26A dataset (969 languages).

Equations

• Core.WALS.F26A.allData = Core.WALS.F26A.allData_0✝ ++ Core.WALS.F26A.allData_1✝

theorem Core.WALS.F26A.total_count : allData.length = 969

theorem Core.WALS.F26A.count_littleAffixation : (List.filter (fun (x : Datapoint PrefixSuffixPreference) => x.value == PrefixSuffixPreference.littleAffixation) allData).length = 141

theorem Core.WALS.F26A.count_stronglySuffixing : (List.filter (fun (x : Datapoint PrefixSuffixPreference) => x.value == PrefixSuffixPreference.stronglySuffixing) allData).length = 406

theorem Core.WALS.F26A.count_weaklySuffixing : (List.filter (fun (x : Datapoint PrefixSuffixPreference) => x.value == PrefixSuffixPreference.weaklySuffixing) allData).length = 123

theorem Core.WALS.F26A.count_equalPrefixingAndSuffixing : (List.filter (fun (x : Datapoint PrefixSuffixPreference) => x.value == PrefixSuffixPreference.equalPrefixingAndSuffixing) allData).length = 147

theorem Core.WALS.F26A.count_weaklyPrefixing : (List.filter (fun (x : Datapoint PrefixSuffixPreference) => x.value == PrefixSuffixPreference.weaklyPrefixing) allData).length = 94

theorem Core.WALS.F26A.count_strongPrefixing : (List.filter (fun (x : Datapoint PrefixSuffixPreference) => x.value == PrefixSuffixPreference.strongPrefixing) allData).length = 58

def Core.WALS.F26A.lookup (code : String) : Option (Datapoint PrefixSuffixPreference)

Look up a language by WALS code.

Equations

• Core.WALS.F26A.lookup code = Core.WALS.Datapoint.lookup Core.WALS.F26A.allData code

def Core.WALS.F26A.lookupISO (iso : String) : Option (Datapoint PrefixSuffixPreference)

Look up a language by ISO 639-3 code.

Equations

• Core.WALS.F26A.lookupISO iso = Core.WALS.Datapoint.lookupISO Core.WALS.F26A.allData iso