Alternatives and similar repositories for python-Levenshtein

Users that are interested in python-Levenshtein are comparing it to the libraries listed below

• scoder / acora
  Fast multi-keyword search engine for text strings
  ☆256Updated 11 months ago
• wharris / esmre
  Python extension module for accelerating regular expressions using libesm
  ☆132Updated last year
• scrapinghub / python-simhash
  An efficient simhash implementation for python
  ☆126Updated 5 years ago
• pytries / datrie
  Fast, efficiently stored Trie for Python. Uses libdatrie.
  ☆537Updated last year
• axiak / pyre2
  Python wrapper for RE2
  ☆297Updated 2 years ago
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆303Updated last year
• facebook / pyre2
  Python wrapper for RE2
  ☆644Updated last year
• lanl / pyxDamerauLevenshtein
  pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
  ☆247Updated last month
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 3 years ago
• flier / pyfasthash
  Python Non-cryptographic Hash Library
  ☆286Updated 2 years ago
• shibukawa / snowball_py
  Snowball stemming library collection for Python
  ☆121Updated 6 years ago
• pytries / marisa-trie
  Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.
  ☆1,099Updated 2 weeks ago
• ztane / python-Levenshtein
  The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
  ☆1,277Updated 4 years ago
• abusix / ahocorapy
  Pure python Aho-Corasick library.
  ☆217Updated 2 years ago
• pyenchant / pyenchant
  spellchecking library for python
  ☆611Updated last year
• google / pygtrie
  Python library implementing a trie data structure.
  ☆824Updated 4 years ago
• WojciechMula / aspell-python
  Python wrapper for aspell (C extension and python version)
  ☆82Updated 2 years ago
• scrapy / queuelib
  Collection of persistent (disk-based) and non-persistent (memory-based) queues for Python
  ☆282Updated last month
• doukremt / distance
  Levenshtein and Hamming distance computation
  ☆116Updated 5 years ago
• isagalaev / ijson
  Iterative JSON parser with Pythonic interface
  ☆628Updated 5 years ago
• axiak / fuzzyset
  A simple fuzzy matching set for python strings
  ☆229Updated last year
• hajimes / mmh3
  Python extension for MurmurHash (MurmurHash3), a set of fast and robust hash functions.
  ☆347Updated 3 weeks ago
• benhoyt / pybktree
  Python BK-tree data structure to allow fast querying of "close" matches
  ☆185Updated 3 years ago
• celery / billiard
  Multiprocessing Pool Extensions
  ☆426Updated 3 months ago
• andreasvc / pyre2
  Python wrapper for RE2
  ☆103Updated this week
• dokipen / whoosh
  unofficial git mirror of http://svn.whoosh.ca svn repo
  ☆49Updated 15 years ago
• jlhutch / pylru
  A least recently used (LRU) cache for Python
  ☆223Updated last year
• grantjenks / python-wordsegment
  English word segmentation, written in pure-Python, and based on a trillion-word corpus.
  ☆376Updated 2 years ago
• axiak / pybloomfiltermmap
  Fast Python Bloom Filter using Mmap
  ☆744Updated 5 years ago
• django-haystack / pysolr
  Pysolr — Python Solr client
  ☆681Updated last week