When modeling the lexical rule P (X[α] → w), we could use features that consider the spelling of the word w in conjunction with the value of α.
we might learn that V [1] is particularly likely to rewrite as a word ending in -s. Spelling features that are predictable from string context are important clues to the existence and behavior of the hidden annotations we wish to induce.