Markov-Enhanced Clustering for Long Document Summarization: Tackling the 'Lost in the Middle' Challenge with Large Language Models

Aziz Amari, Mohamed Achref Ben Ammar
6/22/2025
cs.CL

No official code found. Best implementation: achrefbenammar404/large_doc_summarization (3 stars, last commit 2025-04-15).

Abstract

The rapid expansion of information from diverse sources has heightened the need for effective automatic text summarization, which condenses documents into shorter, coherent texts. Summarization methods generally fall into two categories: extractive, which selects key segments from the original text, and abstractive, which generates summaries by rephrasing the content coherently. Large language models have advanced the field of abstractive summarization, but they are resourceintensive and face significant challenges in retaining key information across lengthy documents, which we call being "lost in the middle". To address these issues, we propose a hybrid summarization approach that combines extractive and abstractive techniques. Our method splits the document into smaller text chunks, clusters their vector embeddings, generates a summary for each cluster that represents a key idea in the document, and constructs the final summary by relying on a Markov chain graph when selecting the semantic order of ideas.

View on arXivView PDF

Code Implementations(1)

Official implementation of the research paper: "Markov-Enhanced Clustering for Long Document Summarization: Tackling the 'Lost in the Middle' Challenge with Large Language Models" by Aziz Amari and Mohamed Achref Ben Ammar, INSAT, University of Carthage, Tunisia.

31Python, DockerfileApr 15, 20251 years ago
aimarkov-chainnatural-language-processingresearchresearch-paper+1 more

Similar Papers

Cite this paper

@article{amari2025markovenhanced,
  title  = {Markov-Enhanced Clustering for Long Document Summarization: Tackling the 'Lost in the Middle' Challenge with Large Language Models},
  author = {Aziz Amari and Mohamed Achref Ben Ammar},
  year   = {2025},
  eprint = {2506.18036},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.18036v1}
}

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/2506.18036.svg)](https://codeofpaper.com/paper/2506.18036)

Discussion