Library for optimizing strings ( Boyer-Moore Algorithm )

Question

I heavily use strings in a project so what i am looking for is a fast library for handling them.I think the Boyer-Moore Algorithm is the best.

Is there a free solution for that ?

Answer 1

You can consider the following resources implementing Boyer–Moore algorithm:

• Boyer-Moore Horspool in Delphi 2010
• Boyer-Moore-Horspool text searching
• Search Components - Version 2.1
• Boyer-moore, de la recherche efficace

Last Edit:

The StringSimilarity package of theunknownones project is a good source for fuzzy and phonetic string comparison algorithms:

• DamerauLevenshtein
• Koelner Phonetik
• SoundEx
• Metaphone
• DoubleMetaphone
• NGram
• Dice
• JaroWinkler
• NeedlemanWunch
• SmithWatermanGotoh
• MongeElkan