@@ -1,11 +1,11 @@
 #!python3
 
 """
 INDEXABLE BINARY DIRECT ACYCLIC WORD GRAPH
 Implementation of a spellchecker as a transducer (storing transformation code to get lemma and morphologies)
-and a spell suggestion mechanim
+and a spell suggestion mechanism
 """
 
 import traceback
 import pkgutil
 import re
@@ -264,13 +264,11 @@
         if sWord[0:1].isupper():
             if len(sWord) > 1:
                 if sWord.istitle():
                     return self.lookup(sWord.lower())
                 if sWord.isupper():
-                    if self.bAcronymValid:
-                        return True
-                    return self.lookup(sWord.lower()) or self.lookup(sWord.capitalize())
+                    return self.bAcronymValid or self.lookup(sWord.lower()) or self.lookup(sWord.capitalize())
                 return self.lookup(sWord[:1].lower() + sWord[1:])
             return self.lookup(sWord.lower())
         if sWord[0:1].isdigit():
             return True
         return False