List of "weird" vords

[Mark Knowles]

While it is possible in principle, I suspect an encoding like this should leave its traces in various character combination statistics, allowing for clear separation of character combinations into two classes. I'm not aware of any computational results that would support this. I don't think there is a very clear boundary between statistically ordinary and unusual words, for example. When you look at character combination statistics, there appears to be a very smooth continuum. I would expect some boundary if part of the text was the actual encoding and another large part just nulls.

If you can provide statistical evidence for this that would be interesting.