Re: [boost] [gsoc 2013] Approximate string matching

----- Original Message -----

On Apr 17, 2013, at 10:40 AM, Jan Strnad wrote:

...

So, to sum it up: I would like to implement following approximate distance functions as an extension of Boost String Algorithm library:

I have been wondering if these distance functions should be specifically part of string algorithms, or more general algorithms. For example, edit distance is really a function on any two sequences, not just sequences of characters. Rather like std::sort() is an algorithm that can be applied to a sequence of any kind of object.