mlsanityData to 7 Oct 2026

OTExtSum: Extractive Text Summarisation with Optimal Transport

arXiv 2204.10086 ↗First posted 21 Apr 2022cs.CLcited by 8

Not on the map. Why?

Abstract (arXiv)

Extractive text summarisation aims to select salient sentences from a document to form a short yet informative summary. While learning-based methods have achieved promising results, they have several limitations, such as dependence on expensive training and lack of interpretability. Therefore, in this paper, we propose a novel non-learning-based method by for the first time formulating text summarisation as an Optimal Transport (OT) problem, namely Optimal Transport Extractive Summariser (OTExtSum). Optimal sentence extraction is conceptualised as obtaining an optimal summary that minimises the transportation cost to a given document regarding their semantic distributions. Such a cost is defined by the Wasserstein distance and used to measure the summary's semantic coverage of the original document. Comprehensive experiments on four challenging and widely used datasets - MultiNews, PubMed, BillSum, and CNN/DM demonstrate that our proposed method outperforms the state-of-the-art non-learning-based methods and several recent learning-based methods in terms of the ROUGE metric.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 23 of its 48 references that are in the map. First posted on arXiv 21 Apr 2022.

Builds on

23 of 48 references.

References · 23

  1. 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,281
  2. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  3. 2019PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive Summarizationcited by 1,100
  4. 2015Teaching Machines to Read and Comprehendcited by 1,039
  5. 2020On Faithfulness and Factuality in Abstractive Summarizationcited by 895
  6. 2018A Discourse-Aware Attention Model for Abstractive Summarization of Long Documentscited by 477
  7. 2019Multi-News: a Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Modelcited by 431
  8. 2016SummaRuNNer: A Recurrent Neural Network based Sequence Model for Extractive Summarization of Documentscited by 245
  9. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  10. 2020Extractive Summarization as Text Matchingcited by 189
  11. 2018Ranking Sentences for Extractive Summarization with Reinforcement Learningcited by 128
  12. 2019HIBERT: Document Level Pre-training of Hierarchical Bidirectional Transformers for Document Summarizationcited by 120
11 more
  1. 2019BillSum: A Corpus for Automatic Summarization of US Legislationcited by 117
  2. 2020If beam search is the answer, what was the question?cited by 114
  3. 2019Discourse-Aware Neural Extractive Text Summarizationcited by 104
  4. 2019Sentence Centrality Revisited for Unsupervised Summarizationcited by 64
  5. 2020Vocabulary Learning via Optimal Transport for Neural Machine Translationcited by 58
  6. 2019Hierarchical Optimal Transport for Document Representationcited by 53
  7. 2019Scoring Sentence Singletons and Pairs for Abstractive Summarizationcited by 34
  8. 2018Adversarial Text Generation via Feature-Mover's Distancecited by 27
  9. 2021Unsupervised Extractive Summarization using Pointwise Mutual Informationcited by 23
  10. 2020Rationalizing Text Matching: Learning Sparse Alignments via Optimal Transportcited by 20
  11. 2020Stepwise Extractive Summarization and Planning with Structured Transformerscited by 16

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 3; 2025: 0; 2026: 2.

8 papers.