[Levenshtein Distance] Maximal distance to decide that word is not similar
Hai i has been successfully implemented Levenshtein Distance. But now i was confused, what is ideally maximal distance that the word in my data is not similar with word user has input? Any response is appreciated. Thank you.
Topic archived. No new replies allowed.