/** * DamerauLevenshtein distance is a measure of the similarity between two strings, which we will refer to as the * source string (s) and the target string (t). The distance is the number of deletions, insertions, or substitutions * required to transform s into t. */ public static Long getDamerauLevenshtein_Distance( ValueMetaInterface metaA, Object dataA, ValueMetaInterface metaB, Object dataB ) { if ( dataA == null || dataB == null ) { return null; } return new Long( Utils.getDamerauLevenshteinDistance( dataA.toString(), dataB.toString() ) ); }
cdistance = Utils.getDamerauLevenshteinDistance( usecacheValue, uselookupvalue ); break; case FuzzyMatchMeta.OPERATION_TYPE_NEEDLEMAN_WUNSH: