In plain words: It learns to shorten sentences without matched pairs by inventing practice pairs: it guesses short versions, then trains to expand them back. Mixing several guesses beat the best unsupervised summarizer by over 2 points on a summary score, matching systems with some paired data.
Abstract
Back-translation based approaches have recently lead to significant progress in unsupervised sequence-to-sequence tasks such as machine translation or style transfer. In this work, we extend the paradigm to the problem of learning a sentence summarization system from unaligned data. We present several initial models which rely on the asymmetrical nature of the task to perform the first back-translation step, and demonstrate the value of combining the data created by these diverse initialization methods. Our system outperforms the current state-of-the-art for unsupervised sentence summarization from fully unaligned data by over 2 ROUGE, and matches the performance of recent semi-supervised approaches.
Yacine Jernite
arXiv:1908.08566 · cs.CL · submitted Aug 22, 2019
abstract · pdf · html