Maximum Spanning Tree Algorithm
method
ID: maximumspanningtreealgorithm
Related Papers
Maximum Spanning Tree Algorithm for Non-projective Labeled Dependency Parsing
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 …...
Dependency Parsing as Head Selection
AbstractConventional graph-based dependency parsers guarantee a tree structure both during training and inference. Instead, we formalize dependency parsing as the problem of independently selecting the head of each word in …...