Skip to content


Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Find the Levenshtein edit distance in perl 6
Perl Perl6
branch: master

Merge pull request #1 from zoffixznet/add_meta_provides

add provides section for latest panda (S11 support)
latest commit 9f816f58e7
@thundergnat authored
Failed to load latest commit information.
lib/Text Perl 6 port of the perl 5 module initial commits
t Perl 6 port of the perl 5 module initial commits add provides section for latest panda (S11 support)


=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. I didn't port the fastdistance routine 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
L< >

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
Something went wrong with that request. Please try again.