I am trying to use the BK-tree data structure in python to store a corpus with ~10 billion entries (1e10) in order to implement a fast fuzzy search engine. Once I add over ~10 million (1e7) values ...

I have seen many different implementations of BK Trees in many different languages, and literally none of them seem to include a way to remove nodes from the tree. Even the original article where ...

I am looking into using an Edit Distance algorithm to implement a fuzzy search in a name database. I've found a data structure that will supposedly help speed this up through a divide and conquer ...

I'm implementing a BK-Tree in Cython. For one million items, the search time is too long! It's ~30 seconds :( Here is my Cython code: # -*- coding: UTF-8 -*- from itertools import imap from PI...