Sergej V. Znamenskij, “Simple essential improvements to the ROUGE-W algorithm”, J. Sib. Fed. Univ. Math. Phys., 2015, Volume 8, Issue 4,Pages <nobr>497

This article is cited in 2 papers

Simple essential improvements to the ROUGE-W algorithm

Sergej V. Znamenskij

Ailamazyan Program Systems Institute of RAS, Peter the First Street, 4, Veskovo village, Pereslavl area, Yaroslavl region, 152021, Russia

Abstract: The ROUGE-W algorithm to calculate the similarity of texts is referred in more than 500 scientific publications since 2004. The power of the algorithm depends on the weight function choice. An optimal selection of the weight function is studied. The weight functions used previously are far from optimality. An example of incorrect output of the algorithm is provided. Simple changes are described to ensure the expected result.

Keywords: sequence alignment, longest common subsequence, ROUGE-W, edit distance, string similarity, optimization, complexity bounds.

UDC: 519.686

Received: 10.10.2015
Received in revised form: 01.11.2015
Accepted: 16.11.2015

Language: English

DOI: 10.17516/1997-1397-2015-8-4-497-501