Final (hopefully) README edit

Author: MpoMp

README.md

@@ -212,6 +212,7 @@ Will produce:
 
 ## Optimal String Alignment
 The Optimal String Alignment variant of Damerau–Levenshtein (sometimes called the restricted edit distance) computes the number of edit operations needed to make the strings equal under the condition that **no substring is edited more than once**, whereas the true Damerau–Levenshtein presents no such restriction.
+The difference from the algorithm for Levenshtein distance is the addition of one recurrence for the transposition operations.
 
 Note that for the optimal string alignment distance, the triangle inequality does not hold and so it is not a true metric.
 
@@ -222,9 +223,9 @@ public class MyApp {
 
 
     public static void main(String[] args) {
-        OptimalStringAlignment d = new OptimalStringAlignment();
+        OptimalStringAlignment osa = new OptimalStringAlignment();
 
-         System.out.println(osa.distance("CA", "ABC"));;
+        System.out.println(osa.distance("CA", "ABC"));;
     }
 }
 ```