Class LongestCommonSubsequenceDistance
java.lang.Object
org.apache.commons.text.similarity.LongestCommonSubsequenceDistance
- All Implemented Interfaces:
EditDistance<Integer>
,SimilarityScore<Integer>
public class LongestCommonSubsequenceDistance extends Object implements EditDistance<Integer>
An edit distance algorithm based on the length of the longest common subsequence between two strings.
This code is directly based upon the implementation in LongestCommonSubsequence
.
For reference see: https://en.wikipedia.org/wiki/Longest_common_subsequence_problem.
For further reading see:
Lothaire, M. Applied combinatorics on words. New York: Cambridge U Press, 2005. 12-13
- Since:
- 1.0
-
Constructor Summary
Constructors Constructor Description LongestCommonSubsequenceDistance()
-
Method Summary
Modifier and Type Method Description Integer
apply(CharSequence left, CharSequence right)
Calculates an edit distance between twoCharSequence
'sleft
andright
as:left.length() + right.length() - 2 * LCS(left, right)
, whereLCS
is given inLongestCommonSubsequence.apply(CharSequence, CharSequence)
.
-
Constructor Details
-
LongestCommonSubsequenceDistance
public LongestCommonSubsequenceDistance()
-
-
Method Details
-
apply
Calculates an edit distance between twoCharSequence
'sleft
andright
as:left.length() + right.length() - 2 * LCS(left, right)
, whereLCS
is given inLongestCommonSubsequence.apply(CharSequence, CharSequence)
.- Specified by:
apply
in interfaceEditDistance<Integer>
- Specified by:
apply
in interfaceSimilarityScore<Integer>
- Parameters:
left
- first character sequenceright
- second character sequence- Returns:
- distance
- Throws:
IllegalArgumentException
- if either String inputnull
-