sunlightlabs

# C implementation of Levenshtein text distance algorithm, uses RubyInline to call from within Ruby
# Wildly faster than the Text gem's Text::Levenshtein
# Example:

# l = Levenshtein.new
# l.distance 'hello', ' hello'
# => 1

# Taken from http://www.benallfree.com/2008/10/05/finding-duplicate-text-with-ruby/