Find the Levenshtein edit distance in perl 6
Switch branches/tags
Nothing to show
Failed to load latest commit information.
t expand tests and modernize . Dec 23, 2015
.travis.yml Enable travis building, Bring META up to date. Dec 21, 2015
META6.json Update with license and tag meta info Apr 22, 2017


=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


    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"


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< >

=head1 AUTHOR

Copyright 2002 Dree Mistrut <F<>>
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

=end pod