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.
This is a companion discussion topic for the original entry at https://kni.me/w/wJStevOotpO7flas