Alternatives and similar repositories for bktree

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

• JDonner / NoAho
  Non-Overlapping Aho-Corasick Python extension, for Python 2 (str and unicode) and Python 3
  ☆51Updated 10 years ago
• mattandahalfew / Levenshtein_search
  Python search module for fast approximate string matching
  ☆54Updated 2 years ago
• nlehuen / pytst
  C++ Ternary Search Tree implementation with Python bindings
  ☆43Updated 8 years ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆87Updated 9 years ago
• embr / lsh
  A pure python implementation of locality sensitive hashing for text documents
  ☆86Updated 10 years ago
• sloria / textblob-aptagger
  *Deprecated* A fast and accurate part-of-speech tagger for TextBlob.
  ☆101Updated 10 years ago
• piskvorky / sparsesvd
  Python wrapper around SVDLIBC, a fast library for sparse Singular Value Decomposition
  ☆55Updated 12 years ago
• WladimirSidorenko / CRFSuite
  Tree-Structured, First- and Higher-Order Linear Chain, and Semi-Markov CRFs
  ☆45Updated 6 years ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆82Updated last year
• pytries / datrie
  Fast, efficiently stored Trie for Python. Uses libdatrie.
  ☆545Updated 2 weeks ago
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆108Updated 10 years ago
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆148Updated last year
• WojciechMula / aspell-python
  Python wrapper for aspell (C extension and python version)
  ☆82Updated 2 years ago
• jimmycallin / pydsm
  A Python framework for exploring distributional semantic models.
  ☆85Updated 9 years ago
• willf / segment
  A tool to segment text based on frequencies and the Viterbi algorithm "#TheBoyWhoLived" => ['#', 'The', 'Boy', 'Who', 'Lived']
  ☆81Updated 9 years ago
• syllog1sm / redshift
  Transition-based statistical parser
  ☆417Updated 8 years ago
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆87Updated last week
• AWNystrom / DiskDict
  A disk-based key/value store in Python with no dependencies.
  ☆21Updated 10 years ago
• rohit-jain / parzer
  Statistical Dependency Parser using SVM as proposed by Yamada et al
  ☆29Updated 9 years ago
• piskvorky / sim-shootout
  Code for "Performance shootout between nearest-neighbour libraries": http://radimrehurek.com/2013/11/performance-shootout-of-nearest-neig…
  ☆98Updated 10 years ago
• go2starr / lshhdc
  LSH based high dimensional clustering for sets and points
  ☆80Updated 11 years ago
• piskvorky / gensim-simserver
  [NO LONGER MAINTAINED AS OPEN SOURCE - USE SCALETEXT.COM INSTEAD]
  ☆107Updated 12 years ago
• Sentimentron / Dracula
  A deep, LSTM-based part of speech tagger and sentiment analyser using character embeddings instead of words. Compatible with Theano and T…
  ☆92Updated 8 years ago
• simonemainardi / LSHash
  A fast Python implementation of locality sensitive hashing.
  ☆71Updated 10 years ago
• dedupeio / affinegap
  A Cython implementation of the affine gap string distance
  ☆57Updated 2 years ago
• pombredanne / SimSearch
  Implementation of Bayesian Sets for fast similarity searches.
  ☆14Updated 14 years ago
• lyst / rpforest
  It is a forest of random projection trees
  ☆224Updated 5 years ago
• eyadsibai / brute-force-plotter
  Tool to visualize data quickly with no brain usage for plot creation
  ☆47Updated last month
• commonsense / divisi2
  A Python library for learning from dimensionality reduction, supporting sparse and dense matrices.
  ☆78Updated 8 years ago
• katakombi / rnnlm
  Recurrent Neural Network language modeling toolkit
  ☆38Updated 11 years ago