about
Simple Unsupervised Summarization by Contextual Matching (arxiv.org)
1 point by sel1 on Aug 2, 2019 | hide | past | pdf | discuss on HN

In plain words: A system shortens sentences by scoring rewrites with two language models—one general, one tuned to the topic—keeping output fluent and faithful. It produced promising results on both rewriting and word-picking summarization, without the paired sentence-summary examples the usual approach must learn from.

Abstract

We propose an unsupervised method for sentence summarization using only language modeling. The approach employs two language models, one that is generic (i.e. pretrained), and the other that is specific to the target domain. We show that by using a product-of-experts criteria these are enough for maintaining continuous contextual matching while maintaining output fluency. Experiments on both abstractive and extractive sentence summarization data sets show promising results of our method without being exposed to any paired data.

Jiawei Zhou, Alexander M. Rush
arXiv:1907.13337 · cs.CL, cs.LG · submitted Jul 31, 2019
abstract · pdf · html

add comment on HN