W06-1633 classification . In ex - periments , the graph cutting algorithm for coreference resolution
D13-1041 Hoffart et al. , 2011 ) use a greedy graph cutting algorithm that iteratively remove
D13-1041 Han et al. , 2011 ) and greedy graph cutting ( Hoffart et al. , 2011 ) have
W06-1633 clusterization is produced as a graph cutting algorithm , in which nodes of
hide detail