julesjacobs / levenshtein
A simple proof of concept levenshtein automaton in Python
☆107Updated 9 years ago
Related projects ⓘ
Alternatives and complementary repositories for levenshtein
- Finite state dictionaries in Java☆130Updated 2 years ago
- Various utilities regarding Levenshtein transducers.☆67Updated 4 years ago
- Code for "Performance shootout between nearest-neighbour libraries": http://radimrehurek.com/2013/11/performance-shootout-of-nearest-neig…☆100Updated 9 years ago
- HAT-Trie for Python☆87Updated 8 years ago
- Open-Source Information Retrieval Reproducibility Challenge☆50Updated 8 years ago
- Implementation of Bayesian Sets for fast similarity searches.☆15Updated 13 years ago
- A fast Python implementation of locality sensitive hashing.☆70Updated 9 years ago
- DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.☆300Updated 5 months ago
- Roaring Bitmap in Cython☆79Updated 6 months ago
- Elasticsearch Latent Semantic Indexing experimentation☆33Updated 5 years ago
- Lightning fast spell correction / fuzzy search library based on SymSpell by Commerce-Experts☆80Updated 6 years ago
- ☆50Updated 4 years ago
- Locality-sensitive hashing algorithm for text similarity comparisons☆59Updated 3 years ago
- C++ Ternary Search Tree implementation with Python bindings☆43Updated 6 years ago
- *Deprecated* A fast and accurate part-of-speech tagger for TextBlob.☆103Updated 9 years ago
- Solr Dictionary Annotator (Microservice for Spark)☆70Updated 4 years ago
- Simhashing in C++☆135Updated last year
- Fast and robust NLP components implemented in Java.☆52Updated 4 years ago
- A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.☆144Updated 2 months ago
- Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.☆44Updated 10 years ago
- Python API for Various DB-Backed Simhash Clusters☆64Updated 7 years ago
- An implementation of locality sensitive hashing with Hadoop☆57Updated 9 years ago
- A bunch of fancy soft string matching routines, with some accompanying datasets☆55Updated 7 years ago
- C++ implementation of hamming distance algorithm HmSearch using Kyoto Cabinet☆41Updated 8 years ago
- A RESTful web service that runs microtasks across multiple crowds, provides quality control techniques, and is easily extensible.☆51Updated 7 years ago
- A C++ library providing fast language model queries in compressed space.☆128Updated last year
- Implementation of Burkhard-Keller trees in various languages☆52Updated 14 years ago
- Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering☆75Updated 2 years ago