Paper

Query-oriented text summarization based on hypergraph transversals

Existing graph- and hypergraph-based algorithms for document summarization represent the sentences of a corpus as the nodes of a graph or a hypergraph in which the edges represent relationships of lexical similarities between sentences. Each sentence of the corpus is then scored individually, using popular node ranking algorithms, and a summary is produced by extracting highly scored sentences... (read more)

Results in Papers With Code
(↓ scroll down to see all results)