Docs / Morphology / ConstructionMorphology / Schema

Constructional schemas

import Linglib.Morphology.ConstructionMorphology.Schema · namespace ConstructionMorphology

This file defines the schemas of Construction Morphology and Relational Morphology, which are lexical entries with variables. A schema assigns each slot a value in a partial order with a bottom ⊥. A slot above ⊥ is a constant and a slot at ⊥ is a variable, open if the schema marks it and closed otherwise. An item instantiates a schema if it lies above the schema's description at every slot.

Unification is the partial join of descriptions and Structural Intersection is their meet. The instances of a successful unification are the common instances of its arguments, and the intersection of two items instantiates exactly the schemas that both instantiate. Among descriptions over the same slots it is their least general generalization in Plotkin's sense, which Jackendoff and Audring compare to Albright and Hayes's minimal generalization. It does not recover coindexation: the intersection of $aa$ and $bb$ is two unrelated variables, where Plotkin's generalization is one variable twice. Coindexation is stated by ConstructionMorphology.Pattern, whose meet is that generalization.

Over a lexicon of stored items, a schema relates the stored items that instantiate it and generates the instances whose closed variables take fillers attested among those stored items, so it relates exactly the stored items it generates. A schema is productive if it has no closed variable, which holds exactly when it generates its own description over the empty lexicon.

Main definitions

  • Schema: A schema is a slot-indexed description with a set of variables marked open.
  • Schema.Instantiates: An item lies above a schema's description at every slot.
  • Schema.Relates: A schema relates a stored item that instantiates it.
  • Schema.Generates: A schema generates an instance whose closed variables take attested fillers.
  • Schema.IsProductive: A schema has no closed variable.
  • Instantiation: Two items agree except at some slots, where the second is strictly above.
  • Contrast: Two items agree except at some slots, where they are incompatible.

Implementation notes

Openness is marked on variables rather than on a schema as a whole, following Jackendoff and Audring. Only a variable can be marked open, so a schema is determined by its description and its open variables. The items a schema generates form a product of slotwise filler sets, so a schema with two closed variables generates unstored combinations of attested fillers. The toponym and idiom schemas that motivate closed variables have one each.

References

Declarations

A schema is a slot-indexed description body together with a set opens of variables marked open, where a slot at ⊥ is a variable and a slot above ⊥ is a constant.

structure SchemaL73–82
(V : Type u_5) (α : Type u_6) [Bot α] :
Type (max u_5 u_6)
  • body : V → α

    The slot-indexed description.

  • opens : Set V

    The variables marked open.

  • opens_subset : self.opens ⊆ {v : V | self.body v = ⊥}

    Only variables are marked open.

Used by Schema.vars, Schema.closed, Schema.mem_vars, Schema.mem_closed, Schema.productive, Schema.nonproductive, Schema.comap, Schema.comap_body, Schema.comap_opens, Schema.comap_id, Schema.comap_comp, Schema.closed_comap, Schema.IsProductive, Schema.isProductive_iff_opens_eq, Schema.Instantiates, Schema.instantiates_iff, Schema.decidablePredInstantiates, Schema.instantiates_body, Schema.Instantiates.trans_le, Schema.instantiates_iff_eq_of_forall_isMax, Schema.body_le_body_iff, Schema.instantiates_iff_unify, Schema.instantiates_iff_of_unify_eq_coe, Schema.instantiates_inf_iff, Schema.generalityOrder, Schema.decidableLEGeneralityOrder, Schema.Relates, Schema.Relates.instantiates, Schema.Relates.mono, Schema.Instantiates.relates_insert, Schema.attested, Schema.mem_attested, Schema.Relates.apply_mem_attested, Schema.attested_mono, Schema.Generates, Schema.Generates.instantiates, Schema.fillers, Schema.generates_iff_mem_pi, Schema.Relates.generates, Schema.relates_iff_mem_and_generates, Schema.Generates.relates_insert, Schema.Generates.mono, Schema.IsProductive.generates_iff, Schema.isProductive_iff_generates_empty, Schema.isProductive_iff_forall_generates_iff, Schema.generates_iff_eq_of_forall_ne_bot, Instantiation.instantiates

Used in Audring2019, Booij2010, Bybee1995, JackendoffAudring2020

Variables, constructors and pullback

L97
L99
L107
L109–111
L113
L115
L117–118
L120–122
L137
L143–145
L147–149

Instantiation

An item w instantiates the schema s if w lies above the description of s at every slot.

def Schema.InstantiatesL167–169
{V : Type u_1} {α : Type u_4} [PartialOrder α] [OrderBot α] (s : Schema V α) (w : V → α) :

Built from

Used by Schema.instantiates_iff, Schema.decidablePredInstantiates, Schema.instantiates_body, Schema.Instantiates.trans_le, Schema.instantiates_iff_eq_of_forall_isMax, Schema.body_le_body_iff, Schema.instantiates_iff_unify, Schema.instantiates_iff_of_unify_eq_coe, Schema.instantiates_inf_iff, Schema.Relates, Schema.Relates.instantiates, Schema.Instantiates.relates_insert, Schema.Generates, Schema.Generates.instantiates, Schema.IsProductive.generates_iff, Schema.isProductive_iff_forall_generates_iff, Instantiation.instantiates

Used in Booij2010, Bybee1995, JackendoffAudring2020

L171
L177
L179–181
L183–185

Unification and Structural Intersection

L199–202

The generality order of a family

L223–228

The relational and the generative role

A schema s relates w over the lexicon Λ if w is stored in Λ and instantiates s.

def Schema.RelatesL244–246
{V : Type u_1} {α : Type u_4} [PartialOrder α] [OrderBot α] (s : Schema V α) (Λ : Set (V → α)) (w : V → α) :

Built from ,

Used by Schema.Relates.instantiates, Schema.Relates.mono, Schema.Instantiates.relates_insert, Schema.attested, Schema.mem_attested, Schema.Relates.apply_mem_attested, Schema.Relates.generates, Schema.relates_iff_mem_and_generates, Schema.Generates.relates_insert

Used in Audring2019, Booij2010

L248
L250
L252–253
L260–262
L264–265
L267–268

A schema s generates w over the lexicon Λ if w instantiates s and fills each closed variable of s with a filler attested in Λ. The item w need not be stored.

def Schema.GeneratesL270–273
{V : Type u_1} {α : Type u_4} [PartialOrder α] [OrderBot α] (s : Schema V α) (Λ : Set (V → α)) (w : V → α) :

Built from , , ,

Used by Schema.Generates.instantiates, Schema.generates_iff_mem_pi, Schema.Relates.generates, Schema.relates_iff_mem_and_generates, Schema.Generates.relates_insert, Schema.Generates.mono, Schema.IsProductive.generates_iff, Schema.isProductive_iff_generates_empty, Schema.isProductive_iff_forall_generates_iff, Schema.generates_iff_eq_of_forall_ne_bot

Used in Audring2019, Booij2010, JackendoffAudring2020

L275
L277–280
L282–285
L287–288
L294–295
L297–298
L300–302
L310–314
L316–322