Hypervector Analysis of the Voynich Manuscript

[ReneZ]

This is all very confusing, and I found the point where the confusion arises.

Referring to the You are not allowed to view links. Register or Login to view. ,  following is a clip from one page:

   

This is very counter-intuitive, and in other uses of bit strings this is quite different.

Using [0;1] ("binary") for the bits implies the use of 'false' and 'true'.

Using [-1;1] ("bipolar") is very different. This is just a matter of polarity. There is no more sense of true and false.

The clip above clearly indicates that the proposed implementation is confusing. This is due to the illogical mapping between binary and bipolar.

The algorithm should work independent from this mapping, but this is not the case.

Addition is independent of the mapping, but multiplication depends completely on this.

Multiplication is needed to compute correlation. In this respect, multiplication is done using the XNOR operation.

When the paper applies XOR, it is equivalent with addition.
This is also what you, Darrin, have done, so there is no issue.

However, the main issue I have remains, namely the higher PCA components.