LongestCommonSubsequenceMatcher Function

Number of input and output field

Number of input field : Two
Number of output field : One

A measure of similarity between two strings. It returns a value in the interval [0.0, 1.0], where 0.0 indicates that the two strings are completely different and 1.0 indicates that they are identical.

This transformation function finds the Longest Common Subsequence (LCS) between two strings and uses it to measure their similarity. A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.

The Longest Common Subsequence (LCS) of two sequences is the longest subsequence that is common to both sequences.

This function is best suited for determining whether one string contains the sequence of characters from another string in the same order.

A measure of similarity between two strings. It returns a value in the interval [0.0, 1.0]. A return value of 0.0 means that the two strings are completely different whereas a return value of 1.0 means that they are identical.

The algorithm’s time complexity is O(n2)