Jump to content
  • Advertisement
Sign in to follow this  
giugio

Levenshtein distance

This topic is 3415 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hy. I'm implemented the Levenshtein distance(http://it.wikipedia.org/wiki/Distanza_di_Levenshtein), an algorithm that return the number of passages to do for a string to another string for reach the equal string. The problem is that these passages are from 0(strings are equals)to infinity. How i create a number that rappresent a value from 0 to 1 from a value from 0 to infinity? thanks

Share this post


Link to post
Share on other sites
Advertisement
thanks.
I work on a reconition of email string on a db , for a smarty mail validator
and finder, i would find all the combination in the Levenshtein distance of a string and try if the combination string is present on a table of db with my personal mails , so if there is a write mistake , the query find the best simil email string and try it.
Naturally i direct the find with other parameters so name , surname ecc.. ad es:

email name surname
giuxxseppe.ferrari@yahoo.it giuseppe ferrari


int the table

giuseppe.ferrari@yahoo.it giuseppe ferrari


i try all the combination in email and see if a simil mail have a simil name and a simil surname , if the rank of the result is enough i recognize the email.

how modify the Levenshtein distance for send me all the combination?

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!