Also, despite the fact that the graph-based MST-Parser achieves a similar result to ours on PTB (CoNLL dependencies), our parser is nearly 100 times faster.
our transition-based parser has a great advantage in LAS, especially for the fine-grained label set of Stanford dependencies.