Automatic extractive single document summarization An unsupervised approach
Examensarbete för masterexamen
This thesis describes the implementation and evaluation of a system for automatic, extractive single document summarization. Three different unsupervised algorithms for sentence relevance ranking are evaluated to form the basis of this system. The first is the well established, graph based TextRank, the second is based on K-means clustering and the third on one-class support vector machines (SVM). Further more, several different variations of the original approaches are evaluated. These algorithms are, in themselves, language independent, but language dependent text preprocessing is needed to use them in this setting. Evaluations of the system, using the de facto standard ROUGE evaluation toolkit, shows that TextRank obtains the best score. The K-means approach gives competitive results, beating the predefined baselines on the main test corpus. The one-class SVM yields the worst performance of the three, but still manage to beat one of two baselines. The system is evaluated for both English and Swedish, however, the main evaluation is done for short news articles in English. In our opinion this system, together with domain specific boosting provides adequate results for the corpora tested.
Data- och informationsvetenskap , Computer and Information Science