An improved oracle for dependency parsing with online reordering

Joakim Nivre, Marco Kuhlmann, Johan Hall · 2009

We present an improved training strategy for dependency parsers that use online reordering to handle non-projective trees. The new strategy improves both efficiency and accuracy by reducing the number of swap operations performed on non-projective trees by up to 80%. We present state-of-the-art results for five languages with the best ever reported results for Czech.

Read the paper · More papers on PaperTik