Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Code for original Textrank algorithm (without similarity function optimizations) #80

Open
alkakhurana opened this issue Sep 30, 2020 · 1 comment

Comments

@alkakhurana
Copy link

Hi,

Is it possible to get the python implementation of original Textrank algorithm? or
Can you suggest the changes that need to be done in the existing code for original Textrank?

I need to compare the summaries produced by both variations.

Thanks in advance

@fedelopez77
Copy link
Contributor

Hi,

The version that is in this repository follows the original implementation of TextRank.
You can have a look at the source code to calculate the similarities:
https://github.com/summanlp/textrank/blob/master/summa/summarizer.py#L41

The version that we added on Gensim uses the optimizations, with the Okapi BM25 function.
You can verify that in the source code in:
https://github.com/RaRe-Technologies/gensim/blob/develop/gensim/summarization/summarizer.py#L79

Best,
Fede

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants