Submitted by Devinco001 t3_ywjd26 in MachineLearning
Devinco001 OP t1_iwmdmgy wrote
Reply to comment by afireohno in [D] Spellcheck and Levenshtein distance by Devinco001
Thanks! I BK tree is much faster. While researching of BK trees, I found out symspell algorithm, which is even faster. So going to use that for now, because of its high accuracy and faster time.
afireohno t1_iwn5dcr wrote
Glad it was helpful!
Viewing a single comment thread. View all comments