[Boost-users] Approximate string matching ?

From: remi.chateauneu_at_[hidden]
Date: 2005-03-03 15:55:17

I sometimes need to make approximate string matching, i.e. to know 
whether to strings are close,
without being identical.
There are methods to do that, see "Approximate String Matching", 
Levenshtein's algorithm for strings distance, ASM, Ukkonen, Boyer-Moore 
algorithms, etc...

I would like to know if there is a plan to provide this kind of feature 
in Boost, maybe with the regular expression library or the string 
algorithms.

Thanks !