Documentation

Linglib.Fragments.Turkish.SuffixTemplate

Turkish Suffix Template #

[GK05]

Turkish is strictly suffixing ([GK05] Ch 6). Suffixes attach in a fixed order determined by a positional template.

Verbal template (Ch 6, 8, 13) #

Root -> Voice -> Negation -> TAM -> Copula -> Agreement -> Question

Nominal template (Ch 6, 8, 14) #

Root -> Derivational -> Plural -> Possessive -> Case

Key properties #

  1. Strict ordering: suffixes from later slots never precede earlier ones
  2. At most one per slot: each slot filled at most once (voice can stack: e.g., yap-tır-ıl- 'be made to do' = CAUS + PASS)
  3. Monoexponential: each suffix realizes a single morphosyntactic feature (WALS F21A: monoexponential case)
source
inductive Turkish.SuffixTemplate.VerbSlot :
Type

Verbal suffix slots, ordered innermost to outermost. [GK05] Ch 6, 8, 13.

Instances For
    source
    @[implicit_reducible]
    instance Turkish.SuffixTemplate.instDecidableEqVerbSlot :
    DecidableEq VerbSlot
    Equations
    source
    def Turkish.SuffixTemplate.instReprVerbSlot.repr :
    VerbSlot → ℕ → Std.Format
    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      source
      @[implicit_reducible]
      instance Turkish.SuffixTemplate.instReprVerbSlot :
      Repr VerbSlot
      Equations
      source
      inductive Turkish.SuffixTemplate.NounSlot :
      Type

      Nominal suffix slots, ordered innermost to outermost. [GK05] Ch 6, 8, 14.

      Instances For
        source
        @[implicit_reducible]
        instance Turkish.SuffixTemplate.instDecidableEqNounSlot :
        DecidableEq NounSlot
        Equations
        source
        def Turkish.SuffixTemplate.instReprNounSlot.repr :
        NounSlot → ℕ → Std.Format
        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          source
          @[implicit_reducible]
          instance Turkish.SuffixTemplate.instReprNounSlot :
          Repr NounSlot
          Equations
          source
          def Turkish.SuffixTemplate.VerbSlot.rank :
          VerbSlot → ℕ
          Equations
          Instances For
            source
            def Turkish.SuffixTemplate.NounSlot.rank :
            NounSlot → ℕ
            Equations
            Instances For
              source
              theorem Turkish.SuffixTemplate.voice_before_neg :
              VerbSlot.voice.rank < VerbSlot.negation.rank
              source
              theorem Turkish.SuffixTemplate.neg_before_tam :
              VerbSlot.negation.rank < VerbSlot.tam.rank
              source
              theorem Turkish.SuffixTemplate.tam_before_cop :
              VerbSlot.tam.rank < VerbSlot.copula.rank
              source
              theorem Turkish.SuffixTemplate.cop_before_agr :
              VerbSlot.copula.rank < VerbSlot.agreement.rank
              source
              theorem Turkish.SuffixTemplate.agr_before_q :
              VerbSlot.agreement.rank < VerbSlot.question.rank
              source
              theorem Turkish.SuffixTemplate.plural_before_poss :
              NounSlot.plural.rank < NounSlot.possessive.rank
              source
              theorem Turkish.SuffixTemplate.poss_before_case :
              NounSlot.possessive.rank < NounSlot.case.rank
              source
              theorem Turkish.SuffixTemplate.neg_not_after_tam :
              ¬VerbSlot.tam.rank < VerbSlot.negation.rank

              Negation cannot follow TAM (reversed order).

              source
              theorem Turkish.SuffixTemplate.case_not_before_poss :
              ¬NounSlot.case.rank < NounSlot.possessive.rank

              Case cannot precede possessive (reversed order).

              source
              theorem Turkish.SuffixTemplate.voice_stacking_ok :
              VerbSlot.voice.rank ≤ VerbSlot.voice.rank

              Voice suffixes can stack (two voice entries at rank 0 is well-formed). Example: yap-tır-ıl- (do-CAUS-PASS).

              source
              theorem Turkish.SuffixTemplate.tam_entries_fill_tam_slot :
              TAM.entries.length = 8 ∧ VerbSlot.tam.rank = 2

              All 8 TAM categories fill the .tam slot (slot rank 2).

              source
              theorem Turkish.SuffixTemplate.negation_precedes_tam :
              VerbSlot.negation.rank < VerbSlot.tam.rank

              Negation (-mA-) occupies slot rank 1, strictly before TAM (slot rank 2). This matches the surface order: gel-me-di (stem-NEG-PST).

              source
              theorem Turkish.SuffixTemplate.question_is_outermost :
              VerbSlot.question.rank = 5 ∧ ∀ (s : VerbSlot), s.rank ≤ VerbSlot.question.rank

              The question particle mI fills the outermost verbal slot (rank 5). It follows agreement, yielding: gel-di-m mi? (come-PST-1SG Q).

              source
              theorem Turkish.SuffixTemplate.progressive_I_resolution :
              VowelHarmony.resolveI true false = VowelHarmony.ı_vowel ∧ VowelHarmony.resolveI false false = VowelHarmony.i_vowel ∧ VowelHarmony.resolveI true true = VowelHarmony.u_vowel ∧ VowelHarmony.resolveI false true = VowelHarmony.ü_vowel

              The archiphonemic I in progressive -Iyor resolves to 4 surface vowels depending on stem harmony. This connects VowelHarmony to TAM:

              • back+unround stem (kol): -ıyor (resolveI true false = ı)
              • front+unround stem (gel): -iyor (resolveI false false = i)
              • back+round stem (kol): -uyor (resolveI true true = u)
              • front+round stem (göz): -üyor (resolveI false true = ü)
              source
              theorem Turkish.SuffixTemplate.future_A_resolution :
              VowelHarmony.resolveA true = VowelHarmony.a_vowel ∧ VowelHarmony.resolveA false = VowelHarmony.e_vowel

              The archiphonemic A in future -(y)AcAK resolves to a/e by palatal harmony. back stem (kol): -(y)acak; front stem (gel): -(y)ecek.