Paper: BESTCUT: A Graph Algorithm For Coreference Resolution

ACL ID W06-1633
Title BESTCUT: A Graph Algorithm For Coreference Resolution
Venue Conference on Empirical Methods in Natural Language Processing
Session Main Conference
Year 2006
Authors

In this paper we describe a coreference resolution method that employs a classi- fication and a clusterization phase. In a novel way, the clusterization is produced as a graph cutting algorithm, in which nodes of the graph correspond to the men- tions of the text, whereas the edges of the graph constitute the confidences derived from the coreference classification. In ex- periments, the graph cutting algorithm for coreference resolution, called BESTCUT, achieves state-of-the-art performance.