Pith. sign in

REVIEW

Systematically Exploring Redundancy Reduction in Summarizing Long Documents

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.00052 v1 pith:VFVJESTS submitted 2020-11-30 cs.CL

classification cs.CL
keywords redundancydocumentslongmethodssummarizingwhencategoriesdatasets
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Our analysis of large summarization datasets indicates that redundancy is a very serious problem when summarizing long documents. Yet, redundancy reduction has not been thoroughly investigated in neural summarization. In this work, we systematically explore and compare different ways to deal with redundancy when summarizing long documents. Specifically, we organize the existing methods into categories based on when and how the redundancy is considered. Then, in the context of these categories, we propose three additional methods balancing non-redundancy and importance in a general and flexible way. In a series of experiments, we show that our proposed methods achieve the state-of-the-art with respect to ROUGE scores on two scientific paper datasets, Pubmed and arXiv, while reducing redundancy significantly.

Discussion (0). Continue with ORCID to comment.

Pith tools