articleJournal of Artificial Intelligence ResearchDec 1, 2004DIAMOND OA

LexRank: Graph-based Lexical Centrality as Salience in Text Summarization

GEG. ErkanDRD. R. Radev

University of Michigan

Indexed inarxivcrossrefdoaj

Abstract

We introduce a stochastic graph-based method for computing relative importance of textual units for Natural Language Processing. We test the technique on the problem of Text Summarization (TS). Extractive TS relies on the concept of sentence salience to identify the most important sentences in a document or set of documents. Salience is typically defined in terms of the presence of particular important words or in terms of similarity to a centroid pseudo-sentence. We consider a new approach, LexRank, for computing sentence importance based on the concept of eigenvector centrality in a graph representation of sentences. In this model, a connectivity matrix based on intra-sentence cosine similarity is used as…

Citation impact

1,636
total citations
FWCI
12.95
Percentile
100%
References
32
Citations per year

Authors

2
  • GE
    G. ErkanCorresponding

    University of Michigan

  • DR
    D. R. Radev

    University of Michigan

Topics & keywords

Keywords
  • Centrality
  • Automatic summarization
  • Salience (neuroscience)
  • Cosine similarity
  • Sentence
  • Graph
  • Adjacency matrix
  • Cluster analysis
No related works found for this paper.

Funding