Hello. I want to discuss about some proposals. I am working on Levenshtein distance and Damerau-Levenshtein distance algortihms. I hope, that these implementations will be pulled to the Boost String library.
But i think that we can add to the Boost String Library some more algorithms for fuzzy searhing. I mean these algortihms:
Levenshtein distance
Damerau-Levenshtein distance
Bitap algorithm with modifications by Wu and Manber
Spell-checker method
N-gram method
Signature hashing method
BK-trees
What do you think about this idea? If you think that it can be implemented to the Boost String Algo, i will start work on this list immediately.
Best regards, Zaitsev Alexander.
Hello. I want to discuss about some proposals. I am working on Levenshtein distance and Damerau-Levenshtein distance algortihms. I hope, that these implementations will be pulled to the Boost String library.
But i think that we can add to the Boost String Library some more algorithms for fuzzy searhing. I mean these algortihms:
Levenshtein distance
Damerau-Levenshtein distance
Bitap algorithm with modifications by Wu and Manber
Spell-checker method
N-gram method
Signature hashing method
BK-trees
What do you think about this idea? If you think that it can be implemented to the Boost String Algo, i will start work on this list immediately.
Best regards, Zaitsev Alexander.