Text summarization as controlled search

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

Abstract

We present a framework for text summarization based on the generate-and-test model. A large set of summaries is generated for all plausible values of six parameters that control a three-stage process that includes segmentation and keyphrase extraction, and a number of features that characterize the document. Quality is assessed by measuring the summaries against the abstract of the summarized document. The large number of summaries produced for our corpus dictates automated validation and fine-tuning of the summary generator. We use supervised machine learning to detect good and bad parameters. In particular, we identify parameters and ranges of their values within which the summary generator might be used with high reliability on documents for which no author’s abstract exists.

Cite

CITATION STYLE

APA

Copeck, T., Japkowicz, N., & Szpakowicz, S. (2002). Text summarization as controlled search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2338, pp. 268–280). Springer Verlag. https://doi.org/10.1007/3-540-47922-8_22

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