Generated word tokens from chars ( pairs )
#1
I've started an experiment to see if it's possible to generate word tokens from word types under certain conditions. The following conditions must be met:
  • The ratio of word types to word tokens should be as similar as possible to the VMS ( as extrapolated ).
  • The method should be simple enough to use, i. e. conversion to ciphertext and back to plain text should be possible without using a codebook or other tools.
  • Only character set A-Z and 0-9 was used.
  • All text should be generated with only one method. Subsequent adjustments were excluded.
The wordlist was generated from the "Regimen sanitatis Magnini Mediolanensis (vol. 1)". It contains 5391 words types. The plaintext has 25014 words, the generated text has 23264 word tokens.


Rules:
  • The first letter is always single, so "D" is 4.
  • If char is A-Y then it must be replaced with a number ( A=1, B=2, C=3 ...).
  • "Z" is space.
  • If char is a number then no change is needed.
  • If the second and third chars are "AZ" ( 1 ) then no division or swap is needed ( see  "CAZC" ).
The diagram looks like this:

[Image: wordlist.png]
This is the procedure explained by the word "zodiacus":
You are not allowed to view links. Register or Login to view.
To be clear, i don't know if this procedure shows a similar result for other comparable texts. The table is attached.

You are not allowed to view links. Register or Login to view.
Reply


Messages In This Thread
Generated word tokens from chars ( pairs ) - by bi3mw - 10-03-2018, 02:45 AM

Possibly Related Threads…
Thread Author Replies Views Last Post
  High ammount of bidirectional pairs quimqu 3 5,256 16-05-2024, 07:53 PM
Last Post: nablator

Forum Jump:


Users browsing this thread: 1 Guest(s)