Markov Chains for generating random sequences with a user definable behaviour.
|Version on this page:||0.0.3.4|
|LTS Haskell 20.23:||0.0.3.4@rev:1|
|Stackage Nightly 2023-05-31:||0.0.3.4@rev:1|
|Latest on Hackage:||0.0.3.4@rev:1|
Module documentation for 0.0.3.4
This library can be used to generate random sequences of anything
with a behaviour that is adapted to some training data.
Input a marketing text or a speech and
recompose it to another arbitrary text of this sort.
Input a dictionary of person names and create new names.
Input a sequence of notes and get out a new melody.
Input a set of Haskell modules and generate ...
nice idea but the result will certainly have neither correct syntax nor types.
I think, it's a good thing about Haskell, that you cannot fool it so easily.
The idea is very simple:
The algorithm analyses your input/training data
with respect to how likely an
e follows the letters
Then on recomposition it chooses subsequent letters randomly
according to the frequencies found in the training data.
This library is well suited for bull-shit generators.