rita.support
Class MinEditDist

java.lang.Object
  rita.support.MinEditDist

public class MinEditDist
extends java.lang.Object

Minimum-Edit-Distance (or Levenshtein distance) is a measure of the similarity between two strings, the source string and the target string (t). The distance is the number of deletions, insertions, or substitutions required to transform the source into the target / avg_string_length

Adapted from Michael Gilleland's algorithm

Constructor Summary

MinEditDist()

Method Summary

int	compute(java.lang.String[] src, java.lang.String[] target) Deprecated.
float	computeAdjusted(java.lang.String[] source, java.lang.String[] target) Computes min-edit-distance between 2 string arrays where each array element either matches or does not divided by their average (array) length.
float	computeAdjusted(java.lang.String source, java.lang.String target) Compute min-edit-distance between 2 strings divided by their average length.
int	computeRaw(java.lang.String[] source, java.lang.String[] target) Computes min-edit-distance between 2 string arrays where each array element either matches or does not.
int	computeRaw(java.lang.String source, java.lang.String target) Compute min-edit-distance between 2 strings
static void	main(java.lang.String[] args)

Methods inherited from class java.lang.Object

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

Constructor Detail

MinEditDist

public MinEditDist()

Method Detail

computeAdjusted

public float computeAdjusted(java.lang.String source,
                             java.lang.String target)

Compute min-edit-distance between 2 strings divided by their average length.

computeRaw

public int computeRaw(java.lang.String source,
                      java.lang.String target)

Compute min-edit-distance between 2 strings

See Also:

computeAdjusted(java.lang.String,java.lang.String)

computeAdjusted

public float computeAdjusted(java.lang.String[] source,
                             java.lang.String[] target)

Computes min-edit-distance between 2 string arrays where each array element either matches or does not divided by their average (array) length.

computeRaw

public int computeRaw(java.lang.String[] source,
                      java.lang.String[] target)

Computes min-edit-distance between 2 string arrays where each array element either matches or does not.

compute

public int compute(java.lang.String[] src,
                   java.lang.String[] target)

Deprecated.

Computes min-edit-distance between 2 string arrays where each array element either matches or does not

See Also:

computeAdjusted(java.lang.String[],java.lang.String[]), computeRaw(java.lang.String[],java.lang.String[])

main

public static void main(java.lang.String[] args)