Question

All the white space among words in a text file was lost. Write a C++ program which using dynamic programming to get all of the possible original text files (i.e. with white spaces between words) and rank them in order of likelihood with the best possible runtime.

You have a text file of dictionary words and the popularity class of the word (words are listed from popularity 1-100 (being most popular words), 101-200, etc)

- Input is a text file

- Output should be a series of files, each containing one the possible original documents and one document containing the ranking of likelihood of the outputs

- Use the right data structure for storing the data structure in memory, as this will impact the runtime

- Only dictionary words will be in the input text file

- Punctuation such as: . ? ! ; should be handled by program

- Remove words with non-English letters from dictionary

- Remove all the single letter words except for 'I' , 'A', and 'a' from dictionary or handle them in another way. (Important so there aren't infinite possible solutions)

To Test:

- Create text files using words in the dictionary. The ranking of outputs is in part based on the popularity class of the words used

Answer 1

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53

#include <iostream> #include <fstream> #include <cctype> #include <cstdlib> using namespace std; void filter_blank_spaces(ifstream& in_stream, ofstream& out_stream); int main() { ifstream fin; ofstream fout; fin.open("proj-8.dat"); if (fin.fail()) { cout << "Input file could not be opened.\n"; exit(1); } fout.open("proj-8_2.dat"); if (fout.fail()) { cout << "Output file could not be opened.\n"; exit(1); } filter_blank_spaces(fin, fout); fin.close( ); fout.close( ); cout << "Done.\n"; return 0; } void filter_blank_spaces(ifstream& in_stream, ofstream& out_stream) { char next; in_stream.get(next); do { if (isspace(next)) out_stream << ' '; else out_stream << next; in_stream.get(next); } while (! in_stream.get(next)); }