Index: graphspell-js/str_transform.js
==================================================================
--- graphspell-js/str_transform.js
+++ graphspell-js/str_transform.js
@@ -140,12 +140,12 @@
             for (let j = 0;  j <= nLen2+1;  j++) {
                 matrix[0][j] = j;
             }
             for (let i = 1;  i <= nLen1;  i++) {
                 for (let j = 1;  j <= nLen2;  j++) {
-                    //let nCost = (s1[i-1] === s2[j-1]) ? 0 : 1;
-                    let nCost = char_player.distanceBetweenChars(s1[i-1], s2[j-1]);
+                    let nCost = (s1[i-1] === s2[j-1]) ? 0 : 1;
+                    //let nCost = char_player.distanceBetweenChars(s1[i-1], s2[j-1]);
                     matrix[i][j] = Math.min(
                         matrix[i-1][j] + 1,         // Deletion
                         matrix[i][j-1] + 1,         // Insertion
                         matrix[i-1][j-1] + nCost    // Substitution
                     );

Index: graphspell/str_transform.py
==================================================================
--- graphspell/str_transform.py
+++ graphspell/str_transform.py
@@ -101,12 +101,12 @@
         d[i, -1] = i + 1
     for j in range(-1, nLen2+1):
         d[-1, j] = j + 1
     for i in range(nLen1):
         for j in range(nLen2):
-            #nCost = 0  if s1[i] == s2[j]  else 1
-            nCost = distanceBetweenChars(s1[i], s2[j])
+            nCost = 0  if s1[i] == s2[j]  else 1
+            #nCost = distanceBetweenChars(s1[i], s2[j])
             d[i, j] = min(
                 d[i-1, j]   + 1,        # Deletion
                 d[i,   j-1] + 1,        # Insertion
                 d[i-1, j-1] + nCost,    # Substitution
             )