[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: VMs: Number crunching the Fincher window

Hi Elmar,
I thought of a simple square filled with Voynichese sentences (+ spaces) with a window (I thought not necessarily 1 line in height) moving randomly on it, too but I suddenly stopped when I found that the char frequencies distribution of first characters of each word and last characters of each word are totally different (and are totally different from the char frequencies distribution of the whole VM).
How do you think this problem can be solved?
One can think that the moving window will only start at a space on the main board, but this will produce fewer combinations of unique words.

At 10.29 14/09/04, you wrote:
Zitat von Koontz John E <John.Koontz@xxxxxxxxxxxx>:

> On Tue, 14 Sep 2004 elvogt@xxxxxxxxxxx wrote:
> ...
> > Any good ideas?
> I specialize in bad ideas,

Aah, my kind of man!

To summarize, my interpretation of the Fincher algorithm is:

1) You prepare a master table with a number n of master senctences in
Voynichese, all of approximately equal length, one sentence per line.

2) You place a piece of cardboard with a window cut in it somewhere on the
master table, and copy the visible letters to the VM. The window would be one
line high, and approx. x characters wide. (x is probably not a strict value --
why would it be?) I'll call the letters copied in one go a "batch".

3) The window might project over the left or the right edge of the master
table. In this case, you copy only the visible letters to the VM.

4) You repeat steps 2 and 3 until Rudolph gets wet in his pants.

So, under this assumption, a new VM line wouldn't necessarily coincide with a
new batch.

______________________________________________________________________ To unsubscribe, send mail to majordomo@xxxxxxxxxxx with a body saying: unsubscribe vms-list