Contents

# The Levenshtein distance is a metric for measuring the amount of difference
# between two sequences (i.e., the so called edit distance). The Levenshtein
# distance between two strings is given by the minimum number of operations
# needed to transform one string into the other, where an operation is an
# insertion, deletion, or substitution of a single character.
#
# More information about the Levenshtein distance algorithm:
# http://en.wikipedia.org/wiki/Levenshtein_distance .

Version data entries

1 entries across 1 versions & 1 rubygems

Version	Path
levenshtein-0.1.0	README