Index: gc_core/js/char_player.js
==================================================================
--- gc_core/js/char_player.js
+++ gc_core/js/char_player.js
@@ -33,11 +33,11 @@
                     if (i > 1 && j > 1 && s1[i] == s2[j-1] && s1[i-1] == s2[j]) {
                         matrix[i][j] = Math.min(matrix[i][j], matrix[i-2][j-2] + nCost);  // Transposition
                     }
                 }
             }
-            console.log(s2 + ": " + matrix[nLen1][nLen2]);
+            //console.log(s2 + ": " + matrix[nLen1][nLen2]);
             return matrix[nLen1][nLen2];
         }
         catch (e) {
             helpers.logerror(e);
         }

Index: gc_core/js/ibdawg.js
==================================================================
--- gc_core/js/ibdawg.js
+++ gc_core/js/ibdawg.js
@@ -190,13 +190,15 @@
         aSugg = Array.from(aSugg);
         aSugg = aSugg.filter((sSugg) => { return !sSugg.endsWith("è") && !sSugg.endsWith("È"); }); // fr language 
         if (sWord.gl_isTitle()) {
             aSugg = aSugg.map((sSugg) => { return sSugg.gl_toCapitalize(); });
         }
-        return aSugg.sort((sA, sB) => {
-            return char_player.distanceDamerauLevenshtein(sWord, sA) - char_player.distanceDamerauLevenshtein(sWord, sB);
-        }).slice(0, nMaxSugg);
+        let dDistTemp = new Map();
+        aSugg.forEach((sSugg) => { dDistTemp.set(sSugg, char_player.distanceDamerauLevenshtein(sWord, sSugg)); });
+        aSugg = aSugg.sort((sA, sB) => { return dDistTemp.get(sA) - dDistTemp.get(sB); }).slice(0, nMaxSugg);
+        dDistTemp.clear();
+        return aSugg;
     }
 
     _suggest (sRemain, nMaxDel=0, nDeep=0, iAddr=0, sNewWord="", bAvoidLoop=false) {
         // returns a set of suggestions
         // recursive function