ar.com.ktulu.dict.strategies
Class Levenshtein

java.lang.Object
  |
  +--ar.com.ktulu.dict.strategies.Levenshtein

class Levenshtein

extends java.lang.Object

Computes the Levenshtein distance between two strings.

Levenshtein distance (LD) is a measure of the similarity between two strings, which we will refer to as the source string (s) and the target string (t). The distance is the number of deletions, insertions, or substitutions required to transform s into t. For example,

• If s is "test" and t is "test", then LD(s,t) = 0, because no transformations are needed. The strings are already identical.
• If s is "test" and t is "tent", then LD(s,t) = 1, because one substitution (change "s" to "n") is sufficient to transform s into t.

The greater the Levenshtein distance, the more different the strings are.

Levenshtein distance is named after the Russian scientist Vladimir Levenshtein, who devised the algorithm in 1965. If you can't spell or pronounce Levenshtein, the metric is also sometimes called edit distance.

Source and the above description taken from http://www.merriampark.com/ld.htm

See Also:

Levenshtein Distance

Constructor Summary

(package private)

Levenshtein()

Method Summary

static int

LD(java.lang.String s, java.lang.String t)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Levenshtein

Levenshtein()

Method Detail

LD

public static int LD(java.lang.String s,
                     java.lang.String t)