The communicative tree T c of a sentence c is a set of nodes, with V t = 0, ..., n as a set of terminal nodes and V c = o , 1 , ..., m as a set of non-terminal communicative (label) nodes; E ⊆ V × V is a set of edges; L is the set of communicative labels (in the case of thematicity: SP, T, R and P); δ : E → L is a labeling function for nodes; 0 is the root node.
we interprete the T c as a kind of constituency tree.