I found this python implementation on github with 400+ stars which use levenshtein distance between each nodes.
But original paper (page 4) said:
Next, all lexical units that pass the syntactic filter are added to the graph, and an edge is added between those lexical units that co-occur within a window of N word
So the question is: is levenshtein distance legit for this algorithm or better to rewrite with windowed edges?
Intuitively levenshtein distance must not work because it's not denote importance of word...