Linköping: Cubic-Time Graph Parsing with a Simple Scoring Scheme
2014 (English)In: Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval 2014), Association for Computational Linguistics, 2014, 395-399 p.Conference paper (Refereed)
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).
Place, publisher, year, edition, pages
Association for Computational Linguistics, 2014. 395-399 p.
Language Technology (Computational Linguistics)
IdentifiersURN: urn:nbn:se:liu:diva-114366ISBN: 978-1-941643-24-2OAI: oai:DiVA.org:liu-114366DiVA: diva2:789565
8th International Workshop on Semantic Evaluation (SemEval 2014)