dc.creatorBarrios, Federico
dc.creatorLópez, Federico
dc.creatorArgerich, Luis
dc.creatorWachenchauzer, Rosita
dc.date2015-08
dc.date2015
dc.date2016-04-06T15:55:46Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/52082
dc.identifierhttp://44jaiio.sadio.org.ar/sites/default/files/asai65-72.pdf
dc.identifierissn:2451-7585
dc.descriptionThis article presents new alternatives to the similarity function for the TextRank algorithm for automated 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.
dc.descriptionSociedad Argentina de Informática e Investigación Operativa (SADIO)
dc.formatapplication/pdf
dc.format65-72
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-sa/3.0/
dc.rightsCreative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)
dc.subjectCiencias Informáticas
dc.subjectInformation Search and Retrieval
dc.subjectranking functions
dc.titleVariations of the Similarity Function of TextRank for Automated Summarization
dc.typeObjeto de conferencia
dc.typeObjeto de conferencia


Este ítem pertenece a la siguiente institución