From: Mark Woodward <markonlinux@...>
Date: 2008-04-30T11:00:05+09:00
Subject: Re: Levenshtein_distance and recreate the string

On Apr 30, 11:13 am, Ams Lo <rgow...@gmail.com> wrote:
> Hi -
>
> A general computer science question-
>
> Given the levenshtein distance between two strings and one of the
> strings S1, is it possible to re-create the second string.
>
> For example -
>
> S1 = "RUBY"
>
> S2 = "BRUY"
>
> lev_distance = 3
>
> Given 3 and S2, is it possible to recreate S1??
>
> Many thanks,
> --
> Posted viahttp://www.ruby-forum.com/.

would S1 be BOAT (BRUT, BRAT, BOAT), GRAN (BRAY, GRAY, GRAN), GOUT
(BOUY, BOUT, GOUT) or ....?
ie I think you need to know where you're going in order to know how to
get there.
What S1 are we recreating?


cheers,


--
Mark