org.treetank.service.xml.diff.algorithm.fmes

Class Util

java.lang.Object

org.treetank.service.xml.diff.algorithm.fmes.Util

public final class Util
extends Object

Useful functions.

Method Summary

Methods

Modifier and Type	Method and Description
static <T> List<Pair<T,T>>	longestCommonSubsequence(List<T> paramX, List<T> paramY, IComparator<T> paramCmp) Longest common subsequence algorithm.
static double	quickRatio(String paramFirst, String paramSecond) Calculates the similarity of two strings.

Methods inherited from class java.lang.Object

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

Method Detail

longestCommonSubsequence

public static <T> List<Pair<T,T>> longestCommonSubsequence(List<T> paramX,
                                           List<T> paramY,
                                           IComparator<T> paramCmp)

Longest common subsequence algorithm. cf. E. Myers. An O(ND) difference algorithm and its variations. Algorithmica, 1(2): 251-266, 1986

Type Parameters:

T - type of data

Parameters:

paramX - first list

paramY - second list

paramCmp - function to compare the items in both lists (equality)

Returns:

lcs, the items in the pairs are equal and taken from list x and list y.

quickRatio

public static double quickRatio(String paramFirst,
                String paramSecond)

Calculates the similarity of two strings. This is done by comparing the frequency each character occures in both strings.

Parameters:

paramFirst - first string

paramSecond - second string

Returns:

similarity of a and b, a value in [0, 1]