Subject: [boost] Approximate matching to Boost.Algorithm
From: ÐÐ°Ð¹ÑÐµÐ² ÐÐ»ÐµÐºÑÐ°Ð½Ð´Ñ (zamazan4ik_at_[hidden])
Date: 2016-07-26 08:28:20
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. You can find this list here: https://fuzzystring.codeplex.com/
6)Longest Common Subsequence
7)Longest Common Substring
Maybe something else...
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