You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Enable library to calculate the length of the longest common subsequence (LCS).
LCS distance is equivalent to Levenshtein distance when only insertion and deletion is allowed (no substitution), or when the cost of the substitution is the double of the cost of an insertion or deletion.
Enable library to calculate the length of the longest common subsequence (LCS).
See: https://github.com/luozhouyang/python-string-similarity/blob/master/README.md#longest-common-subsequence
The text was updated successfully, but these errors were encountered: