If y is not a complete word, either of its left or right entropy, or both must be low.
for example, t¦µu is not a word but a substring of word t¦µu (appear) the choices of the right adjacent alphabets to t¦µu must be few and the right entropy of t¦µu, when the right adjacent alphabet is tu, must be low.