I posted code for an algorithm that I believe is original and quite useful if you need "very fast FULL text lookup" given that you have plenty of RAM available and need granular, char level matching. I am not discounting the possibility that the algorithm is naive, but I have not seen anyone document one that is as useful for this particular class of application. I am hoping someone at advogato would be willing to take up the challenge of benchmarking the utility of this algorithm against other text search algorithms. This is not for academicians who are not faithful to the peer rigor of mathematicians in fairness to swipe for Red Cred. I know who you arrrrrr!