julesjacobs / levenshteinLinks
A simple proof of concept levenshtein automaton in Python
☆109Updated 9 years ago
Alternatives and similar repositories for levenshtein
Users that are interested in levenshtein are comparing it to the libraries listed below
Sorting:
- Finite state dictionaries in Java☆130Updated 3 years ago
- Various utilities regarding Levenshtein transducers.☆68Updated 4 years ago
- HAT-Trie for Python☆86Updated 9 years ago
- Fast directed acyclic word graph generator☆91Updated 6 years ago
- Open-Source Information Retrieval Reproducibility Challenge☆50Updated 9 years ago
- Search for similar short strings☆52Updated 4 years ago
- Solr Dictionary Annotator (Microservice for Spark)☆71Updated 5 years ago
- Roaring Bitmap in Cython☆81Updated last year
- SymSpellCompound: compound aware automatic spelling correction☆66Updated 7 years ago
- Lightning fast spell correction / fuzzy search library based on SymSpell by Commerce-Experts☆81Updated 6 years ago
- SimString☆113Updated 4 years ago
- Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering☆74Updated 3 years ago
- A RESTful web service that runs microtasks across multiple crowds, provides quality control techniques, and is easily extensible.☆51Updated 7 years ago
- Code for "Performance shootout between nearest-neighbour libraries": http://radimrehurek.com/2013/11/performance-shootout-of-nearest-neig…☆99Updated 9 years ago
- Keyvi - a key value index that powers Cliqz search engine. It is an in-memory FST-based data structure highly optimized for size and look…☆177Updated 6 years ago
- *Deprecated* A fast and accurate part-of-speech tagger for TextBlob.☆102Updated 9 years ago
- Implementation of Bayesian Sets for fast similarity searches.☆14Updated 13 years ago
- A bunch of fancy soft string matching routines, with some accompanying datasets☆56Updated 7 years ago
- A tool to segment text based on frequencies and the Viterbi algorithm "#TheBoyWhoLived" => ['#', 'The', 'Boy', 'Who', 'Lived']☆81Updated 9 years ago
- A collection of succinct data structures☆202Updated last year
- ☆27Updated 9 years ago
- C++ Ternary Search Tree implementation with Python bindings☆43Updated 7 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- A library of inverted index data structures☆148Updated 2 years ago
- A C++ library providing fast language model queries in compressed space.☆129Updated 2 years ago
- The BLOG programming language☆98Updated 2 years ago
- A fast Python implementation of locality sensitive hashing.☆70Updated 10 years ago
- Forever incomplete suite of tools for an orthographic/grammatical checker☆28Updated 5 years ago
- ☆92Updated 9 years ago