Docs / Syntax / Minimalist / Copy / ToTree

The tree of a reading

import Linglib.Syntax.Minimalist.Copy.ToTree

Source

This file sends a reading of a marked object to the constituency tree that the type-driven composition engine interprets. A chain read high gets a binder under its higher copy, and its lower copies become the traces that binder binds. With binders aside the tree is the tree of the object the reading gives, and with no lower copy the tree the object has as a linearized object.

Implementation notes

  • A lower copy that is itself the higher copy of a lower one, at an intermediate site of a chain read high, gets a trace and a binder, [t [λ …]], which denotes what its second daughter does.
  • A trace and its binder share the index of the mark, so a chain with no head has the index-free trace, which no binder binds, as LinearizedSyntacticObject.toTree promises. A head and a phrase it projects share an index, and capture each other if the head leaves the phrase and the phrase then moves above the head.
  • A remnant read high, with a chain that moved out of it also read high, leaves a free trace and a vacuous binder. PhraseStructure.Tree.Closed tells such a reading from one the engine can close.
  • Marcolli, Chomsky and Berwick apply their quotients to the lower copy. Deleting the higher copy is their deletion quotient applied to the copy object at the other occurrence, which they do not do (Marked.mem_cutSummandsDN_lf); it is the reading of Collins's work on the passive and on reconstruction.
  • Binding at a reading is not in general binding at the copy object: an object that moves from itself, read low, comes to c-command the sister of its movement node. The reading carrying is the one that does agree with it (Derivation.bindsAtReading_carrying_iff).

References

Declarations

L76–82

Trees and objects

L152–155