Optimizing for dependency arc length is particularly important as parsers tend to do worse on longer dependencies ( McDonald and Nivre , 2007 ) and these dependencies are typically the most meaningful for downstream tasks , e.g. , main verb dependencies for tasks
characterizing the errors of datadriven dependency parsing models
R McDonald J Nivre
The labeled version of this score requires that the labels of the arc are also correct . Optimizing for dependency arc length is particularly important as parsers tend to do worse on longer dependencies ( McDonald and Nivre , 2007 ) and these dependencies are typically the most meaningful for downstream tasks , e.g. , main verb dependencies for tasks 2For the graph-based parser one can also find the higest scoring tree with correct root by setting the score of all competing arcs to â â .
Optimizing for dependency arc length is particularly important as parsers tend to do worse on longer dependencies ( @@CITATION ) and these dependencies are typically the most meaningful for downstream tasks , e.g. , main verb dependencies for tasks