Alternatives and similar repositories for similarityjoin:

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

• pombredanne / SimSearch
  Implementation of Bayesian Sets for fast similarity searches.
  ☆15Updated 13 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 3 years ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆57Updated 2 years ago
• vchahun / yart
  Yet another regression toolkit
  ☆12Updated 11 years ago
• ot / entity2vec
  Semantic embeddings of entities
  ☆66Updated 8 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• ipsarros / DolphinnPy
  High-dimensional approximate nearest neighbor in python
  ☆11Updated 6 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆30Updated 5 years ago
• usc-isi-i2 / dig-lsh-clustering
  Clustering documents based on LSH
  ☆14Updated 8 years ago
• jermp / tongrams_estimation
  A C++ library implementing fast language models estimation using the 1-Sort algorithm.
  ☆17Updated last year
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 5 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆57Updated 8 months ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆19Updated last year
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• M-Flash / m-flash-cpp
  ☆15Updated 6 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• uhh-lt / chinese-whispers
  Implementation of the Chinese Whispers graph clustering algorithm
  ☆8Updated 7 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆51Updated last year
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 10 years ago
• angeloskath / supervised-lda
  A flexible variational inference LDA library.
  ☆22Updated 5 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• percyliang / fig
  General Java utilities (options parser, logging, experiment management, probability/statistics)
  ☆36Updated 4 years ago
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆24Updated 6 years ago
• premgopalan / bnprec
  Gopalan, P., Ruiz, F. J., Ranganath, R., & Blei, D. M. (2014). Bayesian Nonparametric Poisson Factorization for Recommendation Systems. I…
  ☆15Updated 10 years ago
• daqcri / deeper-lite
  deep entity resolution lite version
  ☆11Updated 5 years ago
• ikegami-yukino / madoka-python
  Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)
  ☆26Updated 5 years ago