Alternatives and similar repositories for dawggenerator:

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

• wkoszek / flviz
  FLVIz - Finite Automata Simulator written in QT/Graphviz
  ☆36Updated 9 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• chanian / hyperlogsandwich
  ☆172Updated 10 years ago
• incrediblesound / Graph-Reply
  A graph based REPL that saves to and loads from disk
  ☆44Updated 9 years ago
• rcoh / treelayout
  Demonstrating the importance of laying out data in memory.
  ☆47Updated 7 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆136Updated 2 months ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 8 years ago
• wolfgarbe / EliasFanoCompression
  EliasFanoCompression: quasi-succinct compression of sorted integers in C#
  ☆45Updated 3 years ago
• sebcat / move-literals
  An example of PEG usage
  ☆55Updated 8 years ago
• dcreager / libpush
  An arrow-based parser combinator library for C
  ☆40Updated 15 years ago
• blu / ascii_pruner
  Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64
  ☆10Updated 4 years 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
• warriorguo / zertcore5
  C++11 Server framework provides many exciting features!
  ☆52Updated 9 years ago
• invesdwin / invesdwin-context-persistence
  invesdwin-context modules that provide persistence features
  ☆43Updated this week
• danieldk / dictomaton
  Finite state dictionaries in Java
  ☆130Updated 3 years ago
• qpfiffer / Simple-Sparsehash
  A simple re-implementation of Google's sparsehash as a learning excercise.
  ☆40Updated last year
• refi64 / rejit
  A work-in-progress JIT-powered regex engine
  ☆110Updated 7 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
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 10 years ago
• wayfarerdb / Dialogue
  An Actor-based framework for Lua
  ☆37Updated 8 years ago
• apache / lucy
  Mirror of Apache Lucy
  ☆99Updated 7 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆122Updated 10 months ago
• cruppstahl / libfor
  A very fast scalar implementation for Frame Of Reference integer compression.
  ☆108Updated 9 years ago
• pschanely / scoredb
  A simple database optimized for returning results by custom scoring functions.
  ☆20Updated 9 years ago
• norswap / triemap
  Compressed Hash-Array Mapped Prefix-tree (CHAMP) Implementation
  ☆58Updated 7 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆83Updated last year
• 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
• jvns / gzip.jl
  Gzip in julia! =D =D
  ☆163Updated 7 years ago
• ncm / nytm-spelling-bee
  Generate anagram puzzles like Frank Longo's "Spelling Bee" as in New York Times Magazine
  ☆33Updated 5 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago