For German, we obtain 89.05 LAS and 97.78 POS, which in both cases is substantially better than in the CoNLL shared task.
one final thing to note about the inference algorithm is that the notion of permissibility for a transition t out of a configuration c can be used to capture not only formal constraints on transitions -such as the fact that it is impossible to perform a SHIFT p transition with an empty buffer or illegal to perform a LEFT-ARC d transition with the special root node on top of the stack -but also to filter out unlike-ly dependency labels or tags.