Linköping: Cubic-Time Graph Parsing with a Simple Scoring Scheme
Marco Kuhlmann · 2014
We turn the Eisner algorithm for parsing to projective dependency trees into a cubic-time algorithm for parsing to a restricted class of directed graphs. To extend the algo-rithm into a data-driven parser, we combine it with an edge-factored feature model and online learning. We report and discuss re-sults on the SemEval-2014 Task 8 data sets (Oepen et al., 2014). 1