@hackage dawg-ord0.5.1.2
Directed acyclic word graphs
Categories
License
BSD-3-Clause
Maintainer
waszczuk.kuba@gmail.com
Links
Versions
Installation
Dependencies (5)
- base >=4 && <5
- containers >=0.5 && <0.7
- mtl >=2.1 && <2.3
- transformers >=0.3 && <0.6
- vector >=0.10 && <0.13 Show all…
Dependents (1)
@hackage/partage
The library implements directed acyclic word graphs (DAWGs) internally represented as minimal acyclic deterministic finite-state automata. The implemented version of DAWG can be seen as a map from sequences of alphabet symbols (keys) to values.
The library allows to build DAWGs over any symbols and values
provided that they both have Ord instances (see the
Data.DAWG.Ord module).
It also provides a fast insert operation which can be used to
construct DAWGs on-the-fly.