5th November 2017 - Link Blog
Super Fast String Matching in Python (via) Interesting technique for calculating string similarity at scale in Python, with much better performance than Levenshtein distances. The trick here uses TF/IDF against N-Grams, plus a CSR (Compressed Sparse Row) scipy matrix to run the calculations. Includes clear explanations of each of these concepts.
Recent articles
- The Pelican comparison grid for Astra is pretty interesting - 4th September 2026
- OpenAI's rogue agents were caught communicating via public wikis - 4th September 2026
- Claude's new system prompt really doesn't want to reproduce song lyrics - 2nd September 2026