[Boost-users] Re: Approximate string matching ?

From: Jonathan Turkanis (technews_at_[hidden])
Date: 2005-03-03 16:13:35

remi.chateauneu_at_[hidden] wrote:
> 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.

It sounds like this would go in the string algorithms library rather than regex.

If no one is already working on it, it would be helpful for you to suggest
possible interfaces for the algorithms you mention, or better yet, provide an
implementation.

BTW, this message appears to be a reply to a message in the "Any constructor
evaluation..." thread, so some people may overlook it.

> Thanks !

Jonathan