This workflow demonstrates how to apply a fuzzy matching of two string. The string matcher was designed exactly for this task, but is limited to the levenshtein distance.
With the support of distance matrices and the Similarity Search node, you have more option to compare strings. In the String Distance node, the distance can be chosen together with its parameters. Afterwards in the Similarity Search node you can find the closest match (e.g. the nearest neighbor) between the values from the first table to your lookup table in the second table. If provided, the node will use the distance from the distance matrix inport.
To use this workflow in KNIME, download it from the below URL and open it in KNIME:Download Workflow
Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.Try NodePit Runner!
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 botsin.space/@nodepit on Mastodon.
Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.