A JavaScript implementation of a Burkhard-Keller Tree (BK-Tree)
As an example, a common strategy for de-duplicating images is to compute perceptual hashes for each of the images and compare those hashes with each other. Such hashes are small compared with the images (often 32, 64, 128 bits). If the hashing function is
Burkhard-Keller Tree (BK-Tree) JavaScript implements
A JavaScript implementation of a Burkhard-Keller Tree (BK-Tree)
Simple, zero dependency, type-safe implementation of a BK-Tree data structure.
A highly efficient, isomorphic, full-featured, multilingual text search engine library, providing full-text search, fuzzy matching, phonetic scoring, document indexing and more, with micro JSON state hydration/dehydration in-browser and server-side.
Balochi spellchecker using BK-tree and Levenshtein distance
BK-tree datastructure
Articulatory Moment Transform — language-agnostic phonetic name matching
Burkhard-Keller tree data structure for finding items separated by a small discrete distance
A Rust BK-tree implementation
collections for fuzzy search