Single Document Extractive Summarization using Domination in Hypergraph

arXiv cs.CL Papers

Summary

This paper proposes a novel method for extractive text summarization using hypergraph domination, comparing its performance with existing graph-based approaches.

arXiv:2609.15993v1 Announce Type: new Abstract: Automatic Text Summarization (ATS) in Natural Language Processing has been an important task in Information Retrieval. It compresses a document to create a summary that captures all the relevant and important information conveyed in the document. This study explores Hypergraph for extractive text summarization of single documents. Objective: This study explores a novel method of leveraging the property of domination in hypergraphs to generate an extractive summary and compare its performance with state of the art graph based methods. Method: Our work aims to generate an extractive summary by creating a sentence hypergraph where each sentence represents a node and the edge is a keyword or a named entity that contains the sentences in which it occurs. We generate a hypergraph where each edge is a keyword or an important topic and the nodes are sentences containing those keywords. Then we apply a greedy algorithm to find the dominating set of the hypergraph which will contain sentences that will form the extractive summary.
Original Article
View Cached Full Text

Cached at: 09/16/26, 08:36 AM

# Single Document Extractive Summarization using Domination in Hypergraph
Source: [https://arxiv.org/abs/2609.15993](https://arxiv.org/abs/2609.15993)
[View PDF](https://arxiv.org/pdf/2609.15993)

> Abstract:Automatic Text Summarization \(ATS\) in Natural Language Processing has been an important task in Information Retrieval\. It compresses a document to create a summary that captures all the relevant and important information conveyed in the document\. This study explores Hypergraph for extractive text summarization of single documents\. Objective: This study explores a novel method of leveraging the property of domination in hypergraphs to generate an extractive summary and compare its performance with state of the art graph based methods\. Method: Our work aims to generate an extractive summary by creating a sentence hypergraph where each sentence represents a node and the edge is a keyword or a named entity that contains the sentences in which it occurs\. We generate a hypergraph where each edge is a keyword or an important topic and the nodes are sentences containing those keywords\. Then we apply a greedy algorithm to find the dominating set of the hypergraph which will contain sentences that will form the extractive summary\.

## Submission history

From: Sheetal Sonawane Dr \[[view email](https://arxiv.org/show-email/e6ff42d7/2609.15993)\] **\[v1\]**Wed, 8 Jul 2026 09:46:49 UTC \(478 KB\)

Similar Articles

yifanfeng97/Hyper-Extract

GitHub Trending (daily)

Hyper-Extract is an open-source CLI tool that uses LLMs to extract structured knowledge from unstructured documents, supporting various output formats like knowledge graphs and hypergraphs.