Levenshtein distance with trie trees and DAWG

Hello could some one help me implement this code: https://gist.github.com/smhanov/94230b422c2100ae4218 into grasshopper python component? The author describes in detail how does this work here http://stevehanov.ca/blog/index.php?id=115 

What I am trying to do is measure strings levenshtein distance from one input vs all second input strings independently(tries would reduce the complexity from so many second input strings and DAWG would work as I understand as some sort of database to reduce memory requirements and it can be used to find indexes of original second input tree). And I believe there is fuzzy search algorithm here that you could select a threshold value as an input for the output distance value as well to once again reduce the calculation time.