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;
}
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|