Index: gc_core/py/ibdawg.py
==================================================================
--- gc_core/py/ibdawg.py
+++ gc_core/py/ibdawg.py
@@ -202,10 +202,12 @@
         aSugg = set()
         if not sWord:
             if int.from_bytes(self.byDic[iAddr:iAddr+self.nBytesArc], byteorder='big') & self._finalNodeMask:
                 #show(nDeep, "___" + sNewWord + "___")
                 aSugg.add(sNewWord)
+            for sTail in self._getTails(iAddr):
+                aSugg.add(sNewWord+sTail)
             return aSugg
         #show(nDeep, "<" + sWord + ">  ===>  " + sNewWord)
         cCurrent = sWord[0:1]
         for cChar, jAddr in self._getSimilarArcs(cCurrent, iAddr):
             #show(nDeep, cChar)
@@ -238,10 +240,21 @@
         for c in cp.d1to1.get(cChar, [cChar]):
             if c in self.dChar:
                 jAddr = self._lookupArcNode(self.dChar[c], iAddr)
                 if jAddr:
                     yield (c, jAddr)
+
+    def _getTails (self, iAddr, sTail="", n=2):
+        "return a list of suffixes ending at a distance of <n> from <iAddr>"
+        aTails = set()
+        for nVal, jAddr in self._getArcs(iAddr):
+            if nVal < self.nChar:
+                if int.from_bytes(self.byDic[jAddr:jAddr+self.nBytesArc], byteorder='big') & self._finalNodeMask:
+                    aTails.add(sTail + self.dCharVal[nVal])
+                if n:
+                    aTails.update(self._getTails(jAddr, sTail+self.dCharVal[nVal], n-1))
+        return aTails
 
     def _suggestWithCrushedUselessChars (self, sWord, nDeep=0, iAddr=0, sNewWord="", bAvoidLoop=False):
         aSugg = set()
         if not sWord:
             if int.from_bytes(self.byDic[iAddr:iAddr+self.nBytesArc], byteorder='big') & self._finalNodeMask: