Re: String comparisons

new topic     » goto parent     » topic index » view thread      » older message » newer message
_tom said...

This is by Jeremy Cowgar

You count the number of steps to transform s1 to s2.

_tom



Yes, I have used the Levenshtein distance in other projects. The problem I had was how to set the match criterion, as there are many versions for string 2 which will yield the same Levenshtein distance; however, in my current case this isn't important. I think it will work.
Thanks,
jd

new topic     » goto parent     » topic index » view thread      » older message » newer message

Search



Quick Links

User menu

Not signed in.

Misc Menu