protected void findSimilar(String word) {
    Trie.Node t = new WordNode();
    //Delete Edit
    for (int i = 0; i < word.length(); i++) {
      StringBuilder foo = new StringBuilder(word);
      //System.out.println("Delete");
      Trie.Node s = new WordNode();
      String tmp = foo.deleteCharAt(i).toString();
      buildList.add(tmp);
    }
    //Transpose
    for (int i = 0; i < word.length() -1; i++) {
      StringBuilder foo = new StringBuilder(word);
      //System.out.println("Transpose");
      Trie.Node s = new WordNode();
      char a = foo.charAt(i);
      char b = foo.charAt(i+1);
      StringBuilder tmp = foo;
      tmp.setCharAt(i, b);
      tmp.setCharAt(i+1,a);
      buildList.add(tmp.toString());
    }
    //Alteration
    for (int i = 0; i < word.length(); i++) {
      for (int j = 97; j < 123; j++) {
        StringBuilder foo = new StringBuilder(word);
        Trie.Node s = new WordNode();
        char a = (char) j;
        StringBuilder tmp = foo;
        tmp.setCharAt(i,a);
        buildList.add(tmp.toString());
      }
    }
    //Insertion
    for (int i = 0; i < word.length()+1; i++) {
      for (int j = 97; j < 123; j++) {
        StringBuilder foo = new StringBuilder(word);
        Trie.Node s = new WordNode();
        char a = (char) j;
        StringBuilder tmp = foo;
        tmp.insert(i,a);
        buildList.add(tmp.toString());
      }
    }
  }