Subject: [boost] Fuzzy string search to the Boost String Algortihm
From: ÐÐ°Ð¹ÑÐµÐ² ÐÐ»ÐµÐºÑÐ°Ð½Ð´Ñ (zamazan4ik_at_[hidden])
Date: 2016-07-10 10:34:29
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:
Bitap algorithm with modifications by Wu and Manber
Signature hashing method
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.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk