The String Matcher node is able to compare two lists of strings, compute the distance between these strings and list the most similar strings in the output table. The node requires two input data tables. A data table containing the strings to compare and a data table containing a dictionary. The String Matcher finds for each element of the data table the most similar words in the dictionary table. To compare the elements the levenshtein-damerau-distance is used. This function calculates how many insertions, deletions, changing and swappings are at least necessary to change one word into another. To find an optimal solution it is necessary that the weight of two switches is greater or equal than the weight of an insert and a deletion.
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.