Alternatives and similar repositories for pygtrie

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

• pytries / marisa-trie
  Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.
  ☆1,081Updated 2 weeks ago
• pytries / datrie
  Fast, efficiently stored Trie for Python. Uses libdatrie.
  ☆537Updated last year
• facebook / pyre2
  Python wrapper for RE2
  ☆644Updated last year
• isagalaev / ijson
  Iterative JSON parser with Pythonic interface
  ☆622Updated 5 years ago
• pyenchant / pyenchant
  spellchecking library for python
  ☆609Updated 11 months ago
• 1e0ng / simhash
  A Python Implementation of Simhash Algorithm
  ☆1,013Updated 3 years ago
• WojciechMula / pyahocorasick
  Python module (C extension and plain python) implementing Aho-Corasick algorithm
  ☆1,001Updated last year
• jaybaird / python-bloomfilter
  Scalable Bloom Filter implemented in Python
  ☆1,622Updated 3 years ago
• grantjenks / python-wordsegment
  English word segmentation, written in pure-Python, and based on a trillion-word corpus.
  ☆375Updated 2 years ago
• amitdev / lru-dict
  A fast and memory efficient LRU cache for Python
  ☆275Updated last week
• lanl / pyxDamerauLevenshtein
  pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
  ☆247Updated last year
• scrapinghub / python-crfsuite
  A python binding for crfsuite
  ☆773Updated 8 months ago
• scoder / acora
  Fast multi-keyword search engine for text strings
  ☆255Updated 8 months ago
• flier / pyfasthash
  Python Non-cryptographic Hash Library
  ☆284Updated last year
• abusix / ahocorapy
  Pure python Aho-Corasick library.
  ☆215Updated 2 years ago
• miohtama / python-Levenshtein
  The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
  ☆387Updated 2 years ago
• axiak / pybloomfiltermmap
  Fast Python Bloom Filter using Mmap
  ☆744Updated 5 years ago
• roy-ht / editdistance
  Fast implementation of the edit distance(Levenshtein distance)
  ☆685Updated last year
• caesar0301 / treelib
  An efficient implementation of tree data structure in pure python.
  ☆831Updated last week
• seomoz / simhash-py
  Simhash and near-duplicate detection
  ☆415Updated 2 years ago
• DanielStutzbach / blist
  A list-like type with better asymptotic performance and similar performance on small lists
  ☆314Updated 2 years ago
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆302Updated 11 months ago
• ztane / python-Levenshtein
  The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
  ☆1,272Updated 3 years ago
• quora / asynq
  Python library for asynchronous programming
  ☆693Updated last month
• google / sre_yield
  Python module to generate regular all expression matches
  ☆186Updated 6 months ago
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 3 years ago
• aboSamoor / pycld2
  ☆171Updated 2 months ago
• pinterest / pymemcache
  A comprehensive, fast, pure-Python memcached client.
  ☆797Updated this week
• facebookresearch / pysparnn
  Approximate Nearest Neighbor Search for Sparse Data in Python!
  ☆919Updated 4 years ago
• pydanny / cached-property
  A decorator for caching properties in classes.
  ☆706Updated 5 months ago