c++ pleaseCIS25 – SPRING 2020 DUE 3/26 Markov chain pt 1 ...

Question

c++ pleaseCIS25	–	SPRING	2020	 DUE	3/26	 	 	 Markov	chain	pt	1	 	 Create	a	class	called	MarkovWord	with	two	private	member	variables:	 	 string word;  string *successors;  	 The	constructor	for	MarkovWord	should	create	a	string	array	on	the	heap	that	can	initially	 contain	8	strings,	and	set	the	successors	pointer	to	point	to	this	array.	Should	you	run	out	 of	space	to	store	words	in	this	array,	double	its	size.	Your	code	is	expected	to	neither	leak	 memory	nor	access	unallocated	memory.	 	 Create	a	class	called	MarkovGenerator	that	contains	the	following	instance	variable:	 	 MarkovWord *foundWords;  	 MarkovGenerator	should	contain	the	following	function:	 	 	 void readFile(ifstream &file);  	 This	function	should	do	the	following	for	each	word	in	the	file:	 	 -	Check	if	the	current	word	is	already	in	the	foundWords	array.			 	 If	it's	not,	create	a	new	MarkovWord	and	add	it	to	the	foundWords	array.		 	 	 Set	the	word	member	variable	in	the	MarkovWord	to	be	the	word.	 	 	 Add	the	word	following	the	current	word	to	the	MarkovWord's	successors		 	 	 array	 	 If	it	is	in	foundWords,	add	the	word	following	the	current	word	to	that	 	 MarkovWord's	successors	array,	but	don't	add	another	MarkovWord.	 	 Note:	it	is	perfectly	reasonable	to	have	multiple	copies	of	the	same	word	in	a	given	 MarkovWord's	successor	array.		 	 When	you	reach	the	last	word	in	the	file,	consider	the	first	word	as	that	word's	successor.	 	 The	constructor	for	MarkovWord	should	create	an	array	storing	MarkovWords	on	the	 heap.	The	initial	size	for	this	array	should	be	512.	If	you	run	out	of	space,	double	its	size.	 Your	code	is	expected	to	neither	leak	memory	nor	access	unallocated	memory.		 	 Your	main()	function	should	create	a	MarkovGenerator	object,	create	an	ifstream,	open	a	 file,	then	call	the	MarkovGenerator's	readFile()	function	with	the	ifstream	as	the	argument.	 	 For	example,	if	your	file	consisted	of	the	string	"one fish two fish red fish blue  fish",	your	foundWords	array	would	hold	five	items:	 	 word	 successors	 one [fish]  two [fish]  red [fish]  blue  [fish]  fish [two, red, blue, one]  	 	 	 	 Markov	chain	pt	2	 	 Once	you	get	the	MarkovGenerator	and	MarkovWords	classes	from	the	previous	question	 working	correctly,	it's	time	to	actually	use	them	to	generate	new	text.		 	 Write	a	new	function	for	the	MarkovGenerator	class		 	 string	generateText(int	numberOfWords)	 	 that	starts	off	by	reading	the	first	MarkovWord	from	the	foundWords	array.	Write	that	 word	to	a	string.	 	 	Pick	one	word	at	random	from	that	MarkovWord's	successor	array.	Add	this	word	to	the	 string.	Then	pick	one	MarkovWord	at	random	from	this	word's	successor	array.		 	 Note	that	if	a	successor	word	often	appears	after	a	word,	that	successor	word	will	be	in	the	 successors	array	multiple	times.	This	means	that	your	program	is	more	likely	to	choose	 that	word	when	generating	the	next	word.		 	 Repeat	this	process	until	you	have	generated	a	number	of	words	equal	to	numberOfWords.		 	 USE	THE	FILE	emma.txt	ON	CANVAS	AS	YOUR	INPUT	FILE	FOR	TESTING.		 	 Once	you	know	it's	working	well,	try	it	on	a	text	file	of	your	choice.	Upload	your	favorite	 version	of	the	results	to	canvas,	with	the	filename	markov.txt	 	 	 	 	 Markov	chain	pt	3			 	 For	longer	input	files	you	can	get	better	results	by	considering	multiple	words	that	appear	 side	by	side,	then	finding	the	word	that's	most	likely	to	appear	after	those	words	in	order.		 	 Write	a	new	version	of	MarkovWord	that	stores:	 	 *	an	array	of	n	words,	representing	the	window.	 *	a	successor	array	of	words	that	appear	after	those		words	when	those	words	appear	in	 order.		 	 I	recommend	giving	your	new	version	of	MarkovWord	the	following	private	member	 variables:	 	 string *word;  string *successors;  	 	 If	our	window	were	2	words	long	and	our	test	text	were:	 	 It was the best of times, it was the worst of times, it was the age of  wisdom, it was the age of foolishness, it was the epoch of belief, it  was the epoch of incredulity,   	 Our	sets	of	words	and	successors	would	start	as	follows:	 	 [it, was] [the, the, the, the, the, the]  [was, the] [best, worst, age, age, epoch, epoch]  [the, best] [of]  [best, of] [times]  	 (and	so	forth…)	 	 		 	 Use	this	new	version	to	generate	text,	as	in	the	previous	version.	I	leave	the	 implementation	details	for	this	one	to	you.		 	 Test	this	on	whatever	file	you'd	like.	Upload	to	canvas	a	file	called	betterMarkov.txt	with	 your	favorite	autogenerated	texts.

CIS25–SPRING2020 DUE3/26 Markovchainpt1 CreateaclasscalledMarkovWordwithtwoprivatemembervariables: string word; string *successors;...

Get Answer To This Question

Related Questions & Answers

Submit New Assignment