Variations of the Similarity Function of TextRank for Automated Summarization
This 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...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2015
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/52082 http://44jaiio.sadio.org.ar/sites/default/files/asai65-72.pdf |
| Aporte de: |
| Sumario: | This 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. |
|---|