./wip/hs-markov-chain, Markov Chains for generating random sequences

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]


Branch: CURRENT, Version: 0.0.3, Package name: hs-markov-chain-0.0.3, Maintainer: pho

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 a or e follows the letters r and e. 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.


Required to run:
[devel/hs-transformers]

Required to build:
[pkgtools/cwrappers]

Master sites:

SHA1: 57aa7a781a5d5ea541ebcd401e684ddbaf52c6e1
RMD160: 86257b09fca6660fa1a827de7d56f07772d14e58
Filesize: 14.409 KB

Version history: (Expand)


CVS history: (Expand)


   2014-08-29 16:10:14 by Ryosuke Moro | Files touched by this commit (101)
Log message:
make it clear what package depend on

discussed with wiz@.
   2014-05-15 23:49:04 by Ryosuke Moro | Files touched by this commit (110)
Log message:
Remove hs-transformers, imported to pkgsrc/devel.
   2009-09-23 08:40:33 by PHO / phonohawk | Files touched by this commit (5) | Imported package
Log message:
Import hs-markov-chain-0.0.3 as wip/hs-markov-chain.

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 a or e follows the letters r and e. 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.