Submitted by Devinco001 t3_ywjd26 in MachineLearning
Devinco001 OP t1_iwmebpe wrote
Reply to comment by goedel777 in [D] Spellcheck and Levenshtein distance by Devinco001
Sure, but its just a for loop, looping through the words in the dictionary, and using a python library 'python-levenshtein' to calculate distance between the dictionary words and the mispelled word.
For now, I am skipping levenshtein for a faster approximate distance, using symspell algorithm. It is highly accurate and much faster. Reduced computation time from 21 days to 13 hours
Viewing a single comment thread. View all comments