To characterise the text in this manner, what one could do is take a group of words (say 1000) anywhere in the MS, and then inspect the following words (a smaller group, e.g. 100) to see how many of them occur in the previous 1000 and how many are new. One can do this in two different ways, either counting all words of the 100, or only the unique words of the 100.
This is similar to checking Heap's law, but lets one put the start of the MS in different places. This way, it is easier to see changes that are at an advanced point in the text.
This is similar to checking Heap's law, but lets one put the start of the MS in different places. This way, it is easier to see changes that are at an advanced point in the text.
![[+]](https://www.voynich.ninja/images/collapse_collapsed.png)
