Using Massimiliano Zattera's slot sequence or a different one to find missing spaces?

[ReneZ]

To improve the unambiguous slot sequence, I propose q = ch, allowing two ch in the pattern (the first one is equivalent to q):

I agree that this is a sensible improvement of the slot table. It was already considered in the earliest days of the old mailing list, by member Mike Roe. His system is shown on this page: You are not allowed to view links. Register or Login to view.

I imagine that another simplification could be achieved by not trying to fit compound words (or what look like compound words) in the slot, but to allow a recycle back into an earlier point of the slot.

An example of such a compound word is Hermes' choldaiin.