Soundex and Levenshtein Distance Demo

Soundex and Levenshtein Distance algorithms are very exhaustivey used in searching and spell check applications. Soundex is used to select words which 'SOUND LIKE' another word EX: Bryan and Brian Levenshtein Distance is the minimum number of steps required to transform one string to another. This algorithm can be effectively used to narrow down the number of possible matches for a given string. This can be useful in 'refining' your search results according to a threshold value.