Index: graphspell-js/ibdawg.js
==================================================================
--- graphspell-js/ibdawg.js
+++ graphspell-js/ibdawg.js
@@ -37,11 +37,11 @@
         if (this.aAllSugg.has(sSugg)) {
             return;
         }
         this.aAllSugg.add(sSugg);
         if (!this.aSugg.has(sSugg)) {
-            let nDist = str_transform.distanceDamerauLevenshtein(this.sSimplifiedWord, str_transform.simplifyWord(sSugg));
+            let nDist = Math.floor(str_transform.distanceDamerauLevenshtein(this.sSimplifiedWord, str_transform.simplifyWord(sSugg)));
             if (nDist <= this.nDistLimit) {
                 if (sSugg.includes(" ")) { // add 1 to distance for split suggestions
                     nDist += 1;
                 }
                 if (!this.dSugg.has(nDist)) {

Index: graphspell-js/str_transform.js
==================================================================
--- graphspell-js/str_transform.js
+++ graphspell-js/str_transform.js
@@ -142,11 +142,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
                     }
                 }
             }
-            return Math.floor(matrix[nLen1][nLen2]);
+            return matrix[nLen1][nLen2];
         }
         catch (e) {
             console.error(e);
         }
     },

Index: graphspell/ibdawg.py
==================================================================
--- graphspell/ibdawg.py
+++ graphspell/ibdawg.py
@@ -55,11 +55,11 @@
         if sSugg in self.aAllSugg:
             return
         self.aAllSugg.add(sSugg)
         if sSugg not in self.aSugg:
             #nDist = min(st.distanceDamerauLevenshtein(self.sWord, sSugg), st.distanceDamerauLevenshtein(self.sSimplifiedWord, st.simplifyWord(sSugg)))
-            nDist = st.distanceDamerauLevenshtein(self.sSimplifiedWord, st.simplifyWord(sSugg))
+            nDist = int(st.distanceDamerauLevenshtein(self.sSimplifiedWord, st.simplifyWord(sSugg)))
             #logging.info((nDeep * "  ") + "__" + sSugg + "__ :" + self.sSimplifiedWord +"|"+ st.simplifyWord(sSugg) +" -> "+ str(nDist))
             if nDist <= self.nDistLimit:
                 if " " in sSugg:
                     nDist += 1
                 if nDist not in self.dSugg:
@@ -79,10 +79,13 @@
             if nDist > self.nDistLimit:
                 break
             if not bFirstListSorted and len(lSugg) > 1:
                 lSugg.sort(key=lambda sSugg: st.distanceDamerauLevenshtein(self.sWord, sSugg))
                 bFirstListSorted = True
+            #print(nDist, "|".join(lSugg))
+            #for sSugg in lSugg:
+            #    print(sSugg, st.distanceDamerauLevenshtein(self.sWord, sSugg))
             lRes.extend(lSugg)
             if len(lRes) > nSuggLimit:
                 break
         if self.sWord.isupper():
             lRes = list(OrderedDict.fromkeys(map(lambda sSugg: sSugg.upper(), lRes))) # use dict, when Python 3.6+

Index: graphspell/str_transform.py
==================================================================
--- graphspell/str_transform.py
+++ graphspell/str_transform.py
@@ -100,11 +100,11 @@
                 d[i,   j-1] + 1,        # Insertion
                 d[i-1, j-1] + nCost,    # Substitution
             )
             if i and j and s1[i] == s2[j-1] and s1[i-1] == s2[j]:
                 d[i, j] = min(d[i, j], d[i-2, j-2] + nCost)     # Transposition
-    return int(d[nLen1-1, nLen2-1])
+    return d[nLen1-1, nLen2-1]
 
 
 def distanceSift4 (s1, s2, nMaxOffset=5):
     "implementation of general Sift4."
     # https://siderite.blogspot.com/2014/11/super-fast-and-accurate-string-distance.html