Directed acyclic word graphs https://github.com/kawu/dawg
|Latest on Hackage:||0.11|
This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.
The library implements directed acyclic word graphs (DAWGs) internally represented as minimal acyclic deterministic finite-state automata.
Data.DAWG.Dynamic module provides fast insert and delete operations
which can be used to build the automaton on-the-fly. The automaton from
Data.DAWG.Static module has lower memory footprint and provides
static hashing functionality.