On Tue, Apr 29, 2008 at 9:13 PM, Ams Lo <rgowka1 / 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??

Hmmm, smells like a homework assignment.

Hint, do you suppose that strings other than "RUBY" might have a
levenshtein distance of 3 from "BRUY"?

-- 
Rick DeNatale

My blog on Ruby
http://talklikeaduck.denhaven2.com/