Графқа негізделген тәуелділік талдаушылары

Graph-based dependency parsers suffer from the sheer number of higher order edges they need to (a) score and (b) consider during opti- mization. Here we show that when working with …...

We introduce two first-order graph-based de- pendency parsers achieving a new state of the art. The first is a consensus parser built from an ensemble of independently trained greedy LSTM …...