# 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: # en.wikipedia.org/wiki/Levenshtein_distance .

Generated on Sun Apr 5 13:52:56 2020 by
yard
0.9.24 (ruby-2.7.0).