Documentation

Linglib.Processing.DiscriminativeLexicon.Measures

DLM-derived semantic-support measures #

The semantic support measures read off a Linear's production map at the FormVec/MeaningVec carriers. The support a form receives from a meaning is the dot product of the predicted form with the target form, ĉ ⬝ᵥ c for ĉ = sG: the entries of [gahl-baayen-2024]'s support matrix T = ĈCᵀ, whose diagonal is their semantic support for form, and at a single triphone [saito-tomaschek-baayen-2025]'s SemSupSuffix.

Main declarations #

References #

Semantic support #

def DiscriminativeLexicon.semSup {n d : } (D : Linear (FormVec n) (MeaningVec d)) (s : MeaningVec d) (j : Fin n) :

Semantic support for form coordinate j from meaning s: the predicted value D.production s j ([saito-tomaschek-baayen-2025]; [gahl-baayen-2024]'s per-triphone support).

Equations
Instances For
    def DiscriminativeLexicon.semSupWord {n d : } (D : Linear (FormVec n) (MeaningVec d)) (s : MeaningVec d) (c : FormVec n) :

    Semantic support for the form vector c from meaning s: the dot product of the predicted form with c. At a word's own binary triphone vector this is [gahl-baayen-2024]'s semantic support for form, the diagonal of T = ĈCᵀ.

    Equations
    Instances For
      @[simp]
      theorem DiscriminativeLexicon.semSupWord_single {n d : } {D : Linear (FormVec n) (MeaningVec d)} (s : MeaningVec d) (j : Fin n) :
      semSupWord D s (Pi.single j 1) = semSup D s j

      Linearity #

      @[simp]
      theorem DiscriminativeLexicon.semSup_add {n d : } {D : Linear (FormVec n) (MeaningVec d)} (s₁ s₂ : MeaningVec d) (j : Fin n) :
      semSup D (s₁ + s₂) j = semSup D s₁ j + semSup D s₂ j
      @[simp]
      theorem DiscriminativeLexicon.semSup_smul {n d : } {D : Linear (FormVec n) (MeaningVec d)} (a : ) (s : MeaningVec d) (j : Fin n) :
      semSup D (a s) j = a * semSup D s j
      @[simp]
      theorem DiscriminativeLexicon.semSup_zero {n d : } {D : Linear (FormVec n) (MeaningVec d)} (j : Fin n) :
      semSup D 0 j = 0
      @[simp]
      theorem DiscriminativeLexicon.semSupWord_add_left {n d : } {D : Linear (FormVec n) (MeaningVec d)} (s₁ s₂ : MeaningVec d) (c : FormVec n) :
      semSupWord D (s₁ + s₂) c = semSupWord D s₁ c + semSupWord D s₂ c
      @[simp]
      theorem DiscriminativeLexicon.semSupWord_smul_left {n d : } {D : Linear (FormVec n) (MeaningVec d)} (a : ) (s : MeaningVec d) (c : FormVec n) :
      semSupWord D (a s) c = a * semSupWord D s c
      @[simp]
      theorem DiscriminativeLexicon.semSupWord_zero_left {n d : } {D : Linear (FormVec n) (MeaningVec d)} (c : FormVec n) :
      semSupWord D 0 c = 0
      @[simp]
      theorem DiscriminativeLexicon.semSupWord_add_right {n d : } {D : Linear (FormVec n) (MeaningVec d)} (s : MeaningVec d) (c₁ c₂ : FormVec n) :
      semSupWord D s (c₁ + c₂) = semSupWord D s c₁ + semSupWord D s c₂
      @[simp]
      theorem DiscriminativeLexicon.semSupWord_smul_right {n d : } {D : Linear (FormVec n) (MeaningVec d)} (a : ) (s : MeaningVec d) (c : FormVec n) :
      semSupWord D s (a c) = a * semSupWord D s c
      @[simp]
      theorem DiscriminativeLexicon.semSupWord_zero_right {n d : } {D : Linear (FormVec n) (MeaningVec d)} (s : MeaningVec d) :
      semSupWord D s 0 = 0