README in levenshtein-0.1.0 vs README in levenshtein-0.1.1

- old
+ new

@@ -1,8 +1,8 @@ -# 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 . +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 .