@@ -1,7 +1,6 @@
 #!python3
-# -*- coding: UTF-8 -*-
 
 import os
 import traceback
 import pkgutil
 import re
@@ -186,11 +185,11 @@
         return l
 
     def suggest (self, sWord):
         "returns a set of similar words"
         # first, we check for similar words
-        #return set(self._suggestWithCrushedUselessChars(cp.clearWord(sWord)))
+        #return self._suggestWithCrushedUselessChars(cp.clearWord(sWord))
         aSugg = self._suggest(sWord)
         if not aSugg:
             aSugg.update(self._suggest(sWord[1:]))
             aSugg.update(self._suggest(sWord[:-1]))
             aSugg.update(self._suggest(sWord[1:-1]))
@@ -197,11 +196,11 @@
             if not aSugg:
                 aSugg.update(self._suggestWithCrushedUselessChars(cp.clearWord(sWord)))
         return aSugg
 
     def _suggest (self, sWord, nDeep=0, iAddr=0, sNewWord="", bAvoidLoop=False):
-        # RECURSIVE FUNCTION
+        # recursive function
         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)