BK-trees, a clever indexing structure that makes it possible to search for fuzzy matches on a text string based on Levenshtein distance - or any other metric that obeys the triangle inequality.
Related
Algorithms
Note ·
Algorithm Visualizer Success stories 14,000x Speedup - James Hiebert's Blog; Sep 2015; HN Applying Textbook Data…
Notes on Randomized Algorithms (PDF)
cs.yale.edu · · Page
by Aspnes
Graph Coloring Methods
graphcoloringmethods.com · · Page
the Gilbert–Johnson–Keerthi algorithm explained as simply as possible
computerwebsite.net · · Page
A First Course on Data Structures in Python — ds2 0.2.0 documentation
donsheehy.github.io · · Page
Via this tweet / meme - https://x.com/Nexuist/status/1766320152608453098
6.886 Graph Analytics Spring 2018
people.csail.mit.edu · · Page
Graph analytics have applications in a variety of domains, such as social network and Web analysis, computational…