So far, the presented system, which follows closely the approach of <cite>McDonald et al. (2005)</cite> , only predicts unlabelled dependency trees. To derive a labeling, we departed from their approach: We split each feature along the deprel label dimension, so that each deprel U is associated with its own feature vector (cf. eq. (4), where V is the tensor product and In parsing, we only consider the best deprel label.