A python implementation of bk trees and Levenshtein distances
-
Updated
Sep 21, 2018 - Python
A python implementation of bk trees and Levenshtein distances
Simple spell checker using Levenshtein Distance and BK Trees
An application to suggest best matched places from OpenStreetMap, for your input place name.
Tool for managing data-deduplication within extant compressed archive files, along with a relatively performant BK tree implementation for fuzzy image searching.
Add a description, image, and links to the bk-tree topic page so that developers can more easily learn about it.
To associate your repository with the bk-tree topic, visit your repo's landing page and select "manage topics."