Learning to Search for Dependencies
Table 3: UAS and LAS on PTB and CoNLL-X. The average score over all languages is shown in the last column. The best scores for each language is bolded.  makes assumptions about the structure of languages and hence obtains substantially worse performance on languages with multi-root trees (marked with ∗). Excluding these languages, achieves 85.6 (UAS) and 81.8 (LAS) in average, while achieves 88.5 and 84.3.
['Parser', 'Ar', 'Bu', 'Ch', 'Da', 'Du', 'En', 'Ja', 'Po', 'Sl', 'Sw', 'Avg']
Punctuation is excluded in all evaluations. Our parser achieves up to 4% improvement on both UAS and LAS. Compared with \dn, our parser has the same transition system and oracle but more powerful base learners to choose from. Compared with \nn, we use much fewer hidden units and parameters to tune.