SemEval 2014 Задача 8

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

Recently, there has been renewed interest in semantic dependency parsing, among which one of the paradigms focuses on parsing di- rected acyclic graphs (DAGs). Considera- tion of the decoding problem …...