HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
davidadamojr
TextRank
Python2016–2017
davidadamojr / TextRank

TextRank

Python implementation of TextRank algorithm for automatic keyword extraction and summarization using Levenshtein distance as relation between text units. This project is based on the paper "TextRank: Bringing Order into Text" by Rada Mihalcea and Paul Tarau. https://web.eecs.umich.edu/~mihalcea/papers/mihalcea.emnlp04.pdf

2Distinct people
2Mentions
0Explicit recommenders
797GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Python implementation of TextRank algorithm for automatic keyword extraction and summarization using Levenshtein distance as relation between text units. This project is based on the paper "TextRank: Bringing Order into Text" by Rada Mihalcea and Paul Tarau. https://web.eecs.umich.edu/~mihalcea/papers/mihalcea.emnlp04.pdf

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 5:04:57 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by week2 dated mentions

Observed mentions: 2016-10-04 08:11:01 UTC to 2017-01-22 11:02:50 UTC. Weeks start Monday, UTC.

012016-10-03 00:00:00 UTC to 2016-10-10 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsOct 32016-10-10 00:00:00 UTC to 2016-10-17 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-10-17 00:00:00 UTC to 2016-10-24 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-10-24 00:00:00 UTC to 2016-10-31 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-10-31 00:00:00 UTC to 2016-11-07 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-11-07 00:00:00 UTC to 2016-11-14 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-11-14 00:00:00 UTC to 2016-11-21 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-11-21 00:00:00 UTC to 2016-11-28 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsNov 212016-11-28 00:00:00 UTC to 2016-12-05 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-05 00:00:00 UTC to 2016-12-12 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-12 00:00:00 UTC to 2016-12-19 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-19 00:00:00 UTC to 2016-12-26 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-26 00:00:00 UTC to 2017-01-02 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2017-01-02 00:00:00 UTC to 2017-01-09 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2017-01-09 00:00:00 UTC to 2017-01-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2017-01-16 00:00:00 UTC to 2017-01-23 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsJan 16

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Oct 32016-10-03 00:00:00 UTC2016-10-10 00:00:00 UTC101
Oct 102016-10-10 00:00:00 UTC2016-10-17 00:00:00 UTC000
Oct 172016-10-17 00:00:00 UTC2016-10-24 00:00:00 UTC000
Oct 242016-10-24 00:00:00 UTC2016-10-31 00:00:00 UTC000
Oct 312016-10-31 00:00:00 UTC2016-11-07 00:00:00 UTC000
Nov 72016-11-07 00:00:00 UTC2016-11-14 00:00:00 UTC000
Nov 142016-11-14 00:00:00 UTC2016-11-21 00:00:00 UTC000
Nov 212016-11-21 00:00:00 UTC2016-11-28 00:00:00 UTC000
Nov 282016-11-28 00:00:00 UTC2016-12-05 00:00:00 UTC000
Dec 52016-12-05 00:00:00 UTC2016-12-12 00:00:00 UTC000
Dec 122016-12-12 00:00:00 UTC2016-12-19 00:00:00 UTC000
Dec 192016-12-19 00:00:00 UTC2016-12-26 00:00:00 UTC000
Dec 262016-12-26 00:00:00 UTC2017-01-02 00:00:00 UTC000
Jan 22017-01-02 00:00:00 UTC2017-01-09 00:00:00 UTC000
Jan 92017-01-09 00:00:00 UTC2017-01-16 00:00:00 UTC000
Jan 162017-01-16 00:00:00 UTC2017-01-23 00:00:00 UTC101

What Hacker News says

2 sources
As long as you have a tokenizer, i.e. you can split words in a sentence, language doesn't matter for some basic techniques. Two examples that easily come to mind: TF-IDF [1] and TextRank [2,3]. These are good to get started, but if you want to know more about the state of the art, searching on Google Scholar for "keyword extraction $language" is your best bet (and maybe "keyword extraction overview", also in Scholar). [1] http://www.joyofdata.de/blog/tf-idf-statistic-keyword-extrac... [2] http://digital.library.unt.edu/ark%3A/67531/metadc30962/m2/1... [3] https://github.com/davidadamojr/TextRank
In Stanford Natural Language Parser
I don't find any information on what version of Python this works with, any pointers? 2.X 3? How is this different from all the other textrank implementation? Is this more complete? https://github.com/summanlp/textrank https://github.com/davidadamojr/TextRank https://github.com/galsang/PyTextRank rant: I hate how complex the python ecosystem is, there are different versions for language, different packaging systems (this project uses both conda and pip), sometimes you need to install stuff even with OS package manager or install packages from the source. Something really needs to be done for this mess.
In Pytextrank – A pure Python implementation of TextRank

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.