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

*To*: "VMS List" <voynich@xxxxxxxx>*Subject*: Re: On the word length distribution*From*: "John Grove" <John@xxxxxxxxxxxx>*Date*: Thu, 28 Dec 2000 09:55:49 -0500*Delivered-to*: reeds@research.att.com*References*: <3A4A0DBA.BC28F9CE@voynich.nu><200012271855.eBRIt0J00982@coruja.dcc.unicamp.br><3A4A698E.4A60F050@voynich.nu> <200012280057.eBS0vWr01605@coruja.dcc.unicamp.br>*Sender*: jim@xxxxxxxxxxxxx

----- Original Message ----- From: "Jorge Stolfi" <stolfi@xxxxxxxxxxxxx> To: <rene@xxxxxxxxxx> Cc: <voynich@xxxxxxxx> Sent: Wednesday, December 27, 2000 7:57 PM Subject: Re: On the word length distribution > Note that in fact the word counts for each length are actually about > 12 times the pure binomial model. So the dictionary has > in fact about 6000 distinct words. > > > If we take this further, there should be a set of 12 characters > > (nice number!) of which every Voynich word should have: > > - exactly one (simple scenario) > > - at least one (complicated scenario) > > Unfortunately that is not the case. It looks more like some > variant of the "diacritics" solution Yikes - all this Math is hard on my head!!! I find it difficult to believe the author would have created such a cumbersome code as a 6000 word dictionary - what if he misplaced his dictionary? Does this binomial system account for the lack of doublets? I don't know what the math would do with such a system, but what if you created two 6x6 tables and filled them both with one 17 letter (plaintext) alphabet, the numbers 0-9, and the most frequently used letters filling in the remaining nine squares? The first table would be labelled according to the VMS character set found at the beginning of words, the second by word final characters. When to switch from the first table to the other thus bringing the encrypted word to a close could be random. Whenever the second table is used a space is added to the encryption. Am I right in assuming this would give you the binomial wordlength you've been looking at? You could also ensure that doublets didn't occur by selecting one of the other choices for most popular letters - or forcing a move to the second table. Labelling in my mind would be done by the 'stroke-order' concept with the initial stroke being the rows and the ligature being the columns. Perhaps a blank row label could account for double ligatures. Gallows could indicate a switch without a space - even backfilling a space so that a 'y' could immediately precede a gallows. Well, I'm not a cryptologist but I would like to think that a cipher system sounds more logical than a codebook of 6000 words - and I still would rather it turned out to be a natural language. John

**Follow-Ups**:**Re: On the word length distribution***From:*Jorge Stolfi

**References**:**RE: On the word length distribution***From:*Rene Zandbergen

**Re: On the word length distribution***From:*Jorge Stolfi

- Prev by Date:
**Re: Voynich -- Opening The Doors #2** - Next by Date:
**Re: Voynich -- Opening The Doors #2** - Previous by thread:
**Re: On the word length distribution** - Next by thread:
**Re: On the word length distribution** - Index(es):