public int getSimilarityInPercent() {
    int maxDistance = Math.max(seq1.length(), seq2.length());
    return (maxDistance - getDistance()) * 100 / maxDistance;
  }
Calculates Levenshtein distance and corresponding edit path between two character sequences.
Inspired from: https://etorreborre.blogspot.com/2008/06/edit-distance-in-scala_245.html

Ideas for improvements:
- Favor fewer EditOperationS when calculating distance and/or path
- Use algorithm with lower time and/or space complexity

@author Peter Niederwieser
spock-core/src/main/java/org/spockframework/runtime/condition/EditDistance.java