LexRank
A classical unsupervised extractive text summarization algorithm that constructs an undirected sentence graph using TF-IDF cosine similarity and measures sentence importance via spectral centrality. Together with TextRank, it belongs to the family of graph-based pairwise similarity summarization methods.
Timeline (last 90 days)
Traditional graph-based summarization methods (such as TextRank and LexRank) treat sentences as nodes and sentence similarity as edges, selecting important sentences via centrality algorithms.
LexRank constructs an undirected graph using TF-IDF cosine similarity and measures sentence importance with spectral graph centrality.
All Facts (2)
Traditional graph-based summarization methods (such as TextRank and LexRank) treat sentences as nodes and sentence similarity as edges, selecting important sentences via centrality algorithms.
50%UnverifiedLexRank constructs an undirected graph using TF-IDF cosine similarity and measures sentence importance with spectral graph centrality.
50%