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 8 years ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆87Updated 10 years ago
• mattandahalfew / Levenshtein_search
  Python search module for fast approximate string matching
  ☆54Updated 3 years ago
• AWNystrom / DiskDict
  A disk-based key/value store in Python with no dependencies.
  ☆21Updated 10 years ago
• WladimirSidorenko / CRFSuite
  Tree-Structured, First- and Higher-Order Linear Chain, and Semi-Markov CRFs
  ☆45Updated 6 years ago
• embr / lsh
  A pure python implementation of locality sensitive hashing for text documents
  ☆87Updated 10 years ago
• sloria / textblob-aptagger
  *Deprecated* A fast and accurate part-of-speech tagger for TextBlob.
  ☆101Updated 10 years ago
• JDonner / NoAho
  Non-Overlapping Aho-Corasick Python extension, for Python 2 (str and unicode) and Python 3
  ☆51Updated 10 years ago
• piskvorky / sparsesvd
  Python wrapper around SVDLIBC, a fast library for sparse Singular Value Decomposition
  ☆55Updated 12 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
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆87Updated last month
• JonathanRaiman / wikipedia_ner
  Labeled examples from wiki dumps in Python
  ☆67Updated 9 years ago
• Guangyi-Z / py-aho-corasick
  A pure Python implementation of Aho-Corasick algorithm.
  ☆23Updated 7 years ago
• seomoz / simhash-db-py
  Python API for Various DB-Backed Simhash Clusters
  ☆64Updated 8 years ago
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆148Updated last year
• miohtama / python-Levenshtein
  The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
  ☆389Updated 3 years ago
• benhoyt / pybktree
  Python BK-tree data structure to allow fast querying of "close" matches
  ☆187Updated 4 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
• pytries / datrie
  Fast, efficiently stored Trie for Python. Uses libdatrie.
  ☆547Updated last month
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆305Updated last year
• hermanschaaf / mafan
  A toolbox for working with the Chinese language in Python
  ☆149Updated 6 years ago
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 4 years ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆82Updated last year
• ot / entity2vec
  Semantic embeddings of entities
  ☆66Updated 9 years ago
• clips / MBSP
  Memory-based shallow parser for Python
  ☆74Updated 6 years ago
• andychisholm / sift
  Knowledge extraction from web data
  ☆92Updated 7 years ago
• Houzz / annoy2
  ☆26Updated 8 years ago
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆108Updated 10 years ago
• hickeroar / simplebayes
  A memory-based, optional-persistence naïve bayesian text classifier.
  ☆36Updated 10 years ago
• rohit-jain / parzer
  Statistical Dependency Parser using SVM as proposed by Yamada et al
  ☆29Updated 10 years ago