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 uses the Smith–Waterman algorithm to measure the similarity between two strings. The Smith–Waterman algorithm performs local alignment, identifying the most similar subsequences between the two strings rather than aligning them across their entire lengths.

This function requires three parameters:

• Match score
• Mismatch score
• Insertion/Deletion (gap) score

These parameters allow different weights to be assigned to matches, mismatches, insertions, and deletions, making the function especially useful for advanced string similarity measurements.

After aligning the two strings, the similarity is calculated by counting the matching characters in the aligned subsequences.

The algorithm’s time complexity is O(n²)