Hello everybody,
I'm looking for an approximate matching approach with Perl, and I found the String::Approx package (
It's claimed to use Levenshtein edit distance (LeD) as its measure but I don't know how LeD was used in this implementation?
If I want to write my own approximate matching program using LeD, what must I do? (e.g. If 2 strings differ in less than 10% of their contents, can I say that two string are the same? or I should use another approach?)
Thank you very much,
Tiamose
I'm looking for an approximate matching approach with Perl, and I found the String::Approx package (
It's claimed to use Levenshtein edit distance (LeD) as its measure but I don't know how LeD was used in this implementation?
If I want to write my own approximate matching program using LeD, what must I do? (e.g. If 2 strings differ in less than 10% of their contents, can I say that two string are the same? or I should use another approach?)
Thank you very much,
Tiamose