Vord verifier

[MarcoP]

Hi Marco - that is an error (thank you for catching it). It should be lowercase s (s) alone. Column 2 should have <s> - <ch> - <Sh>, and column 9 should  have <d> - <s> <ch>. I was trying to generalize why there is often <saiin> and <daiin>, words ending <oldy> and <olsy>, etc. (But it's still not a perfect table)

Thank you for the clarification, Thomas!

As Sam pointed out, your table is equivalent to a regular expression. It is similar to Neal's but there are differences of course.

I tried translating it to a unix (grep) regular expression and it seems to match 57% of the unique words in Takeshi Takahashi's transcription.
Here's a random sample of 30 unmatched words with the command I used:

grep -Ev  '^(q|d)?(s|ch|sh)?(o|e|y|ol)?(k|t|p|f)?(ch|sh)?(e|ee|eee)?(o|a)?(r|l)?(d|s|ch)?(o|a)?(n|in|iin|m|r|l)?y?$' ../allwords_uniq | sort -R | head -30  | sort

aloiiin
ataiin
aty
chdchy
cheeg
cthoepain
dchodees
dcthy
esechor
kotchody
laiiin
lfchy
ltai
ochockhy
oechedy
olekeey
olsai
opaiiral
pcharalor
pokar
polkeedal
qepoepy
qoedeey
qoteode
qoykeey
rodeedy
sheoeky
shoikhy
socthey
todai

It would also be interesting to measure how many "non Voynichese" words are matched by a regex, but this is more difficult to do. For instance, the regex '[a-z]*' matches all alphabetic strings, 100% of Voynichese included, but it also matches any random alphabetic string.