Alternatives and similar repositories for bktree:

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

• pytries / hat-trie
  HAT-Trie for Python
  ☆86Updated 9 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 7 years ago
• ikegami-yukino / madoka-python
  Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)
  ☆26Updated 6 years ago
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆85Updated last month
• JDonner / NoAho
  Non-Overlapping Aho-Corasick Python extension, for Python 2 (str and unicode) and Python 3
  ☆51Updated 9 years ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆80Updated 9 months ago
• pombredanne / SimSearch
  Implementation of Bayesian Sets for fast similarity searches.
  ☆14Updated 13 years ago
• veelion / python-farmhash
  Python bindings for the Google's FarmHash
  ☆38Updated 5 months ago
• nushio3 / practice
  ☆28Updated 5 years ago
• katakombi / rnnlm
  Recurrent Neural Network language modeling toolkit
  ☆38Updated 11 years ago
• sloria / textblob-aptagger
  *Deprecated* A fast and accurate part-of-speech tagger for TextBlob.
  ☆102Updated 9 years ago
• AWNystrom / DiskDict
  A disk-based key/value store in Python with no dependencies.
  ☆21Updated 9 years ago
• piskvorky / sparsesvd
  Python wrapper around SVDLIBC, a fast library for sparse Singular Value Decomposition
  ☆55Updated 11 years ago
• Guangyi-Z / py-aho-corasick
  A pure Python implementation of Aho-Corasick algorithm.
  ☆22Updated 6 years ago
• dokipen / whoosh
  unofficial git mirror of http://svn.whoosh.ca svn repo
  ☆49Updated 15 years ago
• dedupeio / affinegap
  A Cython implementation of the affine gap string distance
  ☆57Updated 2 years ago
• briangu / chord
  distributed word2vec in Chapel using adagrad
  ☆16Updated 8 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
• WladimirSidorenko / CRFSuite
  Tree-Structured, First- and Higher-Order Linear Chain, and Semi-Markov CRFs
  ☆45Updated 5 years ago
• clips / MBSP
  Memory-based shallow parser for Python
  ☆73Updated 5 years ago
• zopefoundation / BTrees
  ☆81Updated 5 months ago
• piskvorky / gensim-simserver
  [NO LONGER MAINTAINED AS OPEN SOURCE - USE SCALETEXT.COM INSTEAD]
  ☆108Updated 11 years ago
• rohit-jain / parzer
  Statistical Dependency Parser using SVM as proposed by Yamada et al
  ☆29Updated 9 years ago
• paulsmith / templatemaker
  templatemaker is a Python library that can extract data from files with a similar format, like HTML pages.
  ☆63Updated 4 years ago
• hickeroar / simplebayes
  A memory-based, optional-persistence naïve bayesian text classifier.
  ☆36Updated 9 years ago
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆109Updated 9 years ago
• seomoz / simhash-db-py
  Python API for Various DB-Backed Simhash Clusters
  ☆64Updated 7 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
• davidjurgens / similarity-tutorial
  A collection of documents and materials for the EMNLP-2015 Semantic Similarity tutorial
  ☆30Updated 9 years ago