net.ricecode.similarity

Class LevenshteinDistanceStrategy

java.lang.Object

net.ricecode.similarity.LevenshteinDistanceStrategy

All Implemented Interfaces:

SimilarityStrategy

public class LevenshteinDistanceStrategy
extends java.lang.Object
implements SimilarityStrategy

A strategy that uses the Levenshtein's Distance to calculate the edit distance of two strings. Then it converts this to a "score" to fit the framework. http://en.wikipedia.org/wiki/Levenshtein_distance

Constructor Summary

Constructors

Constructor and Description
LevenshteinDistanceStrategy()

Method Summary

Modifier and Type	Method and Description
protected int	computeEditDistance(java.lang.String first, java.lang.String second)
double	score(java.lang.String first, java.lang.String second) Calculates the similarity score of objects, where 0.0 implies absolutely no similarity and 1.0 implies absolute similarity.

Methods inherited from class java.lang.Object

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

Constructor Detail

LevenshteinDistanceStrategy

public LevenshteinDistanceStrategy()

Method Detail

score

public double score(java.lang.String first,
                    java.lang.String second)

Calculates the similarity score of objects, where 0.0 implies absolutely no similarity and 1.0 implies absolute similarity.

Specified by:

score in interface SimilarityStrategy

Parameters:

first - The first string to compare.

second - The second string to compare.

Returns:

A number between 0.0 and 1.0.

Throws:

java.lang.NullPointerException - if one or both of the strings are null

computeEditDistance

protected int computeEditDistance(java.lang.String first,
                                  java.lang.String second)