pith. sign in

arxiv: 1704.05550 · v1 · pith:IMYUL2CTnew · submitted 2017-04-18 · 💻 cs.CL · cs.IR

Extractive Summarization: Limits, Compression, Generalized Model and Heuristics

classification 💻 cs.CL cs.IR
keywords summarizationextractiveversusexistinglimitsmodelmulti-documentsingle
0
0 comments X
read the original abstract

Due to its promise to alleviate information overload, text summarization has attracted the attention of many researchers. However, it has remained a serious challenge. Here, we first prove empirical limits on the recall (and F1-scores) of extractive summarizers on the DUC datasets under ROUGE evaluation for both the single-document and multi-document summarization tasks. Next we define the concept of compressibility of a document and present a new model of summarization, which generalizes existing models in the literature and integrates several dimensions of the summarization, viz., abstractive versus extractive, single versus multi-document, and syntactic versus semantic. Finally, we examine some new and existing single-document summarization algorithms in a single framework and compare with state of the art summarizers on DUC data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.