Alternatives and similar repositories for sigir16-topkcomplete:

Users that are interested in sigir16-topkcomplete are comparing it to the libraries listed below

• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆26Updated 5 months ago
• ot / ds2i
  A library of inverted index data structures
  ☆148Updated 2 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• hpclab / fast-approximate-filtering
  Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…
  ☆14Updated 5 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆105Updated 10 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 10 months ago
• google / sensei
  Logistic regression engine for medium-sized data
  ☆55Updated 9 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 9 months ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• searchivarius / AccurateLuceneBM25
  Improving the effectiveness Lucene's BM25 (and testing it using Yahoo! Answers and Stack Overflow collections)
  ☆16Updated 3 years ago
• waYne1337 / gsaca
  linear time suffix array construction algorithm
  ☆12Updated 8 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 2 weeks ago
• npinto / bottou-sgd
  Leon Bottou's SGD
  ☆33Updated 13 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 9 years ago
• ot / entity2vec
  Semantic embeddings of entities
  ☆66Updated 8 years ago
• IntelLabs / pWord2Vec
  Parallelizing word2vec in shared and distributed memory
  ☆190Updated 2 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• higgood / incremental-word2vec
  Modify word2vec such that it's possible to "condition" on existing embeddings for some words, and induce embeddings for new words.
  ☆39Updated 9 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆129Updated 2 years ago
• rjagerman / glintlda
  Scalable Distributed LDA implementation for Spark & Glint
  ☆28Updated 8 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 9 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆17Updated 6 months ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 5 years ago