Paper: Linköping: Cubic-Time Graph Parsing with a Simple Scoring Scheme

ACL ID S14-2068
Title Linköping: Cubic-Time Graph Parsing with a Simple Scoring Scheme
Venue Joint Conference on Lexical and Computational Semantics
Session
Year 2014
Authors

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).