VBcoders Guest



Don't have an account yet? Register
 


Forgot Password?



Soundex and Levenshtein Distance Demo

by Shelz (3 Submissions)
Category: String Manipulation
Difficulty: Beginner
Date Added: Wed 3rd February 2021
Rating: (2 Votes)

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.

Rate Soundex and Levenshtein Distance Demo

Download Soundex and Levenshtein Distance Demo

Download Soundex and Levenshtein Distance Demo (3 KB)

Soundex and Levenshtein Distance Demo Comments

No comments have been posted about Soundex and Levenshtein Distance Demo. Why not be the first to post a comment about Soundex and Levenshtein Distance Demo.

Post your comment

Subject:
Message:
0/1000 characters