w n and label set R the following holds: The vertex −1 denotes a virtual root.
the arc set A represents the labeled dependency relations of the particular analysis G. an arc (w i , w j , r) ∈ A represents a dependency relation from head w i to dependent w j labeled with relation type r. A dependency graph G is thus a set of labeled dependency relations between the words of x.