OrderSum: Semantic Sentence Ordering for Extractive Summarization

Taewan Kwon, Sangyong Lee
2/22/2025
cs.CL

No official code found. Best implementation: Espresso-AI/ordersum (0 stars, BSD-3-Clause, last commit 2025-03-08).

Abstract

There are two main approaches to recent extractive summarization: the sentence-level framework, which selects sentences to include in a summary individually, and the summary-level framework, which generates multiple candidate summaries and ranks them. Previous work in both frameworks has primarily focused on improving which sentences in a document should be included in the summary. However, the sentence order of extractive summaries, which is critical for the quality of a summary, remains underexplored. In this paper, we introduce OrderSum, a novel extractive summarization model that semantically orders sentences within an extractive summary. OrderSum proposes a new representation method to incorporate the sentence order into the embedding of the extractive summary, and an objective function to train the model to identify which extractive summary has a better sentence order in the semantic space. Extensive experimental results demonstrate that OrderSum obtains state-of-the-art performance in both sentence inclusion and sentence order for extractive summarization. In particular, OrderSum achieves a ROUGE-L score of 30.52 on CNN/DailyMail, outperforming the previous state-of-the-art model by a large margin of 2.54.

View on arXivView PDF

Code Implementations(1)

BSD-3-Clause

Official implementation for the paper "OrderSum: Semantic Sentence Ordering for Extractive Summarization"

00PythonMar 8, 20251 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{kwon2025ordersum,
  title  = {OrderSum: Semantic Sentence Ordering for Extractive Summarization},
  author = {Taewan Kwon and Sangyong Lee},
  year   = {2025},
  eprint = {2502.16180},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.16180v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.16180.svg)](https://codeofpaper.com/paper/2502.16180)

Discussion