benhoyt / pybktreeLinks
Python BK-tree data structure to allow fast querying of "close" matches
☆187Updated 4 years ago
Alternatives and similar repositories for pybktree
Users that are interested in pybktree are comparing it to the libraries listed below
Sorting:
- DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.☆305Updated last year
- A simple fuzzy matching set for python strings☆230Updated last year
- Levenshtein and Hamming distance computation☆117Updated 6 years ago
- A module for getting data into python from large data sources☆176Updated last year
- 💥 Cython hash tables that assume keys are pre-hashed☆87Updated 2 months ago
- Python library to calculate the difference hash (perceptual hash) for a given image, useful for detecting duplicates☆374Updated last year
- A fast and memory-optimized string library for heavy-text manipulation in Python☆251Updated 5 years ago
- Fast multi-keyword search engine for text strings☆258Updated last year
- Python library for handling efficiently sorted integer sets.☆228Updated 2 weeks ago
- Roaring Bitmap in Cython☆82Updated last year
- Find strings/words in text; convenience and C speed☆126Updated 3 years ago
- pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.☆250Updated 4 months ago
- Implementation of perceptual image hash calculation in Python☆130Updated 2 years ago
- A Cython implementation of the affine gap string distance☆57Updated 3 years ago
- Python bindings for the SQLite4 LSM database.☆132Updated last month
- The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity☆389Updated 3 years ago
- All-pair set similarity search on millions of sets in Python and on a laptop☆604Updated 3 years ago
- Implement SQLite table-valued functions with Python☆59Updated 2 years ago
- Fast Autocomplete: When Elastcsearch suggestions are not fast and flexible enough☆287Updated 5 months ago
- A pipeline abstraction for Python☆168Updated 4 years ago
- A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.☆54Updated 2 years ago
- Fast, efficiently stored Trie for Python. Uses libdatrie.☆547Updated last month
- Weighted Levenshtein library☆113Updated 2 months ago
- Python Set subclass that supports searching by ngram similarity☆119Updated 4 years ago
- Python stream processing for humans☆189Updated 3 weeks ago
- Python package for an open-source graph database Cayley☆157Updated 6 years ago
- persistent caching to memory, disk, or database☆278Updated 2 weeks ago
- Regular Expression based parsers for extracting data from natural languages☆71Updated 8 years ago
- A high performance python hash table library that is generally faster and consumes significantly less memory than Python Dictionaries☆214Updated 2 years ago
- 145+ extra higher-level functional tools beyond standard library's `itertools`, `functools`, etc. and popular third-party libraries like …☆162Updated 8 months ago