static <A> S levenClosest(Map<S, A> map, S s) {
  int limit = Integer.MAX_VALUE-1;
  new Lowest<S> best;
  for (S key : keys(map)) {
    limit = leven_limited(s, key, limit);
    best.put(key, limit);
  }
  ret best!;
}