I know I have heard of a couple functions/algorithms before that test two strings to see if they are similar (but not necessarily equal or equivalent). Does anybody know anything about this? I can't remember the name of the function/algorithm...and I was wanting to learn more about it.
Originally Posted by DavidP
How do you define how similar the strings need to be for them to be considered similar?
no not regular expressions.
It's Levenshtein distance. Thanks!