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