Icon

Simple Fuzzy Match Example

This workflow reads in a series of misspelled retailer names, along with the desired version of the names. Using the Similarity Search node, the closest correctly spelled name is matched based on Levenshtein distance.

A simple workflow to demonstrate fuzzy matching using Levenshtein distance via the Similarity Search node.

Original workflow:

https://hub.knime.com/s/ThRepmnmDMB96tkl
Misspelled names
Table Creator
Correct names
Table Creator
Levenshtein distance
Similarity Search
Counter for matching
Counter Generation
Join with counter to return correct match
Joiner (deprecated)
Join withcounter toreturn correctmatch
Joiner

Nodes

Extensions

Links

Download

To use this workflow in KNIME, download it from the below URL and open it in KNIME:

Download Workflow
Created by: ScottFincher
Created at: 2020-09-04
On NodePit since: 2025-08-18
Last update: 2025-08-18
Created with KNIME version: v5.6.1
Tags: Fuzzy MatchSimilarityLevenshtein

Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.

Try NodePit Runner!