roy-ht / editdistanceLinks
Fast implementation of the edit distance(Levenshtein distance)
☆690Updated last year
Alternatives and similar repositories for editdistance
Users that are interested in editdistance are comparing it to the libraries listed below
Sorting:
- Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.☆1,115Updated 2 weeks ago
- The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity☆1,276Updated 4 years ago
- Python module (C extension and plain python) implementing Aho-Corasick algorithm☆1,048Updated last week
- Python port of Moses tokenizer, truecaser and normalizer☆495Updated last year
- Python library implementing a trie data structure.☆824Updated 4 years ago
- pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.☆250Updated 2 months ago
- English word segmentation, written in pure-Python, and based on a trillion-word corpus.☆378Updated 2 years ago
- spellchecking library for python☆614Updated 2 months ago
- Fast, efficiently stored Trie for Python. Uses libdatrie.☆545Updated 3 weeks ago
- 🐍💯pySBD (Python Sentence Boundary Disambiguation) is a rule-based sentence boundary detection that works out-of-the-box.☆887Updated last year
- Find parts of long text or data, allowing for some changes/typos.☆333Updated 3 weeks ago
- A python binding for crfsuite☆772Updated 3 months ago
- Python Set subclass that supports searching by ngram similarity☆119Updated 4 years ago
- ☆176Updated 8 months ago
- CRFsuite: a fast implementation of Conditional Random Fields (CRFs)☆665Updated last year
- Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm…☆850Updated 2 weeks ago
- Python library for computing edit distance between arbitrary Python sequences.☆103Updated 2 weeks ago
- The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity☆389Updated 3 years ago
- DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.☆304Updated last year
- Fast BPE☆678Updated last year
- Python stemming library using snowball stemmers☆268Updated 3 months ago
- Python implementation of Suffix Trees and Generalized Suffix Trees.☆127Updated 5 years ago
- Pre-trained subword embeddings in 275 languages, based on Byte-Pair Encoding (BPE)☆1,217Updated last year
- Python3 bindings for the Compact Language Detector v3 (CLD3)☆155Updated 2 years ago
- Weighted Levenshtein library☆113Updated 2 years ago
- A Fast Levenshtein Distance Library for Python☆85Updated 9 months ago
- scikit-learn inspired API for CRFsuite☆432Updated 2 years ago
- Python, Java implementation of TS-SS called from "A Hybrid Geometric Approach for Measuring Similarity Level Among Documents and Document…☆300Updated 6 years ago
- terashuf shuffles multi-terabyte text files using limited memory☆226Updated 2 years ago
- Calculates Word Mover's Distance Insanely Fast☆462Updated 2 years ago