|XP is just a number|
help with a new type of Markovby thealienz1 (Pilgrim)
|on Nov 14, 2001 at 00:00 UTC||Need Help??|
thealienz1 has asked for the
wisdom of the Perl Monks concerning the following question:
"Alrighty people... I must say I am stumped. Yet again." -Eeyore type voice
I am trying to write a program that implements the Markov algorithm and found the examples on perlmonks very useful, but I have a bit of a dilemma. I do not want my senetence to be completely random. For example I want to be able to say that the senteneces to be generated with key words in the sentence.
For istance the sentence must contain the words "flying" and "toaster". And they must appear in the sentence at some random fixed point.
rndwrd1 rndwrd2 toaster rndwrd3 flying rndwrd4
Where rndwrd# is the random word that Markov finds in relationship to flying or toaster. Now keep in mind that "flying toaster" can appear together as one group of words. So, you can see that I have no f*cking clue what to do. I do not understand the Markov well enough to go backwards and forwards through the list.
Can anyone help me out?