Alternatives and similar repositories for qpick

Users that are interested in qpick are comparing it to the libraries listed below

• KeyviDev / keyvi
  Keyvi - the key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
  ☆257Updated 2 weeks ago
• HazyResearch / epoxy
  Interactive Model Iteration with Weak Supervision and Pre-Trained Embeddings
  ☆77Updated 3 years ago
• fast-pack / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆61Updated 2 years ago
• soaxelbrooke / phrase
  A tool for learning significant phrase/term models, and efficiently labeling with them.
  ☆33Updated 8 months ago
• BenJoyenConseil / rmi
  A learned index structure
  ☆53Updated 4 years ago
• guenthermi / postgres-word2vec
  utils to use word embedding models like word2vec vectors in a PostgreSQL database
  ☆144Updated 4 years ago
• jobergum / dense-vector-ranking-performance
  Performance evaluation of nearest neighbor search using Vespa, Elasticsearch and Open Distro for Elasticsearch K-NN
  ☆117Updated 4 years ago
• bloomberg / koan
  A word2vec negative sampling implementation with correct CBOW update.
  ☆261Updated 4 years ago
• LightTag / ALMa
  ALMa (Active Learning Manager) Keeps track of labeled and unlabeled data for active learning
  ☆42Updated 5 years ago
• glitzflitz / pyxorfilter
  Python bindings for xorfilter(faster and smaller than bloom and cuckoo filters)
  ☆120Updated 4 months ago
• axiomhq / hyperminhash
  HyperMinHash: Bringing intersections to HyperLogLog
  ☆306Updated 7 years ago
• DiceTechJobs / VectorsInSearch
  Dice.com repo to accompany the dice.com 'Vectors in Search' talk by Simon Hughes, from the Activate 2018 search conference, and the 'Sear…
  ☆86Updated 4 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 9 months ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆61Updated 3 years ago
• kootenpv / shrynk
  Using Machine Learning to learn how to Compress
  ☆113Updated 2 years ago
• chnsh / deep-semantic-code-search
  Deep Semantic Code Search aims to explore a joint embedding space for code and description vectors and then use it for a code search appl…
  ☆66Updated last year
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆34Updated 6 years ago
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆108Updated 10 years ago
• google / categorybuilder
  ☆99Updated 5 years ago
• DataDog / sketches-py
  Python implementations of the distributed quantile sketch algorithm DDSketch
  ☆89Updated 8 months ago
• alexyorke / butter-fingers
  A python library to generate highly realistic typos (fuzz-testing)
  ☆13Updated 9 months ago
• wagtaillabs / GRANT
  ☆19Updated 5 years ago
• RecallGraph / RecallGraph
  A versioning data store for time-variant graph data.
  ☆344Updated last year
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆82Updated last year
• chokkan / simstring
  SimString
  ☆113Updated 4 years ago
• informagi / GeeseDB
  Graph Engine for Exploration and Search
  ☆42Updated last year
• HazyResearch / fonduer-tutorials
  A collection of simple tutorials for using Fonduer
  ☆100Updated 5 years ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated 9 months ago
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 4 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago