We characterize these matrix clauses with their dependents as directed trees τ (with direction from parent to daughter nodes/clauses).
a clause will be represented by a node with out-degree equal to the number of embedded dependencies hosted by the clause.