code: public static <T extends CharSequence> T findMinimum(Collection<T> ss,
  			CharSequence t) {
  		int min = Integer.MAX_VALUE;
  		T result = null;
  		for (T s : ss) {
  			int d = StringUtils.getLevenshteinDistance(s, t);
  			if (d < min) {
  				min = d;
  				result = s;
  			}
  		}
  		return result;
  	}
docs: Searches the given collection of strings and returns the string that
  has the lowest Levenshtein distance to a given second string <code>t</code>.
  If the collection contains multiple strings with the same distance to
  <code>t</code> only the first one will be returned.
  @param <T> the type of the strings in the given collection
  @param ss the collection to search
  @param t the second string
  @return the string with the lowest Levenshtein distance