private String seekMatchingWords(String keywordWord,
			LinkedList<String> word, LinkedList<String> possibleWord) {
		for(int j = 0; j < word.size(); j++) {
			if(keywordWord.equals(word.get(j))) { return word.get(j); }
		}
		
		int shortestDistance = 3;
		String wordWithShortestDistance = "";
		for(int j = 0; j < possibleWord.size(); j++) {
			Levenshtein levenshtein = new Levenshtein(keywordWord, possibleWord.get(j));
			if(levenshtein.getDistance() < shortestDistance) { wordWithShortestDistance = possibleWord.get(j); }
		}
		return wordWithShortestDistance;
	}