This is a Markov-Chain project done in Alem Platform

Done by dabektur.

This program generates the text based on the provided text according to the Markov chain algorithm.

Usage:

Usage: markovchain -w N -p S -l N markovchain --help

Options: --help Show this screen. -w N Number of maximum words -p S Starting prefix -l N Prefix length

Examples:

General usage without additional options: $ cat the_great_gatsby.txt | ./markovchain | cat -e Chapter 1 In my younger and more stable, become for a job. He hadn't eat anything for a long, silent time. It was the sound of someone splashing after us over the confusion a long many-windowed room which overhung the terrace. Eluding Jordan's undergraduate who was well over sixty, and Maurice A. Flink and the great bursts of leaves growing on the air now. "How do you want? What do you like Europe?" she exclaimed surprisingly. "I just got here a minute. "Yes." He hesitated. "Was she killed?" "Yes." "I thought you didn't, if you'll pardon my--you see, I carry$

Case of counting the words: $ cat the_great_gatsby.txt | ./markovchain | wc -w 100

No input case: $ ./markovchain Error: no input text

Case of specified word amount: $ cat the_great_gatsby.txt | ./markovchain -w 10 | cat -e Chapter 1 In my younger and more stable, become for$

Case of specified word amount and prefix: $ cat the_great_gatsby.txt | ./markovchain -w 10 -p "to play" | cat -e to play for you in that vast obscurity beyond the$

Case of specified word amount, prefix and prefix length: $ cat the_great_gatsby.txt | ./markovchain -w 10 -p "to something funny" -l 3 to something funny the last two days," remarked Wilson. "That's