public static void CreateWordGroup(String letter) {
		char C = letter.charAt(0); // Convert input to char
		ArrayList<String> temp_array = new ArrayList<String>();
		HashMap<ArrayList<Integer>,ArrayList<String>> familys = new HashMap<ArrayList<Integer>,ArrayList<String>>();

		for(int i = 0; i < Hangman.d.size(); i++){
			if(Hangman.d.get(i).contains(letter) == true){ //get words containing our letter
				temp_array.add(Hangman.d.get(i));
			}
		}

		for(int y = 0; y < temp_array.size(); y++){ //for each word in the array				
			String word = temp_array.get(y);
			ArrayList<Integer> LetterFeqencey = new ArrayList<Integer>(); //Number of times guess appears in word
			for(int z = 0; z < word.length(); z++){ //for each letter in the array
				if (word.charAt(z) == C) { 
					LetterFeqencey.add(z);
				}
			}

			if(familys.containsKey(LetterFeqencey)){  //Check to see if there are any words in this family
				ArrayList<String> Words = familys.get(LetterFeqencey);
				Words.add(word);
				familys.put(LetterFeqencey,Words);
			}
			else { //if there are no words in this family create new family
				ArrayList<String> Words = new ArrayList<String>();
				Words.add(word);
				familys.put(LetterFeqencey,Words);
			}

			//System.out.println("" + word + " has the leter " + C + " at indexs " + LetterFeqencey + "");
		}

		for(int i = 0; i < familys.size(); i++){
			System.out.println(familys);
		}
	}