// returns all the pairs, but best matches first
// second part of pair is similarity score (0-100)
static LPair<PairS, Int> mostRelativelySimilarLevenICPairs(Cl<S> words, O... _) {
  optPar int minScore = 0;
  new Map<PairS, Int> map;
  for (LS l : allSubsetsOfSize_iterator(2, words)) {
    int sim = levenSimilarityIntIC(first(l), second(l));
    if (sim >= minScore) map.put(listToPair(l), sim);
  }
  ret pairsSortedByBDesc(mapToPairs(map));
}