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
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public Integer | Returns: distance.first character sequence. left, final CharSequence second character sequence. right)Implements org. Calculates an edit distance between two |
| LongestCommonSubsequenceDistance | back to summary |
|---|---|
| public LongestCommonSubsequenceDistance() Creates a new instance. | |
| apply | back to summary |
|---|---|
| public Integer apply(final CharSequence left, final CharSequence right) Implements org. Calculates an edit distance between two
| |