Proverb: Grid-Filling

After the candidate lists from the Expert modules are merged, the grid-filling algorithm attempts to find the most likely words for each slot. During this process the algorithm maintains a probability distribution over the letters for each grid square.

This animation illustrates this process by depicting the grid at each iteration. In each square we draw all 26 letters on top of each other, from least likely to most likely, using darker "ink" as we get more confident. Thus complete certainty will look like a crisp black letter in a white box, while a uniform distribution will look like a fuzzy gray blob.

In addition, the current progress of the system is noted by choosing the best guess letter at each iteration and shading those that are incorrect in pink.



1 2 3 4
5 6 7 8
9 10 11 12


Greg Keim (keim@cs.duke.edu)
Last modified: Thu Apr 29 09:32:08 EDT 1999