we have: We use standard terminology from graph theory for dependency trees and the relations between their nodes.
for a node u, the set of descendants of u, which we denote by u , is the set of nodes that can be reached from u by following a directed path consisting of zero or more edges.