Premium
Hash‐bucket search: A fast technique for searching an english spelling dictionary
Author(s) -
Comer Douglas,
Shen Vincent Y.
Publication year - 1982
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380120708
Subject(s) - spelling , computer science , hash function , hash table , double hashing , table (database) , information retrieval , natural language processing , database , programming language , linguistics , philosophy
When a document is prepared using a computer system, it can be checked for spelling errors automatically and efficiently. This paper reviews and compares several methods for searching an English spelling dictionary. It also presents a new technique, hash ‐ bucket search, for searching a static table in general, and a dictionary in particular. Analysis shows that with only a small amount of space beyond that required to store the keys, the hash‐bucket search method has many advantages over existing methods. Experimental results with a sample dictionary using double hashing and the hash‐bucket techniques are presented.