Boost logo

Boost :

Subject: Re: [boost] Approximate matching to Boost.Algorithm
From: Paul A. Bristow (pbristow_at_[hidden])
Date: 2016-07-27 05:09:30

I am sure some people will find these algorithms very useful.

But a review will be needed and must include Boost style tests and documentation of course.

Doing one algorithm first to confirm that you are meeting expectations of test depth, style and documentation?

Consult direct with the library author(s) too.

Good luck.


Paul A. Bristow
Prizet Farmhouse
Kendal UK LA8 8AB
+44 (0) 1539 561830
> -----Original Message-----
> From: Boost [mailto:boost-bounces_at_[hidden]] On Behalf Of ?????? ?????????
> Sent: 26 July 2016 13:28
> To: boost_at_[hidden]
> Subject: [boost] Approximate matching to Boost.Algorithm
> 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:
> List:
> 1)Hamming Distance
> 2)Jaccard Distance
> 3)Jaro Distance
> 4)Jaro-Winkler Distance
> 5)Levenshtein Distance
> 6)Longest Common Subsequence
> 7)Longest Common Substring
> 8)Overlap Coefficient
> 9)Ratcliff-Obershelp Similarity
> 10)Sorensen-Dice Distance
> 11)Tanimoto Coefficient
> 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.
> _______________________________________________
> Unsubscribe & other changes:

Boost list run by bdawes at, gregod at, cpdaniel at, john at