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

On 4/28/2013 9:07 PM, Erik Erlandson wrote:

----- 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.

The Introduction of Boost String Algorithms Library states: Important note: In this documentation we use term string to designate a sequence of characters stored in an arbitrary container. A string is not restricted to std::basic_string and character does not have to be char or wchar_t, although these are most common candidates. Consult the design chapter to see precise specification of supported string types. see: http://www.boost.org/doc/libs/1_53_0/doc/html/string_algo.html#string_algo.i... Which refers to: http://www.boost.org/doc/libs/1_53_0/doc/html/string_algo/design.html Jeff