File: levenshtein.rb [text-1.2.3 Documentation]

Last Modified
  2014-02-16 05:53:03 +0000
Requires

## Description

Levenshtein distance algorithm implementation for Ruby, with UTF-8 support.

The Levenshtein distance is a measure of how similar two strings s and t are, calculated as the number of deletions/insertions/substitutions needed to transform s into t. The greater the distance, the more the strings differ.

The Levenshtein distance is also sometimes referred to as the easier-to-pronounce-and-spell 'edit distance'.

Author: Paul Battley (pbattley@gmail.com)