BKTree
A very simple illustration of a Burkhard-Keller tree in node. BK trees are ideal for applications involving O(log n) searches of values defined by a metric space -- e.g., fuzzy image matching, word predictions, or typo correction.
This instance creates a BK tree of words using the Levenshtein distance as its metric.
node index.js --words wordFile --term searchTerm --dist maxDistance [--debug [--show-tree]]
Thanks To
This blog post is great.
Initial inspiration is this thing on images.
License
MIT