A tale of three spelling checkers
James K. Mullin, Daniel Margoliash · Software Practice and Experience · 1990
Abstract This paper describes three spelling checkers implemented at the University of Western Ontario. The first is interesting for its functionality and high compression of its dictionary; the second for its unexpected failure and the third for using the lesson of the previous to good advantage. The principal contributions of this work are a compressed dictionary structure at 12 bits per dictionary token; and the ability to offer suggested corrections from a structure without the words explicitly stored.