eu.project.ttc.metrics

Class LongestCommonSubsequence

java.lang.Object

eu.project.ttc.metrics.AbstractEditDistance

eu.project.ttc.metrics.LongestCommonSubsequence

All Implemented Interfaces:

EditDistance

public class LongestCommonSubsequence
extends AbstractEditDistance

Longest Common Subsequence.

           | ls(i-1,j-1) + 1,             if a[i]=b[j]
 ls(i,j) = |
           | max(ls(i-1,j), ls(i,j-1)),   else
 Boundary conditions: let think that   ls[i][-1] = 0,   ls[-1][j] = 0
 

Constructor Summary

Constructors

Constructor and Description
LongestCommonSubsequence()

Method Summary

Modifier and Type	Method and Description
int	compute(java.lang.String a, java.lang.String b)
boolean	isFailFast()
double	normalize(int distance, java.lang.String source, java.lang.String target)
void	setFailThreshold(double threshold)

Methods inherited from class eu.project.ttc.metrics.AbstractEditDistance

computeNormalized

Methods inherited from class java.lang.Object

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

Constructor Detail

LongestCommonSubsequence

public LongestCommonSubsequence()

Method Detail

compute

public int compute(java.lang.String a,
                   java.lang.String b)

normalize

public double normalize(int distance,
                        java.lang.String source,
                        java.lang.String target)

isFailFast

public boolean isFailFast()

setFailThreshold

public void setFailThreshold(double threshold)