Skip to content
master
Switch branches/tags
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
 
 
t
 
 
 
 
 
 
 
 
 
 
 
 

NAME

Text::Levenshtein - A port of the Perl 5 Text::Levenshtein

Build Status

SYNOPSIS

Find the Levenshtein edit distance.

This is a direct port of the Perl 5 version and should be close to 100% similar other then some Perl 6 idioms. The fastdistance routine was not ported since the logic was buggy and the code to fix it made it the same speed as the regular distance routine.

use Text::Levenshtein qw(distance);

print distance("foo","four");
# prints "2"

my @words=("four","foo","bar");
my @distances=distance("foo",@words);

print "@distances";
# prints "2 0 3"

DESCRIPTION

This module implements the Levenshtein edit distance. The Levenshtein edit distance is a measure of the degree of proximity between two strings. This distance is the number of substitutions, deletions or insertions ("edits") needed to transform one string into the other one (and vice versa). When two strings have distance 0, they are the same. A good point to start is: http://www.merriampark.com/ld.htm

AUTHOR

Copyright 2002 Dree Mistrut dree@friul.it perl6 port: 2010 Steve Schulze

This package is free software and is provided "as is" without express or implied warranty. You can redistribute it and/or modify it under the same terms as Perl itself.

About

Find the Levenshtein edit distance in Raku

Resources

License

Releases

No releases published

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •  

Languages