The derivations an interpreter admits over a bare structure when a leaf may be any of a set
of items: the specification that Interpreter.derivs computes for a lexicon of lists.
The definition is too large to print here; read it in the source.
Docs / Semantics / Composition / Readings
import Linglib.Semantics.Composition.Readings
A word may have infinitely many items, as a coordinator has one at every conjoinable type. The derivations an interpreter admits over a structure are then a set, which says what the search over a lexicon of lists is to find, and it finds exactly those. The readings of a structure are the values of these derivations.
The derivations an interpreter admits over a bare structure when a leaf may be any of a set
of items: the specification that Interpreter.derivs computes for a lexicon of lists.
The definition is too large to print here; read it in the source.
The derivations an interpreter finds are sound and complete: they are the derivations it admits.
Built from
The readings of a bare structure when a leaf may be any of a set of items: the values of the derivations over it.
Built from
Used by Interpreter.mem_values_iff, Interpreter.readings_leaf, Interpreter.mem_readings_unary, Interpreter.mem_readings_binary, PhraseStructure.Tree.readings
The values an interpreter finds are the readings, for a lexicon of lists.
Built from
Built from
A reading of a unary node is the value of a rule the node admits, at a reading of its daughter.
Built from
A reading of a binary node is the value of a rule the node admits, at readings of its daughters.
Built from
The values of a tree when a word or a trace may be any of a set of items.
Built from
Used by PhraseStructure.Tree.readings_terminal, PhraseStructure.Tree.readings_trace, PhraseStructure.Tree.mem_readings_bind, PhraseStructure.Tree.mem_readings_phrase_binary, PhraseStructure.Tree.mem_readings_typeDriven_phrase_binary
A word's readings are the values of the items it may be.
Built from
A trace's readings are the values of the items its index may be.
Built from
A reading of a binder is the value of a rule its index admits, at a reading of its body.
Built from
A reading of a binary node is the value of a rule the node admits, at readings of its daughters.
Built from
Under the type-driven interpreter, a reading of a binary node is the value of a rule of the grammar at readings of its daughters.
Built from