Computer programs for detecting and correcting spelling errors
Communications of the ACM
BLISS: a language for systems programming
Communications of the ACM
Exact and approximate membership testers
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
Parallel free-text search on the connection machine system
Communications of the ACM - Special issue on parallelism
Practical performance of Bloom filters and parallel free-text searching
Communications of the ACM
Optimization of a hierarchical file organization for spelling correction
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
On the design of an interactive spelling dictionary for personal computers
SIGSMALL '83 Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers
| Hi-index | 48.23 |
The paper, “Computer Programs for Detecting and Correcting Spelling Errors” by James L. Peterson [3], listed methods for checking and correcting spelling errors. One significant method, however, was not included: a probabilistic technique suggested by Carter, Floyd, Gill, Markovsky, and Wegman [1]. The present note discusses aspects of these practical space efficient algorithms for testing set membership—a simple abstraction of looking a word up in a dictionary. An implementation of one of these algorithms uses only 20 percent of the space used by the Stanford SPELL program described by Peterson.