Sukhotin's algorithm is quite straightforward and can be done by hand.
Of course this is not efficient for long texts, but it would allow to check your code with an example.
You are not allowed to view links. Register or Login to view.
(Sorry, I also don't know python).
Edit:
doing this will also not be the answer to all questions. It requires to have a good idea about what are the individual characters in the text.
For this, one should not use Eva. I would recommend something along the lines of the FSG alphabet, or this:
You are not allowed to view links. Register or Login to view.
These two options tend to generate quite similar statistics.
Of course this is not efficient for long texts, but it would allow to check your code with an example.
You are not allowed to view links. Register or Login to view.
(Sorry, I also don't know python).
Edit:
doing this will also not be the answer to all questions. It requires to have a good idea about what are the individual characters in the text.
For this, one should not use Eva. I would recommend something along the lines of the FSG alphabet, or this:
You are not allowed to view links. Register or Login to view.
These two options tend to generate quite similar statistics.


![[+]](https://www.voynich.ninja/images/collapse_collapsed.png)