Generate all strings within a given levenshtein distance of a string? about liblevenshtein-java HOT 4 CLOSED

package com.github.dylon.liblevenshtein.demo;

import java.io.IOException;
import java.nio.file.Path;
import java.nio.file.Paths;
import java.util.Collection;
import java.util.Scanner;
import java.util.SortedSet;
import java.util.TreeSet;

import com.github.dylon.liblevenshtein.levenshtein.Algorithm;
import com.github.dylon.liblevenshtein.levenshtein.Candidate;
import com.github.dylon.liblevenshtein.levenshtein.ITransducer;
import com.github.dylon.liblevenshtein.levenshtein.factory.TransducerBuilder;

public class Main {

  /**
   * For every document, finds all strings within the specified number of errors
   * from some query term.
   * Example Usage:
   *   java com.github.dylon.liblevenshtein.demo.Main foo 2 $HOME/Documents/*.txt
   */
  public static void main(final String... args) throws IOException {
    int argsIdx = 0;
    final String queryTerm = args[argsIdx ++];
    final int maxDistance = Integer.parseInt(args[argsIdx ++]);

    for (int docIdx = argsIdx; docIdx < args.length; docIdx += 1) {
      final Path docPath = Paths.get(args[docIdx]);
      final Collection<String> dictionary = buildDictionary(docPath);

      final ITransducer<Candidate> transducer = new TransducerBuilder()
        .algorithm(Algorithm.TRANSPOSITION)
        .defaultMaxDistance(maxDistance)
        .dictionary(dictionary, true)
        .build();

      for (final Candidate candidate : transducer.transduce(queryTerm)) {
        System.out.printf("%s: d(%s, %s) = %d%n",
            docPath, queryTerm, candidate.term(), candidate.distance());
      }
    }
  }

  private static Collection<String> buildDictionary(final Path docPath) throws IOException {
    try (final Scanner terms = new Scanner(docPath)) {
      final SortedSet<String> dictionary = new TreeSet<>((a,b) -> a.compareTo(b));
      while (terms.hasNext()) {
        final String term = terms.next();
        dictionary.add(term);
      }
      return dictionary;
    }
  }
}