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

Subject: Re: [boost] [gsoc-2013]Approximate string matching
From: Yu Jiang (sunlightt07_at_[hidden])
Date: 2013-04-24 10:47:19

2013/4/23 Erik Erlandson <eerlands_at_[hidden]>
>
> How one would design the interface for edit_distance<> is an interesting
> question. In the basic general case, edit_distance<> is a function of two
> sequences, and a cost matrix for insertion/deletion/substitution/equality.
> In boost/template world, the "equality" test would of course be a template
> parameter, with the expected default. These days, I'd expect to be able to
> provide sequences as either begin/end iterators, or ranges. The cost matrix
> could be either provided as numeric values or functionals, with defaults
> to: 1/1/1/0.
>

Thanks for your advice! I'm working on writing a proposal. Looking forward
to your further advice on my proposal.