Subject: Re: [boost] Fuzzy string search to the Boost String Algortihm
From: Detlef Wilkening (detlef_at_[hidden])
Date: 2016-09-18 10:12:04
I would like it very much, if that algorithms are part of Boost String
Algorithm, because I need them sometimes - and I until now had only
implement an bad version of Levenshtein distance.
For me it would a great help, if you implement them - thanks in ahead.
Am 10.07.2016 um 16:34 schrieb ÐÐ°Ð¹ÑÐµÐ² ÐÐ»ÐµÐºÑÐ°Ð½Ð´Ñ:
> 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
> 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.
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk