Hide menu

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

Marco Kuhlmann. Linköping: Cubic-Time Graph Parsing with a Simple Scoring Scheme. In Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval 2014), pages 395–399, Dublin, Republic of Ireland, 2014.

Abstract

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 algorithm into a data-driven parser, we combine it with an edge-factored feature model and online learning. We report and discuss results on the SemEval-2014 Task 8 data sets (Oepen et al., 2014).

Links


Page responsible: Marco Kuhlmann
Last updated: 2017-09-25