Approximate matching with perl

[Tiamose]

Hello everybody,

I'm looking for an approximate matching approach with Perl, and I found the String::Approx package (

http://search.cpan.org/~jhi/String-Approx-3.26/Approx.pm).

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

 

[KevinADC]

Quoted from String::Approx

If you want to compare strings for similarity, you probably just want the Levenshtein edit distance (explained below), the Text::Levenshtein and Text::LevenshteinXS modules in CPAN. See also Text::WagnerFischer and Text:hraseDistance. (There are functions for this in String::Approx, e.g. adist(), but their results sometimes differ from the bare Levenshtein et al.)

------------------------------------------
- Kevin, perl coder unexceptional!

 

[Tiamose]

Hello Kevin,

Thank you, but what I want to know is how LeD was used in this package (i.e. the mechanism of this package, how does it work?).

 

[travs69]

download the package and open the .pm and read it.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Travis - Those who say it cannot be done are usually interrupted by someone else doing it; Give the wrong symptoms, get the wrong solutions;

 

[KevinADC]

I think it's just using regexp's and index() to simulate LeD.

------------------------------------------
- Kevin, perl coder unexceptional!