Here is the route for TextRank:
- Document to be summarized expressed as tf-idf matrix
- (tf-idf matrix)*(tf-idf matrix).Transpose = Adjacency matrix of some graph whose vertices are actually the sentences of above document
- Page rank is applied on this graph -> returns PR values of each sentence
Now, this PR values are actually Eigen values of that adjacency matrix
What is the physical meaning or intuition behind this.?
Why Eigen values are actually the ranks ?
Here is the link for Page Rank: http://www.cs.princeton.edu/~chazelle/courses/BIB/pagerank.htm
Here is an extract from above page:
PageRank or PR(A) can be calculated using a simple iterative algorithm, and corresponds to the principal eigenvector of the normalized link matrix of the web.
Link for TextRank: https://joshbohde.com/blog/document-summarization