Documentation

Studies.HahnDegenFutrell2021

Hahn, Degen, and Futrell (2021): Modeling Word and Morpheme Order in Natural Language as an Efficient Trade-Off of Memory and Surprisal #

Hahn, Degen and Futrell explain word and morpheme order by the tradeoff of memory and surprisal. A listener predicts each word from a memory state updated word by word, and the paper's information locality bound says that a listener whose memory cannot hold the dependencies up to some distance pays at least the entropy rate plus the information carried at longer distances, the quantities of Core/InformationTheory/EntropyRate.lean. We prove the bound, compare two orders of a sentence by dependency length, and check the paper's morpheme templates against Bybee's relevance hierarchy.

Main statements #

Implementation notes #

References #

Dependency locality #

The unshifted order of example (2), in which the object precedes the prepositional phrase.

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

    The shifted order of example (2), in which the prepositional phrase precedes the long object.

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

      The unshifted order is the shifted one with the prepositional phrase and the object swapped, each moving as a block.

      Heavy NP shift cuts the verb's distance to the prepositional phrase from nine to three and raises its distance to the object from six to nine, so the total dependency length falls: by Behaghel's law at the verb, the phrases after it grow outward in the shifted order and not in the unshifted one.

      The information locality bound #

      def HahnDegenFutrell2021.memoryState {Ω : Type u_1} {W : Type u_2} {Mem : Type u_3} (M : Mem → W → Mem) (m₀ : Ω → Mem) (w : ℕ → Ω → W) :
      ℕ → Ω → Mem

      memoryState M m₀ w t is the listener's memory state when the word at time t arrives. It is reached from the initial state m₀ by the memory encoding function M, which updates a state with the word just heard.

      Equations
      Instances For
        theorem HahnDegenFutrell2021.exists_memoryState_eq_comp {Ω : Type u_1} {W : Type u_2} {Mem : Type u_3} {w : ℕ → Ω → W} {M : Mem → W → Mem} {m₀ : Ω → Mem} (t : ℕ) :
        ∃ (g : (Fin t → W) × Mem → Mem), memoryState M m₀ w t = g ∘ fun (ω : Ω) => (ProbabilityTheory.block w 0 t ω, m₀ ω)

        A memory state is a function of the initial state and the words heard since.

        theorem HahnDegenFutrell2021.measurable_memoryState {Ω : Type u_1} {W : Type u_2} {Mem : Type u_3} {w : ℕ → Ω → W} {M : Mem → W → Mem} {m₀ : Ω → Mem} [MeasurableSpace Ω] [MeasurableSpace W] [MeasurableSingletonClass W] [Fintype W] [MeasurableSpace Mem] [MeasurableSingletonClass Mem] [Fintype Mem] (hw : ∀ (t : ℕ), Measurable (w t)) (hm₀ : Measurable m₀) (t : ℕ) :
        Measurable (memoryState M m₀ w t)
        theorem HahnDegenFutrell2021.condEntropy_block_le_sum {Ω : Type u_1} {W : Type u_2} {Mem : Type u_3} {w : ℕ → Ω → W} {M : Mem → W → Mem} {m₀ : Ω → Mem} [MeasurableSpace Ω] [MeasurableSpace W] [MeasurableSingletonClass W] [Fintype W] [MeasurableSpace Mem] [MeasurableSingletonClass Mem] [Fintype Mem] {μ : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure μ] (hw : ∀ (t : ℕ), Measurable (w t)) (hm₀ : Measurable m₀) (T : ℕ) :
        InformationTheory.condEntropy (ProbabilityTheory.block w 0 T) m₀ μ ≤ ∑ t ∈ Finset.range T, InformationTheory.condEntropy (w t) (memoryState M m₀ w t) μ

        Over a block of T words, a listener's summed surprisal is at least the entropy of the block given the initial memory state.

        theorem HahnDegenFutrell2021.condEntropy_memoryState_eq {Ω : Type u_1} {W : Type u_2} {Mem : Type u_3} {w : ℕ → Ω → W} {M : Mem → W → Mem} {m₀ : Ω → Mem} [MeasurableSpace Ω] [MeasurableSpace W] [MeasurableSingletonClass W] [Fintype W] [MeasurableSpace Mem] [MeasurableSingletonClass Mem] [Fintype Mem] {μ : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure μ] (hw : ∀ (t : ℕ), Measurable (w t)) (hm₀ : Measurable m₀) (hs : ProbabilityTheory.IsStationary (fun (t : ℕ) (ω : Ω) => (w t ω, memoryState M m₀ w t ω)) μ) (t : ℕ) :

        Under joint stationarity, the average surprisal does not depend on the time.

        theorem HahnDegenFutrell2021.pastCondEntropy_le_condEntropy {Ω : Type u_1} {W : Type u_2} {Mem : Type u_3} {w : ℕ → Ω → W} {M : Mem → W → Mem} {m₀ : Ω → Mem} [MeasurableSpace Ω] [MeasurableSpace W] [MeasurableSingletonClass W] [Fintype W] [MeasurableSpace Mem] [MeasurableSingletonClass Mem] [Fintype Mem] {μ : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure μ] (hw : ∀ (t : ℕ), Measurable (w t)) (hm₀ : Measurable m₀) (hs : ProbabilityTheory.IsStationary (fun (t : ℕ) (ω : Ω) => (w t ω, memoryState M m₀ w t ω)) μ) {T : ℕ} (hT : 0 < T) (hmem : InformationTheory.entropy m₀ μ ≤ ∑ t ∈ Finset.Icc 1 T, ↑t * InformationTheory.distanceInfo w μ t) :

        A listener whose memory entropy is at most ∑ t ∈ Icc 1 T, t * I t does no better than one who remembers exactly the last T words.

        theorem HahnDegenFutrell2021.information_locality_bound {Ω : Type u_1} {W : Type u_2} {Mem : Type u_3} {w : ℕ → Ω → W} {M : Mem → W → Mem} {m₀ : Ω → Mem} [MeasurableSpace Ω] [MeasurableSpace W] [MeasurableSingletonClass W] [Fintype W] [MeasurableSpace Mem] [MeasurableSingletonClass Mem] [Fintype Mem] {μ : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure μ] (hw : ∀ (t : ℕ), Measurable (w t)) (hm₀ : Measurable m₀) (hs : ProbabilityTheory.IsStationary (fun (t : ℕ) (ω : Ω) => (w t ω, memoryState M m₀ w t ω)) μ) {T : ℕ} (hT : 0 < T) (hmem : InformationTheory.entropy m₀ μ ≤ ∑ t ∈ Finset.Icc 1 T, ↑t * InformationTheory.distanceInfo w μ t) :
        InformationTheory.entropyRate w μ + ∑' (t : ℕ), InformationTheory.distanceInfo w μ (T + t + 1) ≤ InformationTheory.condEntropy (w 0) m₀ μ

        The information locality bound, the paper's Theorem 1. A listener whose memory entropy is at most ∑ t ∈ Icc 1 T, t * I t incurs average surprisal at least the entropy rate plus the information at distances beyond T.

        The Japanese suffix template #

        The supplement tabulates the relative orders of the Japanese verb suffixes in attested forms, each segmented into a stem and its suffixes. Every suffix gloss names a suffix of the Fragment, and the suffixes of every form are licensed by its template.

        The suffixes a row's gloss line names after the stem.

        Equations
        Instances For

          The supplement's Japanese forms.

          Equations
          Instances For

            Every gloss after the stem of each of the supplement's Japanese forms names a suffix of the Fragment, and the suffixes of the form are licensed by Japanese.Verb.template.

            The Sesotho affix template #

            The paper's examples (2), the forms of [Dem92] its supplement tabulates, and two forms from the corpus are segmented into a stem and its affixes; every gloss but the stem's names an affix of the Fragment, and the affixes of every form are licensed by its template.

            The affixes a gloss names: Demuth's labels, the corpus labels of the supplement, and the fused applicative perfect -ets-. Demuth's mood vowel is read as the indicative ending.

            Equations
            Instances For

              The affixes a row's gloss line names, in linear order.

              Equations
              Instances For

                The paper's Sesotho forms.

                Equations
                Instances For
                  theorem HahnDegenFutrell2021.sesotho_forms_licensed (r : Datum) :
                  r ∈ sesothoForms → (List.filter (fun (g : String) => (sesothoAffix g).isEmpty) r.glossLine).length = 1 ∧ Sesotho.Verb.Licensed (sesothoAffixes r)

                  In each Sesotho form exactly one gloss, the stem's, names no affix, and the affixes of the form are licensed by Sesotho.Verb.template.

                  The paper's own Sesotho suffix order, which places the passive before the perfect.

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

                    Demuth's pheh-ets-w-e (44), the perfect before the passive, is licensed by the Fragment and not by the paper's order.

                    Morpheme order and the relevance hierarchy #

                    The paper compares its slots with [Byb85]'s hierarchy of valence, voice, aspect, tense, mood and subject agreement, and claims that the valence and voice suffixes lie closer to the stem than the tense, aspect and mood markers, and that Sesotho subject agreement lies farther out than the tense and aspect prefixes. The slots are compared through the categories the paper labels them with.

                    The Sesotho prefix order in Bybee's vocabulary, stem-outward.

                    Equations
                    Instances For

                      The paper's Sesotho suffix order, the extensions, the passive, the perfect and the mood vowel, is sorted by the relevance hierarchy, which on the surveyed categories is [Byb85]'s order, Bybee1985.survey_order_iso_relevance.

                      The Fragment's suffix order, [Dem92]'s, has the perfect before the passive, tense before voice, and is not sorted by the hierarchy: the paper's agreement rests on its order.

                      The paper's claim for the prefixes is that subject agreement lies farther from the stem than the tense and aspect prefix, which holds; but the object marker lies inside it, so the prefix order read stem-outward is not sorted by the hierarchy.

                      The paper's claim for Japanese: no tense, aspect or mood suffix lies closer to the stem than a valence or voice suffix.

                      The Japanese suffix order is nonetheless not sorted by the hierarchy: [Byb85]'s survey ranks tense closer to the stem than mood, Bybee1985.SurveyedCloser, and the desiderative, a mood suffix, precedes the final inflection, read as tense. The paper claims no order of mood and tense.