Alternatives and similar repositories for dawggenerator

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

• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆137Updated 6 months ago
• cliqz-oss / keyvi
  Keyvi - a key value index that powers Cliqz search engine. It is an in-memory FST-based data structure highly optimized for size and look…
  ☆177Updated 6 years ago
• patrickfrey / strus
  Library implementing the storage and the query evaluation for a text search engine. It uses on a key value store database interface to st…
  ☆47Updated 3 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• stevedekorte / vertexdb
  C based graph db server using tokyocabinet & libevent
  ☆298Updated 7 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• incrediblesound / Graph-Reply
  A graph based REPL that saves to and loads from disk
  ☆44Updated 10 years ago
• qpfiffer / Simple-Sparsehash
  A simple re-implementation of Google's sparsehash as a learning excercise.
  ☆40Updated last year
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• sebcat / move-literals
  An example of PEG usage
  ☆55Updated 8 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• cruppstahl / libfor
  A very fast scalar implementation for Frame Of Reference integer compression.
  ☆109Updated 9 years ago
• danieldk / dictomaton
  Finite state dictionaries in Java
  ☆130Updated 3 years ago
• apache / lucy
  Mirror of Apache Lucy
  ☆99Updated 7 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• sustrik / ribosome
  Simple code generator
  ☆249Updated last year
• google / classp
  Classp -- a classier way to parse
  ☆169Updated 8 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
• evoasm / evoasm.rb
  An AIMGP (Automatic Induction of Machine code by Genetic Programming) engine
  ☆92Updated 6 years ago
• refi64 / rejit
  A work-in-progress JIT-powered regex engine
  ☆112Updated 7 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• google / redgrep
  ♥ Janusz Brzozowski
  ☆164Updated last year
• ncm / nytm-spelling-bee
  Generate anagram puzzles like Frank Longo's "Spelling Bee" as in New York Times Magazine
  ☆33Updated 6 years ago
• invesdwin / invesdwin-context-persistence
  invesdwin-context modules that provide persistence features
  ☆43Updated last week
• regehr / nibble-sort
  Many functions in C for sorting the nibbles in an 8-byte word
  ☆33Updated 10 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• rasky / gcs
  Golomb Coded Sets
  ☆94Updated 8 years ago
• wayfarerdb / Dialogue
  An Actor-based framework for Lua
  ☆37Updated 9 years ago
• chanian / hyperlogsandwich
  ☆172Updated 10 years ago