Alternatives and similar repositories for fsa

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

• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆57Updated 2 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆171Updated 7 months ago
• steveash / jopenfst
  Partial Java port of the C++ OpenFST library
  ☆37Updated 4 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 10 years ago
• carrotsearch / jsuffixarrays
  JSuffixArrays (Suffix Arrays in Java)
  ☆59Updated 8 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 3 years ago
• rjagerman / glintlda
  Scalable Distributed LDA implementation for Spark & Glint
  ☆29Updated 9 years ago
• zunama / MA-FSA
  This is a minimal acyclic finite-state automata algorithm in Java based on the paper, "Incremental Construction of Minimal Acyclic Finite…
  ☆20Updated 12 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 4 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 10 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated 4 months ago
• lemire / RealisticTabularDataSets
  Some realistic tabular datasets for testing (CSV)
  ☆21Updated 7 years ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆82Updated 5 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 years ago
• project-flink / flink-graph
  ***Warning*** Old Apache Flink Graph API: This repository is not in use anymore.
  ☆15Updated 10 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆15Updated 3 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆19Updated 8 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 3 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 3 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 5 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆50Updated this week
• yasserg / jforests
  Automatically exported from code.google.com/p/jforests
  ☆67Updated 5 years ago
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆27Updated 7 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• fast-pack / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆61Updated 2 years ago
• lemire / BitSliceIndex
  Experiments on bit-slice indexing
  ☆13Updated 10 years ago