Alternatives and similar repositories for fsa:

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

• zunama / MA-FSA
  This is a minimal acyclic finite-state automata algorithm in Java based on the paper, "Incremental Construction of Minimal Acyclic Finite…
  ☆19Updated 11 years ago
• metamx / bytebuffer-collections
  ByteBuffer collection classes for java and jvm-based languages.
  ☆33Updated 6 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 9 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆26Updated 5 months ago
• project-flink / flink-graph
  ***Warning*** Old Apache Flink Graph API: This repository is not in use anymore.
  ☆15Updated 9 years ago
• microsoft / QBASHER
  Inverted file indexing and retrieval optimized for short texts. Supports auto-suggest and query segment classification.
  ☆34Updated last year
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• carrotsearch / jsuffixarrays
  JSuffixArrays (Suffix Arrays in Java)
  ☆59Updated 8 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• M-Flash / m-flash-cpp
  ☆15Updated 7 years ago
• steveash / jopenfst
  Partial Java port of the C++ OpenFST library
  ☆37Updated 3 years ago
• o19s / hangry
  Vector search in Lucene based search attempting to use just the existing Lucene data structures (experimental)
  ☆43Updated 5 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• o19s / search-metrics
  Python functions for popular relevance metrics (ndcg, err, etc)
  ☆16Updated last year
• ZhangZhenjie / bed-tree
  A flexible tree-based index structure to support edit distance search on strings
  ☆11Updated 7 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• lemire / BitSliceIndex
  Experiments on bit-slice indexing
  ☆13Updated 10 years ago
• nilehmann / libk2tree
  k2tree implementation
  ☆10Updated 8 years ago
• knowitall / openregex
  An efficient and flexible token-based regular expression language and engine.
  ☆75Updated 11 years ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆80Updated 4 years ago
• jermp / tongrams_estimation
  A C++ library implementing fast language models estimation using the 1-Sort algorithm.
  ☆17Updated last year
• lsds / SEEP
  Cluster computing using Stateful Dataflow Graphs
  ☆26Updated 2 years ago
• clearnlp / clearnlp
  Fast and robust NLP components implemented in Java.
  ☆52Updated 4 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• rmit-ir / LTR_Cascade
  Code repo for the SIGIR '17 paper "Efficient Cost-Aware Cascade Ranking for Multi-Stage Retrieval"
  ☆10Updated 2 years ago
• mjpt777 / presentations
  Presentation slides from conferences
  ☆18Updated 5 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• lintool / JASS
  Anytime Ranking for Impact-Ordered Indexes
  ☆12Updated 8 years ago
• akopich / dplsa
  Distributed implementation of Robust PLSA using Spark
  ☆12Updated 3 years ago