47bca046f2
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.
14 lines
436 B
Makefile
14 lines
436 B
Makefile
# $NetBSD: buildlink3.mk,v 1.1.1.1 2009/09/23 06:40:33 phonohawk Exp $
|
|
|
|
BUILDLINK_TREE+= hs-markov-chain
|
|
|
|
.if !defined(HS_MARKOV_CHAIN_BUILDLINK3_MK)
|
|
HS_MARKOV_CHAIN_BUILDLINK3_MK:=
|
|
|
|
BUILDLINK_API_DEPENDS.hs-markov-chain+= hs-markov-chain>=0.0.3
|
|
BUILDLINK_PKGSRCDIR.hs-markov-chain?= ../../wip/hs-markov-chain
|
|
|
|
.include "../../wip/hs-transformers/buildlink3.mk"
|
|
.endif # HS_MARKOV_CHAIN_BUILDLINK3_MK
|
|
|
|
BUILDLINK_TREE+= -hs-markov-chain
|