On the effect of stemming algorithms on extractive summarization: a case study

Authors:
Eleni Galiotou;Nikitas Karanikolas;Christodoulos Tsoulloftas
Affiliations:
Technological Educational Institute of Athens, Athens, Greece;Technological Educational Institute of Athens, Athens, Greece;Technological Educational Institute of Athens, Athens, Greece
Venue:
Proceedings of the 17th Panhellenic Conference on Informatics
Year:
2013

Citing 5
Cited 0

New Methods in Automatic Extracting

Journal of the ACM (JACM)
Term-weighting for summarization of multi-party spoken dialogues

MLMI'07 Proceedings of the 4th international conference on Machine learning for multimodal interaction
A parametric methodology for text classification

Journal of Information Science
A software tool for building a statistical prefix processor

Proceedings of the Fifth Balkan Conference in Informatics
A Workbench for Extractive Summarizing Methods

PCI '12 Proceedings of the 2012 16th Panhellenic Conference on Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss the efficiency of stemming algorithms and their contribution to the improvement of shallow summarization methods. We describe a benchmarking experiment on the use of two stemming algorithms and two different sets of stopwords in combination with two approaches to extractive summarization in Greek texts. The results of our experimentation show the limits of extractive summarization and stemming algorithms.