2006 BestCutAGraphAlgorithmforCorefe

• (Nicolae & Nicolae, 2006) ⇒ Cristina Nicolae, and Gabriel Nicolae. (2006). “BestCut: A Graph Algorithm for Coreference Resolution.” In: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing. ISBN:1-932432-73-6

Subject Headings: Coreference Resolution Algorithm; Coreference Resolution Task; Coreference Resolution System, Bestcut Alogrithm.

Cited By

• http://scholar.google.com/scholar?q=%222006%22+BestCut%3A+A+Graph+Algorithm+for+Coreference+Resolution
• http://dl.acm.org/citation.cfm?id=1610075.1610115&preflayout=flat#citedby

Quotes

Abstract

In this paper we describe a coreference resolution method that employs a classification 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 mentions of the text, whereas the edges of the graph constitute the confidences derived from the coreference classification. In experiments, the graph cutting algorithm for coreference resolution, called BestCut, achieves state-of-the-art performance.

References

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2006 BestCutAGraphAlgorithmforCorefe	Cristina Nicolae Gabriel Nicolae			BestCut: A Graph Algorithm for Coreference Resolution						2006