the cost for DistanceMatrix(i, j)
the edit distance between 2 strings
the cost of an insertion or deletion
the longest common subsequence of letters between the 2 strings
the lower cost and associated operation of a deletion, substitution or insertion in case of equality between a non-substitution and an insertion/suppression we select the insertion/suppression in order to group all the differences together diff("abcd", "acbd") ==> ("a[bc]d", "a[cb]d"). the distance is 2, otherwise diff("abcd", "acbd") ==> ("a[b]c[]d", "a[c]b[]d")
show the distance between 2 strings by enclosing them with separators
show the distance between 2 strings
prints the edit matrix of the 2 strings
separators are used to highlight differences.
separators are used to highlight differences. If sep is empty, then no separator is used. If sep contains one character, it is taken as the unique separator. If sep contains 2 or more characters, half of them are taken for the opening separator and the rest for the closing separator.
a (String, String) displaying the differences between each input strings. The used separators are specified by the caller.
the cost of a substitution
Edit matrix for 2 given strings