search

usnistgov / nestor-tmp2

Quantifying tacit knowledge for investigatory analysis
Other
9 stars 5 forks source link

Use bktree to speedup pairwise search #29

Open rtbs-dev opened 6 years ago

rtbs-dev commented 6 years ago

BKtree can accept arbitrary distance functions, incl. fuzzywuzzy, in theory. This could speedup searches and remove the need for the "first-letter-match" heuristic.

rtbs-dev commented 5 years ago

Will probably delay this to future releases, and may become obsolete with potential web-based version of the future.