Join GitHub today
Find the Levenshtein edit distance in perl 6
Fetching latest commit…
Cannot retrieve the latest commit at this time.
|Type||Name||Latest commit message||Commit time|
|Failed to load latest commit information.|
=begin pod 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. =head1 NAME Text::Levenshtein - An implementation of the Levenshtein edit distance =head1 SYNOPSIS 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" =head1 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: L< http://www.merriampark.com/ld.htm > =head1 AUTHOR Copyright 2002 Dree Mistrut <F<email@example.com>> perl6 port: 2010 Steve Schulze aka thundergnat 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. =end pod