REVIEW 3 cited by
Efficient Summarization with Read-Again and Copy Mechanism
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
Signed reviews
read the original abstract
Encoder-decoder models have been widely used to solve sequence to sequence prediction tasks. However current approaches suffer from two shortcomings. First, the encoders compute a representation of each word taking into account only the history of the words it has read so far, yielding suboptimal representations. Second, current decoders utilize large vocabularies in order to minimize the problem of unknown words, resulting in slow decoding times. In this paper we address both shortcomings. Towards this goal, we first introduce a simple mechanism that first reads the input sequence before committing to a representation of each word. Furthermore, we propose a simple copy mechanism that is able to exploit very small vocabularies and handle out-of-vocabulary words. We demonstrate the effectiveness of our approach on the Gigaword dataset and DUC competition outperforming the state-of-the-art.
Forward citations
Cited by 3 Pith papers
-
Topic Augmented Generator for Abstractive Summarization
Conditioning an abstractive summarization decoder on a document's LDA topic vector as a third mixture component yields modest ROUGE gains over the authors' pointer-generator baseline.
-
Repurposing Decoder-Transformer Language Models for Abstractive Summarization
Finetuning a pretrained decoder-only transformer with a plain language-modeling objective yields competitive ROUGE-1 and ROUGE-2 scores on CNN/DailyMail and XSum without sequence-to-sequence components or beam search.
-
A Split-then-Join Approach to Abstractive Summarization for Very Long Documents in a Low Resource Setting
On arXiv and BigPatent documents longer than 20,000 tokens, the SPIN 3 variant, which splits documents into 4,096-token chunks and selects the best chunk summary by ROUGE-L, improves ROUGE scores over a truncated BIGB...
Discussion (0). Continue with ORCID to comment.