Permalink
Browse files

Update docs slightly.

  • Loading branch information...
1 parent 9a48dad commit 304fb28f54e67ca47efeeb1694ca557e51fe716f Schuyler Erle committed Jul 30, 2009
Showing with 2 additions and 1 deletion.
  1. +2 −1 README.txt
View
@@ -2,7 +2,8 @@ The levenshtein module implements fast Damerau-Levenshtein edit distance
computation in O(n) memory and O(n^2) time, using a C wrapper. The module has a
single function:
- Levenshtein.distance("string1", "string2") == 1
+ require 'levenshtein'
+ Levenshtein.distance("string1", "string2") == 1 # returns true
This function can be used as a drop-in replacement for
Text::Levenshtein.levenshtein, which is pure Ruby and rather slow. That's it!

0 comments on commit 304fb28

Please sign in to comment.