Levenshtein Distance algorithm

From: Philippe Lalande (plalande-yahoo_at_[hidden])
Date: 2002-09-18 10:27:55

Hi,

I was wondering if anyone could tell me if Boost contains a function
that could perform a 'Levenshtein distance' calculation on a sequence.
The Levenshtein distance is a measure of the similarity between two
strings calculated as the number of deletions, insertions, or
substitutions required to transforms the source string to the target
string. IMO, it is an interesting algorithm that could apply to any kind
of sequence.

I'd be happy to discuss interface and implementation on the dev list if
such algorithm does not exist yet.

Thank you
Philippe