info.debatty.java.stringsimilarity

Class NormalizedLevenshtein

java.lang.Object

info.debatty.java.stringsimilarity.NormalizedLevenshtein

All Implemented Interfaces:

NormalizedStringDistance, NormalizedStringSimilarity, StringDistance, StringSimilarity, Serializable

public class NormalizedLevenshtein
extends Object
implements NormalizedStringDistance, NormalizedStringSimilarity

This distance is computed as levenshtein distance divided by the length of the longest string. The resulting value is always in the interval [0.0 1.0] but it is not a metric anymore! The similarity is computed as 1 - normalized distance.

Author:

Thibault Debatty

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
NormalizedLevenshtein()

Method Summary

Methods

Modifier and Type	Method and Description
double	distance(String s1, String s2)
double	similarity(String s1, String s2) Compute and return a measure of similarity between 2 strings.

Methods inherited from class java.lang.Object

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

Constructor Detail

NormalizedLevenshtein

public NormalizedLevenshtein()

Method Detail

distance

public double distance(String s1,
              String s2)

Specified by:

distance in interface StringDistance

similarity

public double similarity(String s1,
                String s2)

Description copied from interface: StringSimilarity

Compute and return a measure of similarity between 2 strings.

Specified by:

similarity in interface StringSimilarity

Returns:

similarity (0 means both strings are completely different)