Generating text summaries through the relative importance of topics

32Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This work proposes a new extractive text-summarization algorithm based on the importance of the topics contained in a document. The basic ideas of the proposed algorithm are as follows. At first the document is partitioned by using the TextTiling algorithm, which identifies topics (coherent segments of text) based on the TF-IDF metric. Then for each topic the algorithm computes a measure of its relative relevance in the document. This measure is computed by using the notion of TF-ISF (Term Frequency - Inverse Sentence Frequency), which is our adaptation of the well-known TF-IDF (Term Frequency - Inverse Document Frequency) measure in information retrieval. Finally, the summary is generated by selecting from each topic a number of sentences proportional to the importance of that topic. © Springer-Verlag 2000.

Cite

CITATION STYLE

APA

Larocca Neto, J., Santos, A. D., Kaestner, C. A. A., & Freitas, A. A. (2000). Generating text summaries through the relative importance of topics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1952 LNAI, pp. 300–309). Springer Verlag. https://doi.org/10.1007/3-540-44399-1_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free