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
  ☆257Updated last year
• pytries / datrie
  Fast, efficiently stored Trie for Python. Uses libdatrie.
  ☆540Updated 3 weeks ago
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 4 years ago
• wharris / esmre
  Python extension module for accelerating regular expressions using libesm
  ☆132Updated last year
• facebook / pyre2
  Python wrapper for RE2
  ☆645Updated last year
• axiak / pyre2
  Python wrapper for RE2
  ☆297Updated 2 years ago
• pyenchant / pyenchant
  spellchecking library for python
  ☆614Updated last week
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆303Updated last year
• flier / pyfasthash
  Python Non-cryptographic Hash Library
  ☆287Updated 2 years ago
• scrapinghub / python-simhash
  An efficient simhash implementation for python
  ☆126Updated 5 years ago
• axiak / fuzzyset
  A simple fuzzy matching set for python strings
  ☆230Updated last year
• 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
• davidmogar / cucco
  Text normalization library for Python
  ☆203Updated 7 years ago
• shibukawa / snowball_py
  Snowball stemming library collection for Python
  ☆121Updated 6 years ago
• hajimes / mmh3
  Python extension for MurmurHash (MurmurHash3), a set of fast and robust hash functions.
  ☆350Updated last week
• intake / python-snappy
  Python bindings for the snappy google library
  ☆484Updated 11 months ago
• pytries / marisa-trie
  Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.
  ☆1,110Updated 2 weeks ago
• lanl / pyxDamerauLevenshtein
  pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
  ☆249Updated last week
• bcj / AttrDict
  A dictionary that allows attribute-style access.
  ☆273Updated 6 years ago
• google / python-subprocess32
  A backport of the Python 3 subprocess module for use on Python 2.
  ☆173Updated 5 years ago
• axiak / pybloomfiltermmap
  Fast Python Bloom Filter using Mmap
  ☆745Updated 5 years ago
• scrapy / queuelib
  Collection of persistent (disk-based) and non-persistent (memory-based) queues for Python
  ☆282Updated last month
• google / pygtrie
  Python library implementing a trie data structure.
  ☆825Updated 4 years ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆86Updated 9 years ago
• doukremt / distance
  Levenshtein and Hamming distance computation
  ☆116Updated 5 years ago
• iki / unidecode
  Unicode transliteration in Python (clone of Tomaž Šolc repository at zemanta.com)
  ☆114Updated 9 years ago
• ztane / python-Levenshtein
  The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
  ☆1,279Updated 4 years ago
• stucchio / Python-LRU-cache
  An in-memory LRU cache for python
  ☆154Updated 4 years ago
• google / sre_yield
  Python module to generate regular all expression matches
  ☆185Updated 10 months ago