ahupp / bktreeLinks
Implementation of Burkhard-Keller trees in various languages
☆52Updated 15 years ago
Alternatives and similar repositories for bktree
Users that are interested in bktree are comparing it to the libraries listed below
Sorting:
- HAT-Trie for Python☆86Updated 9 years ago
- unofficial git mirror of http://svn.whoosh.ca svn repo☆49Updated 15 years ago
- Python search module for fast approximate string matching☆54Updated 2 years ago
- Non-Overlapping Aho-Corasick Python extension, for Python 2 (str and unicode) and Python 3☆51Updated 9 years ago
- C++ Ternary Search Tree implementation with Python bindings☆43Updated 7 years ago
- 💥 Cython hash tables that assume keys are pre-hashed☆87Updated last week
- ☆44Updated 9 years ago
- Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)☆26Updated 6 years ago
- A Cython implementation of the affine gap string distance☆57Updated 2 years ago
- A disk-based key/value store in Python with no dependencies.☆21Updated 10 years ago
- A pure Python implementation of Aho-Corasick algorithm.☆22Updated 6 years ago
- Implementation of Bayesian Sets for fast similarity searches.☆14Updated 13 years ago
- ☆28Updated 5 years ago
- Statistical Dependency Parser using SVM as proposed by Yamada et al☆29Updated 9 years ago
- Roaring Bitmap in Cython☆81Updated last year
- Code for "Performance shootout between nearest-neighbour libraries": http://radimrehurek.com/2013/11/performance-shootout-of-nearest-neig…☆99Updated 9 years ago
- Tool to visualize data quickly with no brain usage for plot creation☆46Updated 6 years ago
- [NO LONGER MAINTAINED AS OPEN SOURCE - USE SCALETEXT.COM INSTEAD]☆108Updated 12 years ago
- *Deprecated* A fast and accurate part-of-speech tagger for TextBlob.☆102Updated 9 years ago
- Python BK-tree data structure to allow fast querying of "close" matches☆183Updated 3 years ago
- DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.☆302Updated 11 months ago
- Cython implementation of DeepWalk☆54Updated last year
- A tool to segment text based on frequencies and the Viterbi algorithm "#TheBoyWhoLived" => ['#', 'The', 'Boy', 'Who', 'Lived']☆81Updated 9 years ago
- Tree-Structured, First- and Higher-Order Linear Chain, and Semi-Markov CRFs☆45Updated 5 years ago
- Efficiently search the most similar strings against the query in Python.☆18Updated 2 weeks ago
- A pure python implementation of locality sensitive hashing for text documents☆85Updated 9 years ago
- Quick solution to Kaggle's "What's Cooking" competition.☆26Updated 9 years ago
- Benchmarking different LSTM libraries☆24Updated 9 years ago
- Python bindings for the Google's FarmHash☆39Updated 9 months ago
- The code that I used in Click-Through Rate Prediction (http://www.kaggle.com/c/avazu-ctr-prediction/) (C++). It implements the Follow The…☆12Updated 10 years ago