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 6 months ago
• JoeLeavitt / SkipTrie
  ☆12Updated 8 years ago
• steveash / jopenfst
  Partial Java port of the C++ OpenFST library
  ☆37Updated 4 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 4 years ago
• carrotsearch / jsuffixarrays
  JSuffixArrays (Suffix Arrays in Java)
  ☆59Updated 8 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 10 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 3 years ago
• zvelo / cmph
  C Minimal Perfect Hashing Library
  ☆88Updated 8 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 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
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• ashvardanian / SmashTable
  If only std::set was a DBMS: collection of templated ACID in-memory exception-free thread-safe and concurrent containers in a header-only…
  ☆43Updated 2 months ago
• lessthanoptimal / Java-Matrix-Benchmark
  Java Matrix Benchmark is a tool for evaluating Java linear algebra libraries for speed, stability, and memory usage.
  ☆61Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆82Updated 5 years ago
• rjagerman / glintlda
  Scalable Distributed LDA implementation for Spark & Glint
  ☆29Updated 9 years ago
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆27Updated 7 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated 4 months ago
• erhanbaris / SymSpellPlusPlus
  SymSpell C++ Ports
  ☆31Updated 7 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• thomasmueller / minperf
  A Minimal Perfect Hash Function Library
  ☆171Updated 4 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆19Updated 8 years ago
• amallia / gpu-integers-compression
  GPU-Accelerated Faster Decoding of Integer Lists
  ☆13Updated 6 years ago
• searchhub / preDict
  Lightning fast spell correction / fuzzy search library based on SymSpell by Commerce-Experts
  ☆81Updated 7 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 3 years ago