Distance definition on a string column, like for instance Levenshtein distance. Additional parameters can be set based on the selected distance function.
The Jaro-Winkler distance is a common measure for the difference between two strings. It is important to note that it is not actually a distance metric because it doesn't obey the triangle-inequality.
N-gram Tversky Distance (Tanimoto/ Dice)
In contrast to the edit distances the n-gram Tversky index does not rely on single-operation counts, instead it models relations between neighbored letters.
The Levenshtein distance is one of the famoust string metrices for measuring the difference between two strings. It is the minimum number of operations (i.e. deletions, insertions or substitutions) peformed on a single character to tranform one of the strings into the other.
You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.
A zipped version of the software site can be downloaded here.
Do you have feedback, questions, comments about NodePit, want to support this platform, or want your own nodes or workflows listed here as well? Do you think, the search results could be improved or something is missing? Then please get in touch! Alternatively, you can send us an email to firstname.lastname@example.org, follow @NodePit on Twitter, or chat on Gitter!
Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.