diff --git a/adict.cabal b/adict.cabal
--- a/adict.cabal
+++ b/adict.cabal
@@ -1,5 +1,5 @@
 name:               adict
-version:            0.4.0
+version:            0.4.1
 synopsis:           Approximate dictionary searching
 description:
     Approximate dictionary searching library.
diff --git a/src/NLP/Adict.hs b/src/NLP/Adict.hs
--- a/src/NLP/Adict.hs
+++ b/src/NLP/Adict.hs
@@ -33,12 +33,6 @@
   The third one, 'bruteSearch', is provided only for reference
   and testing purposes.
 
-  The 'findAll' function is evaluated against the 'Trie' while the
-  'findNearest' one is evaluated against the 'DAWG'.
-  The reason to make this distinction is that the 'findNearest'
-  function needs to distinguish between DAG nodes and to know
-  when the particular node is visited for the second time.
-
   Both methods perform the search with respect to the cost function
   specified by the library user, which can be used to customize
   weights of edit operations.  The 'Cost' structure provides the