Note: This was originally posted by an inactive account. Content was preserved by moving under an admin account.
Originally posted by: ryehTwo things you could do that are easy:
1. Remove all non-alphanumeric characters.
2. Make everything uppercase so Abc matches ABC.
You may also want to use the Fuzzy Join/X-Ref nodes. The Levenshtein Distance algorithm allows two strings to match if they are within 'n' edits of another.
Attachments:
matching.brg