the autocorrection algorithm became this: Arrange typed keys in a set of tumblers with their neighboring keys. Spin the tumblers to check every letter combination. Note the dictionary words found by spinning the tumblers. Calculate the pattern skew for every found word. Multiply the usage frequency value for each found word with the reciprocal of its pattern skew. From all the found words, suggest the one with the greatest multiplied total of usage frequency and pattern skew.1