Development of a Spelling List
- 1 January 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 30 (1), 91-99
- https://doi.org/10.1109/tcom.1982.1095395
Abstract
The word list used by the UNIX spelling checker, SPELL, was developed from many sources over several years. As the spelling checker may be used on minicomputers, it is important to make the list as compact as possible. Stripping prefixes and suffixes reduces the list below one third of its original size, hashing discards 60 percent of the bits that remain, and data compression halves it once again. This paper tells how the spelling checker works, how the words were chosen, how the spelling checker was used to improve itself, and how the (reduced) list of 30000 English words was squeezed into 26000 16-bit machine words.Keywords
This publication has 7 references indexed in Scilit:
- Computer programs for detecting and correcting spelling errorsCommunications of the ACM, 1980
- Exact and approximate membership testersPublished by Association for Computing Machinery (ACM) ,1978
- Efficient string matchingCommunications of the ACM, 1975
- Optimal source codes for geometrically distributed integer alphabets (Corresp.)IEEE Transactions on Information Theory, 1975
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970
- Scatter storage techniquesCommunications of the ACM, 1968
- Run-length encodings (Corresp.)IEEE Transactions on Information Theory, 1966