--- a/FuzzyMatcher.st	Wed Aug 02 14:37:29 2017 +0200
+++ b/FuzzyMatcher.st	Wed Aug 02 15:45:02 2017 +0200
@@ -15,10 +15,12 @@
 "
     FuzzyMatcher is an approximate string matching algorithm that can determine if a string includes a given pattern.
     For example, the string 'axby' matches both the pattern 'ab' and, 'ay', but not 'ba'. 
-
+    I.e. it matches if the searched string contains a sequence of chars, probably intermixed by other chars,
+    which matches the given search pattern or part of it.
+    
     The algorithm is based on lib_fts[1], and includes an optional scoring algorithm 
     that can be used to sort all the matches based on their similarity to the pattern.
-    It is used in the sublime text editor.
+    It is used (among others) in the sublime text editor.
     
     [see also:]
         https://blog.forrestthewoods.com/reverse-engineering-sublime-text-s-fuzzy-match-4cffeed33fdb
@@ -364,13 +366,6 @@
     "Created: / 13-07-2017 / 13:30:34 / cg"
 !
 
-isSeperator: aCharacter
-        <resource: #obsolete>
-        ^ self isSeparator: aCharacter
-
-    "Modified: / 13-07-2017 / 13:31:18 / cg"
-!
-
 score: aString at: stringIndex patternAt: patternIndex
 
         | score prev |