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,
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.
sequence alignment, longest common subsequence, ROUGE-W, edit distance, string similarity, optimization, complexity bounds.
|Ministry of Education and Science of the Russian Federation
|This work was performed under financial support from the Government, represented by the Ministry of Education and Science of the Russian Federation (Project ID RFMEFI60414X0138); also it was partly supported by a research grant No. 14.Y26.31.0004 from the Government of the Russian Federation.
PDF file (101 kB)
Received in revised form: 01.11.2015
Sergej V. Znamenskij, “Simple essential improvements to the ROUGE-W algorithm”, J. Sib. Fed. Univ. Math. Phys., 8:4 (2015), 497–501
Citation in format AMSBIB
\paper Simple essential improvements to the ROUGE-W algorithm
\jour J. Sib. Fed. Univ. Math. Phys.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|