private String compareToAll(String possibleKw) {
		  ArrayList<Keyword> keywordList = (ArrayList<Keyword>) dictionary.getKeywordList();
		  
		  String mostProbableKeyword = "";
		  int shortestDistance = 100;
		  
		  for(int i = 0; i < keywordList.size(); i++) {
			  
			  Levenshtein levenDistance = new Levenshtein(possibleKw, keywordList.get(i).getWord());
			  int distance = levenDistance.getDistance();
			  
			  if(distance < shortestDistance) {
				  mostProbableKeyword = keywordList.get(i).getWord();
				  shortestDistance = distance;
			  }
		  }
		  
		  if(shortestDistance <= 10) {
			  return mostProbableKeyword;
		  } else {
			  return null;
		  }
	  }