Alternatives and similar repositories for bktree

Users that are interested in bktree are comparing it to the libraries listed below

• nlehuen / pytst
  C++ Ternary Search Tree implementation with Python bindings
  ☆43Updated 7 years ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆86Updated 9 years ago
• JDonner / NoAho
  Non-Overlapping Aho-Corasick Python extension, for Python 2 (str and unicode) and Python 3
  ☆51Updated 9 years ago
• nushio3 / practice
  ☆28Updated 5 years ago
• mattandahalfew / Levenshtein_search
  Python search module for fast approximate string matching
  ☆54Updated 2 years ago
• jwplayer / jwalk
  Cython implementation of DeepWalk
  ☆54Updated last year
• piskvorky / sparsesvd
  Python wrapper around SVDLIBC, a fast library for sparse Singular Value Decomposition
  ☆55Updated 11 years ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆81Updated 11 months ago
• katakombi / rnnlm
  Recurrent Neural Network language modeling toolkit
  ☆38Updated 11 years ago
• jimmycallin / pydsm
  A Python framework for exploring distributional semantic models.
  ☆85Updated 9 years ago
• dokipen / whoosh
  unofficial git mirror of http://svn.whoosh.ca svn repo
  ☆49Updated 15 years ago
• embr / lsh
  A pure python implementation of locality sensitive hashing for text documents
  ☆85Updated 9 years ago
• piskvorky / sim-shootout
  Code for "Performance shootout between nearest-neighbour libraries": http://radimrehurek.com/2013/11/performance-shootout-of-nearest-neig…
  ☆99Updated 9 years ago
• sloria / textblob-aptagger
  *Deprecated* A fast and accurate part-of-speech tagger for TextBlob.
  ☆102Updated 9 years ago
• veelion / python-farmhash
  Python bindings for the Google's FarmHash
  ☆38Updated 8 months ago
• guokr / gkseg
  Yet another Chinese word segmentation package based on character-based tagging heuristics and CRF algorithm
  ☆245Updated 12 years ago
• Houzz / annoy2
  ☆26Updated 8 years ago
• piskvorky / gensim-simserver
  [NO LONGER MAINTAINED AS OPEN SOURCE - USE SCALETEXT.COM INSTEAD]
  ☆108Updated 11 years ago
• benhoyt / pybktree
  Python BK-tree data structure to allow fast querying of "close" matches
  ☆183Updated 3 years ago
• dedupeio / affinegap
  A Cython implementation of the affine gap string distance
  ☆57Updated 2 years ago
• WladimirSidorenko / CRFSuite
  Tree-Structured, First- and Higher-Order Linear Chain, and Semi-Markov CRFs
  ☆45Updated 5 years ago
• craffel / lstm_benchmarks
  Benchmarking different LSTM libraries
  ☆24Updated 9 years ago
• fnl / patricia-trie
  a pure-Python PATRICIA trie implementation.
  ☆30Updated 10 years ago
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆109Updated 9 years ago
• mokelly / wabbit_wappa
  Wabbit Wappa is a full-featured Python wrapper for the Vowpal Wabbit machine learning utility.
  ☆101Updated 7 years ago
• ikegami-yukino / madoka-python
  Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)
  ☆26Updated 6 years ago
• lateral / hyperplane-hasher
  Implementation of an algorithm computing the nearest "N" neighbours to a vector, using a collection of hyperplane hashers.
  ☆30Updated 9 years ago
• gwulfs / Bastien-Theano-Workshop
  ☆44Updated 9 years ago
• hickeroar / simplebayes
  A memory-based, optional-persistence naïve bayesian text classifier.
  ☆36Updated 10 years ago
• maumueller / ann-benchmarks
  Benchmarking approximate nearest neighbors. Note: This is an archived version from our SISAP 2017 paper, see below.
  ☆27Updated 7 years ago