A Reassessment of TextRank: Graph-Based Extractive Summarization in the Era of Large Language Models- A Systematic Review
Ahmed J. Jabur Asmaa Abdul Azeez DakhilIsraa Saad MohammedBalqees Naji Ajel
Aug 2026· Iraqi Journal for Computers and Informatics· 0 citations· 122 references
TL;DR
This survey presents a systematic review of 121 references spanning 2002 to 2026, tracing the evolution of TextRank-based approaches into hybrid LLM pipelines and advancing three qualified arguments.
Abstract
Despite the emergence of Large Language Models (LLMs), graph-based extractive summarization and specifically the TextRank algorithm have retained architectural significance in high-stakes domains including legal, medical, scientific, and journalistic text processing. This survey presents a systematic review of 121 references spanning 2002 to 2026, tracing the evolution of TextRank-based approaches into hybrid LLM pipelines and advancing three qualified arguments.First, TextRank provides architectural advantages that persist even as LLM context windows grow: source-level provenance that grounded generation methods only partially replicate; approximately 75% token consumption reduction at any fixed per-token rate; and deterministic, auditable extraction consistent with emerging regulatory transparency requirements in legal and clinical domains.Second, LLMs exhibit hallucination rates of 15–30% on domain-specific text and produce no source audit trail; TextRank pre-filtering substantially mitigates both limitations, while grounded generation alternatives address them at the generation layer. Third, hybrid TextRank→LLM pipelines achieve ROUGE-1 = 0.41 on CNN/DailyMail and 0.54–0.76 on domain-specific benchmarks; cross-benchmark ROUGE comparisons are not valid across different benchmark types and should not be interpreted as a unified performance ranking. The performance comparisons are derived from the reviewed literature; the layered pipeline architecture, limitations taxonomy, and research agenda are original contributions of this survey."
The design realization and evaluation of an Automated Summarization Tool (AST) is presented which is a document intelligence platform based on google gemini 2.5 flash that outperforms the strongest fine-tuned transformer baselines (PEGASUS, BART) by ~14 points and is clearly ahead of BERTSUM-ext (a strong transformer b...
K. Kumar, A. Amandeep, Dharmender Kumar et al.· International Journal of Inn...· 0 citations
The exponential growth of scientific literature has intensified the demand for automated summarization systems capable of producing abstracts that are both linguistically fluent and factually reliable. Existing approaches face a fundamental trade-off: encoder-decoder models such as BART and T5 maintain strong factual g...
Geoffrey Antonio Arifin, Andrew Widyanata, Henry Lucky et al.· International Conference on...· 0 citations
This study proposes a novel two-level diagnostic protocol for benchmarking LLM-summarizers based on the stability of the generated summaries and motivates further research towards development of robust, reliable and trustworthy LLM-summarizers.
This work study large language model (LLM)-based simplification of scientific texts and presents a human-in-the-loop workflow that transforms expert summaries into more accessible versions for non-specialists.
This survey provides a comprehensive overview of recent advances in LLM-based evaluation, covering techniques, applications, and challenges across domains, with future directions emphasizing standardized protocols, uncertainty estimation, and human–AI collaboration.
M. Nadăş· Artificial Intelligence Revi...· 0 citations
Results indicate that the transformer-based abstraction, combined with an extractive text summarization approach, can be a very useful, scalable, and domain-independent model for approximating long scientific texts.