RAA - levenshtein

levenshtein / 1.1.0

Short description:

Implementation of Levenshtein text distance algorithm

Category:

Library/Text

Status:

stable

Created:

2005-04-17 19:48:36 GMT

Last update:

2006-10-17 11:09:36 GMT

Owner:

Paul Battley (Projects of this owner)

Homepage:

http://rubyforge.org/projects/text

Download:

http://rubyforge.org/frs/?group_id=2080&release_id=7389

License:

Ruby's

Dependency:

None

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'.

This is now part of the Text project.

Versions:

[1.1.0 (2006-10-17)] [1.3 (2005-04-19)] [1.2 (2005-04-17)]

Edit this project (for project owner)

back to RAA top