Exercise32_2.java

public static int[][] computeLevenshteinAugustin(List<String> wordList, boolean parallel) {
    final int LIST_SIZE = wordList.size();
    int[][] distances = new int[LIST_SIZE][LIST_SIZE];
    Stream<String> wordStream = wordList.stream();
    if (parallel) {
        wordStream.parallel();
    }

    wordStream.forEach(word -> {
                   int wordIndex = wordList.indexOf(word);
                   Stream<String> stream = wordList.subList(wordIndex + 1, wordList.size()).stream();
                   if (parallel) {
                       stream.parallel();
                   }
                   stream.forEach(wordToCompare -> {
                                      int newWordIndex = wordList.indexOf(wordToCompare);
                                      int lev = Levenshtein.lev(word, wordToCompare);
                                      distances[wordIndex][newWordIndex] = lev;
                                      distances[newWordIndex][wordIndex] = lev;
                                  }
                   );
               }
    );
    return distances;
}