hi monks,
here comes another implementation of the
Levenshtein Distance; a distance metric which measures the similarities of strings.
Info and some other implementations can be found at Levenshtein distance: calculating similarity of strings.
At the moment I need to compare two sets of strings where each set consists of approximately 2000 strings, which means approximataley 3-4 million measurements. Thus I wrote this code, in which I tried to minimize the memory usage, to make it more efficient.
sub ldist {
my @s = split //, shift;
my @t = split //, shift;
return scalar @t if scalar @s == 0;
return scalar @s if scalar @t == 0;
my (@prevColumn, @currColumn);
@prevColumn = 0..scalar(@t);
for my $s (0..$#s) {
@currColumn = ( $s + 1 );
for my $t (0..$#t) {
push @currColumn, min(
$currColumn[$t] + 1
, $prevColumn[$t+1] + 1
, $prevColumn[$t] + ($s[$s] eq $t[$t] ? 0 : 1)
);
}
@prevColumn = @currColumn;
}
pop @currColumn
}
sub min {
my $min = shift;
for (@_) {
$min = $_ if $_ < $min;
}
$min;
}
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.