**java** for this project, you are going to write a program to find

For this project, you are going to write a program to find the anagrams in a given dictionary for a given word. If two words have the same letters but in different order, they are called anagrams. For example, “listen” and “silent” are a pair of anagrams.
First let’s focus on “LetterInventory.java”.
Its purpose is to compute the canonical “sorted letter form” for a given word.
1. Implement the constructor, which takes the String input word. You can assume that the input word contains only valid letters (e.g. no punctuation or blanks), but it may contain letters in different cases.
2. Implement the method: public String getCanonical() It should return the canonical “sorted letter form” for the input word (given in the constructor). It should use only lower cases. For example, if the given word is “AliBaba”, then this method should return “aaabbil”.
****I have already completed all of the above tasks I am struggling with the next part****
**below is the code I have for LetterInventory.java**
import java.util.*;
public class LetterInventory {
   private String input; 
    //stores the original word.  
    public LetterInventory(String input) {        this.input = input;    }    //uses an array of chars to hold word and sorts it into alphabetical order.    //displays it in lower case.     public String getCanonical() {        input = input.toLowerCase(); // converting input to lower case        char [] word = input.toCharArray();        Arrays.sort(word);        String sorted = new String (word);        return sorted; 
*** this is where i am stuck ***
Once “LetterInventory.java” is working as expected, we can now focus on “AnagramFinder.java”. It will read an input “dictionary” file, which contains quite many words, to build a map. The “key” for the map is a word’s canonical form, the “value” for the map will be all the words in the given dictionary that share the same canonical form. For example, if both “listen” and “silent” are in the dictionary, one entry in the map would have key as “eilnst” and value as an ArrayList of words “listen” and “silent”.
Implement the constructor, which takes in the input dictionary file and build the map. You can assume the words in the dictionary contain only valid letters. You should take advantage of “LetterInventory”.
3. Now implement the method: public void printAnagrams(String word) It should try to search the anagrams for the given word in the map. Again, you can assume the input word contains only valid letters, and you should take advantage of “LetterInventory”.
Print out any anagrams found. For now, don’t worry about the case where the input word is the same as the word inside the dictionary, just print them out.
Here is some sample print out:
Your input is: silent. Found anagrams: listen, silent, tinsel.
Your input is: AliBaba. Sorry, didn’t find any anagrams.
A sample main method is already written for you to test various functionalities with some sample input words.
*** Below is the shell for the main method ***
import java.io.*;import java.util.*;
public class AnagramFinder {    public static void main(String[] args) throws FileNotFoundException {        String[] originals = new String[] {            “realfun”,            “mias”,            “EVIL”,            “unable”,            “Silent”,            “AliBaba”        };
       for(String original: originals) {            LetterInventory inv = new LetterInventory(original);            System.out.println(“Original: ” + original + “, Canonical: ” + inv.getCanonical());        }
       File f = new File(“HW_sample_dict.txt”); 
        AnagramFinder finder = new AnagramFinder(f);
       for(String original: originals) {            finder.printAnagrams(original);        }    }
   public AnagramFinder(File f) throws FileNotFoundException {       //TODO implement      }
   public void printAnagrams(String word) {        //TODO implement    }
   public void printAnagrams2(String word) {        // Extra Credit: optional to implement    }} 
** can leave out extra credit part i just need help with the first 2 methods in the main file **
** the dict.txt is 400 pages long so I did not include it (the file just contains thousands of words) **

Place your order
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
The price is based on these factors:
Academic level
Number of pages
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more