Similarity according to Levenshtein code- how to ignore deletions/insertions?

[simz92]

Dear all,

according to Wikipedia, "the Levenshtein distance between two words is the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into the other."

I have found a code that returns the similarity of two strings according to the Levenshtein Distance. I would like to change the code in such a way that it ignores deletions/insertions, so, for example, the comparison of "apple tree" and "apple trees" returns a similarity value of 100%, whereas "big apple tree" and "big pear tree" returns (14-4)/14=10/14
I cant really figure out where in this code deletions and insertions are counted, maybe somebody sees it?

Thank you for your help!

Please Login or Register  to view this content.

Source:
http://www.vbforums.com/showthread.p...wo-words-in-VB

[protonLeah]

Your post does not comply with Rule 1 of our Forum RULES. Your post title should accurately and concisely describe your problem, not your anticipated solution.

Use terms appropriate to a Google search. Poor thread titles, like Please Help, Urgent, Need Help, Formula Problem, Code Problem, and Need Advice will be addressed according to the OP's experience in the forum: If you have less than 10 posts, expect (and respond to) a request to change your thread title. If you have 10 or more posts, expect your post to be locked, so you can start a new thread with an appropriate title.

To change a Title go to your first post, click EDIT then Go Advanced and change your title, if 2 days have passed ask a moderator to do it for you.

(This thread should receive no further responses until this moderation request is fulfilled, as per Forum Rule 7)

** That "code " you posted will not compile nor run as posted. **