Utilizes dynamic programming to get all of the possible

After a file compression failure, all the white space among words in a text file was lost.

Write a C++ program which utilizes dynamic programming to get all of the possible original documents (i.e. with white spaces between words) and ranks them in order of likelihood; all in minimal time.

What you have at your disposal:
- List of unsorted top 100000 English words most used up until August 2005 which includes #comments showing you the popularity class of the word in the language: dictionary.txt

- List of unsorted top 20000 English words (and 20000 with the first letter capitalized for ease): dictionary2.txt Note that this library does not have the popularity classes comment so you must assume the popularity classes yourself. The capitalized versions of the words are in the second half of the document so for ease you need to think of them as in the same popularity class as the lower case ones above.

- dictionary3.txt is a version of dictionary2 in which the lowercase and caps version of the same word are placed back to back.

Methodology:
- Assume your input document will be in the form of a text file
- Your output should be a series of files, each containing one the possible original documents as well as a console print out (and/or additional file) including the ranking of the outputs.
- You will need to use a proper data structure for storing your English dictionary in memory. This will heavily effect your running time.
- For simplicity you may assume that only the words in the dictionary will show up in your compressed text.
- Your program will need to know how to handle punctuation that separate sentences such as: . ? ! ;
- You may remove words with none-English letters and other problems from the library
- You may also remove all the single letter words except for 'I' , 'A', and 'a' from the library or handle them in another way. If you do not handle this situation your program will create exponentially many outputs.

Testing:
- Construct sentences and paragraphs from the words in the dictionary. These need not be semantically meaningful sentences as your task is to generate all possible outcomes using dynamic programming. This means the ranking of outputs is in part based on the popularity class of the words used.

Attachment:- Dynamic programming.zip


Order Assignment gulfassignmenthelp Rated 4.9 / 5 based on 22789 reviews.
  • Tasha

    Team Congratulations! I have got A+ grade for my assignment and scored top in my class. Thank you very much. Much delighted with the work. When I received my job, I was contented with your services. It was before my given deadline. I can’t even imagine that I can also score so well in this subject. All thanks to you mate.

  • Huana

    This one is a technical one that I have uploaded now on your online portal. Please look at that. It has the matter for- “Utilizes dynamic programming to get all of the possible original documents (i.e. with white spaces between words) and ranks them in order of likelihood” I failed to do this work. I attempted this assignment at least 4-5 times but was unable to complete the job, and the due date for this assessment is in the next 42 hours. Help me out! My friend informed me about your online assignment writing website, and by hearing his words of compliments for your organisations, I can’t stop myself, and I am here with my homework. I have so many hopes with your team, hope you will see my concern for my assignment. It is a technical task, and this is the reason I am afraid for the work. I never availed your services so assign this work to your best technical working expert. Yes, one more thing I would like to inform you is that provide its screenshots also so that I can easily access the work and present this to my university professor. Thank you for accepting my assignment.

Captcha

Seeking Trusted Advice of High Skilled Tutors for Gulf Assignments? Order Now