CoNLL 2006 ортақ тапсырмасы

Following (McDonald et al., 2005), we present an application of a maximum spanning tree algorithm for a directed graph to non-projective labeled depen- dency parsing. Using a variant of the …...

We develop a novel bi-directional attention model for dependency parsing, which learns to agree on headword predictions from the for- ward and backward parsing directions. The parsing procedure for each …...