Docs / Semantics / Composition / Constituency

The bare structure of a constituency tree

import Linglib.Semantics.Composition.Constituency · namespace PhraseStructure.Tree

A constituency tree gives the semantics its words in their constituency and order, the indices of its moved phrases, and which of its nodes are islands. A terminal is a leaf, a trace a leaf that is its index, a binder the index over its body, a non-branching node its daughter, and a binary node a plain node or, at a category that is an island, an island.

Main definitions

References

Declarations

The derivations of a tree that an interpreter admits, given the typed items a word or a trace may be.

def derivsL36–42
{C L T : Type} {G : ManySorted.Language T} {W : T → Type} (I : Interpreter G Interpreter.Node) (lex : L ⊕ ℕ → List ((a : T) × W a)) (t : Tree C L) (island : C → Bool := fun (x : C) => false) :
List ((a : T) × G.Deriv W a)

Used by Uninterpretable, derivs_terminal, derivs_trace, derivs_bind, derivs_phrase_binary, derivs_phrase_unary

Used in Semantics/Composition/Interpret, HeimKratzer1998, Percus2000

The values of the derivations of a tree, for a lexicon of typed items whose values ρ gives.

def valuesL44–49
{C L T : Type} {G : ManySorted.Language T} {W D : T → Type} (I : Interpreter G Interpreter.Node) (M : G.Structure D) (ρ : {a : T} → W a → D a) (lex : L ⊕ ℕ → List ((a : T) × W a)) (t : Tree C L) (island : C → Bool := fun (x : C) => false) :
List ((a : T) × D a)

The definition is too large to print here; read it in the source.

Used by Uninterpretable.values_eq_nil, values_terminal, values_trace, values_bind, values_phrase_binary, values_phrase_unary

Used in Semantics/Composition/Extension, HeimKratzer1998

L51–60

Values of a node from the values of its daughters

L81–85
L87–93
L99–102
L104–108
L110–115

The values of a binary node are those of the rules the node admits for its daughters' types, at the values of its daughters.

@[simp] theorem values_phrase_binaryL117–125
{C L T : Type} {G : ManySorted.Language T} {W D : T → Type} (I : Interpreter G Interpreter.Node) (M : G.Structure D) (ρ : {a : T} → W a → D a) (lex : L ⊕ ℕ → List ((a : T) × W a)) (island : C → Bool) (c : C) (k : PhraseKind) (t₁ t₂ : Tree C L) :
values I M (fun {a : T} => ρ) lex (phrase c k [t₁, t₂]) island = List.flatMap (fun (x : (a : T) × D a) => match x with | ⟨a, x⟩ => List.flatMap (fun (x_1 : (a : T) × D a) => match x_1 with | ⟨b, y⟩ => List.map (fun (x_2 : (u : T) × G.Binary a b u) => match x_2 with | ⟨u, m⟩ => ⟨u, ManySorted.Language.Structure.funMap m (x, y)⟩) (I.binary (if island c = true then Interpreter.Node.island else Interpreter.Node.branch) a b)) (values I M (fun {a : T} => ρ) lex t₂ island)) (values I M (fun {a : T} => ρ) lex t₁ island)

Built from