@hackage dawg0.8
Directed acyclic word graphs
Categories
License
BSD-3-Clause
Maintainer
waszczuk.kuba@gmail.com
Links
Versions
Installation
Dependencies (6)
- base >=4 && <5
- binary
- containers >=0.4.1 && <0.6
- mtl
- vector
- vector-binary Show all…
Dependents (9)
@hackage/adict, @hackage/acme-everything, @hackage/polh-lexicon, @hackage/moan, @hackage/nerf, @hackage/hist-pl-fusion, Show all…
The library implements directed acyclic word graphs (DAWGs) internaly represented as minimal acyclic deterministic finite-state automata.
The Data.DAWG module provides fast insert and delete operations which
can be used to build the automaton on-the-fly.
The automaton from the Data.DAWG.Static module has lower memory
footprint and provides static hashing functionality.
Both automata versions work in combination with different implementations
of transition maps provided by the Data.DAWG.Trans modules' hierarchy.