com.datastax.dse.graph.internal.utils

Class StringUtils

java.lang.Object

com.datastax.dse.graph.internal.utils.StringUtils

public class StringUtils
extends Object

Utilities for string manipulation.

Constructor Summary

Constructors

Constructor and Description
StringUtils()

Method Summary

Modifier and Type	Method and Description
static int	getOptimalStringAlignmentDistance(String s, String t) Finds the Optimal string alignment distance – also referred to as the Damerau-Levenshtein distance – between two strings.

Methods inherited from class java.lang.Object

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

Constructor Detail

StringUtils

public StringUtils()

Method Detail

getOptimalStringAlignmentDistance

public static int getOptimalStringAlignmentDistance(String s,
                                                    String t)

Finds the Optimal string alignment distance – also referred to as the Damerau-Levenshtein distance – between two strings.

This is the number of changes needed to change one string into another (insertions, deletions or substitutions of a single character, or transpositions of two adjacent characters).

This implementation is based on the Apache Commons Lang implementation of the Levenshtein distance, only adding support for transpositions.

Note that this is the distance used in Lucene for FuzzyTermsEnum. Lucene itself has an implementation of this algorithm, but it is much less efficient in terms of space (also note that Lucene's implementation does not return the distance, but a similarity score based on it).

Parameters:

s - the first string, must not be null.

t - the second string, must not be null.

Returns:

The Optimal string alignment distance between the two strings.

Throws:

IllegalArgumentException - if either String input is null.

See Also:

StringUtils.getLevenshteinDistance(String, String), LuceneLevenshteinDistance