Variations of the Similarity Function of TextRank for Automated Summarization
2016-02-11Code Available0· sign in to hype
Federico Barrios, Federico López, Luis Argerich, Rosa Wachenchauzer
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/summanlp/textrankOfficialIn papernone★ 0
- github.com/WilliamKulp/textranknone★ 0
- github.com/jaumeCloquellCapo/text-summaritzation-textRanknone★ 0
- github.com/ernestyalumni/MLgrabbagtf★ 0
- github.com/chalothon/textRanknone★ 0
- github.com/ceshine/textrank_summary_benchmarktf★ 0
- github.com/thesohelshaikh/text-summarizernone★ 0
- github.com/rsreetech/TextSummarizationnone★ 0
- github.com/hermesfeet/summarize_texttf★ 0
- github.com/shivampanjeta/text-summarizernone★ 0
Abstract
This article presents new alternatives to the similarity function for the TextRank algorithm for automatic summarization of texts. We describe the generalities of the algorithm and the different functions we propose. Some of these variants achieve a significative improvement using the same metrics and dataset as the original publication.