Question

Méalgomé, a techie blogger, has a good command of the english language and his typing skills are quite good. As a conservative computer geek, he is stuck with a text editor that does not perform spell-check. He believes that even the spell checker of modern editors would not be able to let go of the technical words that do not appear in regular dictionaries. Moreover, his Page 2 of 5 one-off mistakes on his blogs are becoming a divergence when comments received are with respect to the spelling mistakes rather than on the ideas he is putting forward. He decided to work on developing a simple plugin, to his favourite text editor, which would be a dynamic spell checker. His main requirement is that the more documents he types, the better should be the spell checker in recognizing the regular english words and his technical words. Moreover, he believes that if words are repeated, the document becomes boring for reading. As such, he wants to check the level of word repetitions in the document. He computes the latter by taking the number of distinct words in the document and dividing it by the total number of words. For the design and implementation, he is thinking that hashing might be a good technique to solve this problem. For the spell check, each word typed in a document becomes the key for the hash table. The corresponding value is the number of times that the particular word has been encountered so far. There are two plugins expected to be written, one is to mainly count the number of distinct words in a file and the other one is to perform a spell-check on the file. Apart from proper coding, you will be marked for proper analysis of the situations, proper understanding and applications of the studied data structures and algorithms, and clarity and precision in explanations provided.


You are required to write the code for the following programs: (i) DistinctWords.java, where hashing is used to count the number of distinct words and level of repetition in a file. (ii) Spellchecker.java, where hashing is applied for spell checking. [12 marks] You may assume the following when writing the above plugins: ● A mistake is unique. It appears at most once. While any other word, that is correctly written, appears more than once. ● For simplicity, there is a space before and after any punctuation mark. Such that words are not mixed up with punctuation marks when splitting using a space. ● The only punctuation marks used here are the ‘,’ and the ‘.’.

PLEASE COMPLETE THE MISSING CODES FOR BOTH (DistinctWords.java AND SpellChecker.java)

2 4 DistinctWords.java Spellchecker.java 1 Import java.util."; 3 // DistinctWords.java, where hashing is used to count the number of distinct words and level of repetition in a file. 5- public class DistinctWords { String filename=""; // add any missing structure to store any other data public DistinctWords (String filename) { this.Filename - filename; 6 8 } // count and return the number of distinct words in the text file public int count_distinct_words() throws Exception return ; 10 11 12 13 14 - 15 16 17 18 19 20 21 22 23 24 25 26- 27 28 29 30 31 // count the total number of words in the text file public int count_total_words() throws Exception return; } Il compute and return the level of repetition 1/ The returned output of compute_level_of_repetition() must be correct for at least 2dp public float compute_level_of_repetition() throws Exception return; } > 2 4 DistinctWords.java Spellchecker.java 1 import java.util."; 3 // Spellchecker.java, where hashing is applied for spell checking. 5. public class Spellchecker { String filename=""; 7 // add any missing structure to store any other data public Spellchecker(String filename) this.filename . filename; 6 } // go through the file and populate the list of words along with the respective frequency that each one of them appear in the file public void populate_list_of_words_and_frequency() throws Exception } 8 9- 10 11 12 13 14 - 15 16 17 18 19- 20 21 22 23 24 - 25 26 27 28 29) // generates the list of possible mistakes public void generate_list_of_possible_mistakes () throws Exception } // returns the number of possible mistakes based on the list previously generated public int number_of_possible_mistakes () throws Exception this.populate_list_of_words_and_frequency(); this.generate_list_of_possible_mistakes(); return;