Hashing the text instead of dictionary keys

[CosminC3]

Hi,

I used some of your code to make some very good dictionaries in one of my apps.
Thank you very much.

Now I have a different situation: dictionaries for multiple (automated/confirmation) find&replace.
They can be strings of any kind: Any (upcase/lowcase) letter, number 0..9 or even chars not found in words.

Usualy there are a large number of searches on large rtfs - and only a few replacements.
So it seems a text hashing (instead of dictionary key hashing) would be a lot faster.

Do you have some advices/hints on how to do that?

Thank you.

Kind regards,
Cosmin