Documentation

Linglib.Morphology.DistributedMorphology.Gender

Gender on the nominal categorizer #

This file defines the gender features of the nominal categorizer n in Distributed Morphology. A gender feature is a binary dimension such as [±FEM] with a sign, and it is interpretable for natural gender and uninterpretable for arbitrary gender. A categorizing head may also bear the selectional feature {D}, which licenses an inalienable possessor.

Agreement in gender is a probe relativized to gender, searching the heads of a nominal from the top; when it finds none, Agree fails and the default gender is spelled out. When several n's are stacked, Kramer's Highest Gender Hypothesis makes the gender of the highest n the agreeing gender. Kramer derives it from cyclicity: each n is a cyclic head that sends the nPs below it to spell-out, so the probe searches the last cycle of the word alone. A plain highest n then leaves the default gender, where a probe searching every n would find the gender of a lower one, and a diminutive that is not an n, bearing no gender, leaves the gender of the n below it.

Main definitions #

Main results #

References #

Gender features #

A binary gender dimension.

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

      The sign of a binary feature.

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

          A valued gender feature is a dimension with a sign, as in [+FEM], [−FEM] and [+ANIM].

          Instances For
            def DistributedMorphology.instDecidableEqGenderValue.decEq (x✝ x✝¹ : GenderValue) :
            Decidable (x✝ = x✝¹)
            Equations
            Instances For
              Equations
              • One or more equations did not get rendered due to their size.
              Instances For
                @[instance_reducible]
                Equations
                • One or more equations did not get rendered due to their size.

                A gender value together with its interpretability.

                Instances For
                  def DistributedMorphology.instDecidableEqGenderFeature.decEq (x✝ x✝¹ : GenderFeature) :
                  Decidable (x✝ = x✝¹)
                  Equations
                  • One or more equations did not get rendered due to their size.
                  Instances For
                    Equations
                    • One or more equations did not get rendered due to their size.
                    Instances For

                      Categorizing heads #

                      A categorizing head with its gender feature and the selectional feature {D}, a head of a ComplexHead.

                      • categorizer : Categorizer

                        The categorizer n, v or a.

                      • gender : Option GenderFeature

                        The gender feature, if any.

                      • selectsD : Bool

                        The selectional feature {D}.

                      Instances For
                        def DistributedMorphology.Categorizer.instDecidableEqHead.decEq (x✝ x✝¹ : Head) :
                        Decidable (x✝ = x✝¹)
                        Equations
                        • One or more equations did not get rendered due to their size.
                        Instances For
                          Equations
                          • One or more equations did not get rendered due to their size.
                          Instances For

                            The n bearing the gender feature of interpretability interp and value v.

                            Equations
                            Instances For

                              The n bearing interpretable [+FEM], the natural feminine.

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

                                The n bearing interpretable [−FEM], the natural masculine.

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

                                  The n bearing uninterpretable [+FEM], the arbitrary feminine.

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

                                    The n bearing uninterpretable [+ANIM], the nominalizer of Teop body-part roots.

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

                                      Agreement in gender #

                                      def DistributedMorphology.genderProbe {H : Type u_2} {G : Type u_3} (gender : H → Option G) :

                                      The probe for gender, relativized to the heads that bear one.

                                      Equations
                                      Instances For
                                        def DistributedMorphology.agreeingGender {H : Type u_2} {G : Type u_3} (gender : H → Option G) (default : G) (goals : List H) :
                                        G

                                        The gender a gender probe agrees in when it searches goals, nearest first, or default when Agree fails.

                                        Equations
                                        Instances For
                                          @[simp]
                                          theorem DistributedMorphology.agreeingGender_nil {H : Type u_2} {G : Type u_3} {gender : H → Option G} {default : G} :
                                          agreeingGender gender default [] = default
                                          theorem DistributedMorphology.agreeingGender_cons_of_eq_some {H : Type u_2} {G : Type u_3} {gender : H → Option G} {default : G} {h : H} {hs : List H} {g : G} (hg : gender h = some g) :
                                          agreeingGender gender default (h :: hs) = g
                                          theorem DistributedMorphology.agreeingGender_cons_of_eq_none {H : Type u_2} {G : Type u_3} {gender : H → Option G} {default : G} {h : H} {hs : List H} (hh : gender h = none) :
                                          agreeingGender gender default (h :: hs) = agreeingGender gender default hs
                                          theorem DistributedMorphology.agreeingGender_singleton {H : Type u_2} {G : Type u_3} {gender : H → Option G} {default : G} {h : H} :
                                          agreeingGender gender default [h] = (gender h).getD default
                                          theorem DistributedMorphology.agreeingGender_append_of_forall_eq_none {H : Type u_2} {G : Type u_3} {gender : H → Option G} {default : G} {l l' : List H} (hl : ∀ a ∈ l, gender a = none) :
                                          agreeingGender gender default (l ++ l') = agreeingGender gender default l'

                                          Heads bearing no gender are invisible to the probe.

                                          theorem DistributedMorphology.agreeingGender_lastCycle {R : Type u_1} {H : Type u_2} {G : Type u_3} {gender : H → Option G} {default : G} {h : H} {hs : List H} {cyclic : H → Prop} [DecidablePred cyclic] {r : R} {above : List H} (hc : cyclic h) (ha : ∀ a ∈ above, ¬cyclic a ∧ gender a = none) :
                                          agreeingGender gender default ({ root := r, heads := hs ++ h :: above }.lastCycle cyclic) = (gender h).getD default

                                          The Highest Gender Hypothesis. A probe above a word whose highest cyclic head is h, with only noncyclic heads bearing no gender over it, agrees in the gender h gives alone.

                                          theorem DistributedMorphology.agreeingGender_lastCycle_plain {R : Type u_1} {H : Type u_2} {G : Type u_3} {gender : H → Option G} {default : G} {h h' : H} {hs : List H} {g : G} {cyclic : H → Prop} [DecidablePred cyclic] {r : R} (hc : cyclic h) (hh : gender h = none) (hg : gender h' = some g) :
                                          agreeingGender gender default ({ root := r, heads := hs ++ [h', h] }.lastCycle cyclic) = default ∧ agreeingGender gender default (hs ++ [h', h]).reverse = g

                                          A plain highest n over an n of gender g gives the default, where a probe searching every head would find g.