summaryrefslogtreecommitdiff
path: root/textproc/ruby-levenshtein/DESCR
diff options
context:
space:
mode:
Diffstat (limited to 'textproc/ruby-levenshtein/DESCR')
-rw-r--r--textproc/ruby-levenshtein/DESCR15
1 files changed, 15 insertions, 0 deletions
diff --git a/textproc/ruby-levenshtein/DESCR b/textproc/ruby-levenshtein/DESCR
new file mode 100644
index 00000000000..de18effb8b0
--- /dev/null
+++ b/textproc/ruby-levenshtein/DESCR
@@ -0,0 +1,15 @@
+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 sequences is
+given by the minimum number of operations needed to transform
+one sequence into the other, where an operation is an
+insertion, deletion, or substitution of a single element.
+
+The two sequences can be two strings, two arrays, or two other
+objects responding to :each. All sequences are by generic
+(fast) C code.
+
+All objects in the sequences should respond to :hash and :eql?.
+
+More information about the Levenshtein distance algorithm:
+http://en.wikipedia.org/wiki/Levenshtein_distance .