>>I assume you mean that you are already splitting the 'search for' string? But the benefit above comes from splitting the 'search in' string as well. You end up with a short (well maybe short) list of words that exist in both. At that point all other words in the 'search for' string are irrelevant.
>>
>>Oh, and I still don't understand how or where you are using SubString() [ or Mid() ] in all this ?
>>
>>Maybe if you posted a couple of representative strings it would be easier to guess the best approach......
>
>What does that function do exactly?

You mean the one I posted? As abvove, it gives you a unique list of words from string a that occur (one or more times) in string b

>Also, I verified my code, and from last night optimization, the Mid() have been removed. I only have some traces of it down below the code but that is not use massively and mostly only on short strings. But, I do have some other uses of Mid() elsewhere in some methods that would certainly benefit of something faster.