Engineering your own voynich

[nablator]

Now looking for the longest repeated strings, there are quite a few for such a short text, so homophones for many tokens are unlikely.

ooiea Tiaeean bar nmaei Teib
T fiiinuy Timyun Taeaei
ir Tian Fooyun Fiiiyun
iaq meaei Tiavinn Ti
TiiiT fiiinuy Ti
aiiea Tiiiig Ki
qeK niinuy
...

Is that what deterministic means: only one cipher text is possible? This would exclude homophones and nulls.