Another approach here might be to use the Similarity Search node with Levenshtein distance - you feed the misspellings to the top port and your dictionary to the middle port, and let the node find the best match.
I just made a simple workflow (based on an exercise from our L1-DW course) that uses your data: