at.molindo.utils.data

Class StringSimilarityUtils

java.lang.Object

at.molindo.utils.data.StringSimilarityUtils

public class StringSimilarityUtils
extends Object

implementation of the Needleman-Wunsch algorithm for string similarity

Method Summary

Methods

Modifier and Type	Method and Description
static int	cost(char[] str1, int string1Index, char[] str2, int string2Index) get cost between characters where d(i,j) = 1 if i does not equals j, 0 if i equals j.
static float	similarity(String string1, String string2)
static float	similarity(String string1, String string2, float min)
static int	unnormalisedSimilarity(String string1, String string2)
static int	unnormalisedSimilarity(String string1, String string2, float maxGap) implements the NeedlemanWunch distance function.

Methods inherited from class java.lang.Object

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

Method Detail

similarity

public static float similarity(String string1,
               String string2)

similarity

public static float similarity(String string1,
               String string2,
               float min)

unnormalisedSimilarity

public static int unnormalisedSimilarity(String string1,
                         String string2)

unnormalisedSimilarity

public static int unnormalisedSimilarity(String string1,
                         String string2,
                         float maxGap)

implements the NeedlemanWunch distance function.

Parameters:

maxGap -

s -

t -

maxGap -

Returns:

the NeedlemanWunch distance for the given strings

cost

public static final int cost(char[] str1,
       int string1Index,
       char[] str2,
       int string2Index)

get cost between characters where d(i,j) = 1 if i does not equals j, 0 if i equals j.

Parameters:

str1 - - the string1 to evaluate the cost

string1Index - - the index within the string1 to test

str2 - - the string2 to evaluate the cost

string2Index - - the index within the string2 to test

Returns:

the cost of a given substitution d(i,j) where d(i,j) = 1 if i!=j, 0 if i==j