Re: [boost] Re: Small lib proposal

From: Ben Young (ben_at_[hidden])
Date: 2002-10-23 02:49:01

Also, if any one is interested, I have an implementation of an Levenstein
distance that calculates the sub set of a sorted range that is within a
specified edit distance of a reference "string", far more efficiently than
just calculating it for each element. I implemented this for a spell
checker I wrote, but I can imagine it having lots of other uses.

At the moment it needs some work (its a bit specific) but say if you would
like it

Cheers

Ben
---
On Tue, 22 Oct 2002, Craig Henderson wrote:
>
> "Bohdan" <warever_at_[hidden]> wrote in message
> news:aourll$ubr$1_at_main.gmane.org...
> >
> > I'd like to look at your/Levenstain/Lalande implementaion and
> > i will appreciate if you give me few links.
>
> I've put my Edit Distance in the sandbox at
> http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/boost-sandbox/boost-sandbox/b
> oost/sequence_algo/edit_distance.hpp
>
> Regards
> -- Craig
>
>
>
>
> _______________________________________________
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
>
>