Experiments into markov chains, n-grams, and text generation.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 

30 lines
711 B

using System;
using System.Collections.Generic;
using System.IO;
namespace MarkovGrams
{
class MainClass
{
public static void Main(string[] args)
{
if(args.Length != 3)
{
Console.WriteLine("Usage:");
Console.WriteLine(" ./MarkovGrams.exe <wordlist.txt> <order> <length>");
return;
}
string wordlistFilename = args[0];
int order = int.Parse(args[1]);
int desiredStringLength = int.Parse(args[2]);
IEnumerable<string> words = File.ReadLines(wordlistFilename);
IEnumerable<string> ngrams = NGrams.GenerateFlat(words, order);
UnweightedMarkovChain chain = new UnweightedMarkovChain(ngrams);
Console.WriteLine(chain.Generate(desiredStringLength));
}
}
}