From: Dirk Meijer <hawkman.gelooft@...>
Date: 2006-04-22T03:46:04+09:00
Subject: Re: [QUIZ] Text Munger (#76)

you know, it's great that this quiz is easy! when i had read the other
ones, i'd feel hopeless and most of the times, i wouldn't even try,
but with this quiz, i knew i could come up with a solution, which made
me study the MatchData class, which'll come in handy for sure some
day!
greetings, Dirk.

2006/4/21, Mike <ruby@crazyted.com>:
> > Random playing around...
> >
> > Neo:~/Desktop$ ruby gregory_seidmans_solution.rb
> > test_document.txt Atchtaed is my r�sum�.
> > Neo:~/Desktop$ ruby gregory_seidmans_solution.rb
> > test_document.txt Acaehttd is my r�sum�.
> > Neo:~/Desktop$ ruby gregory_seidmans_solution.rb
> > test_document.txt Atceahtd is my r�sum�.
> > Neo:~/Desktop$ ruby gregory_seidmans_solution.rb
> > test_document.txt Ahaecttd is my r�sum�.
> >
>
> Keep in mind that longer words with a purely randomly munged inside will not
> be "readable".
>
> "Ahaecttd" takes effort to figure out that it was "Attached" before the
> munging.
>
> The physical process of munging is very easy (as we've seen from people
> reporting one line results), but modeling something that'll also produce
> "readable" results for all lengths of words is a bit more challenging. :)
>
> -M
>
>