Computer programs for detecting and correcting spelling errors
Communications of the ACM
A technique for computer detection and correction of spelling errors
Communications of the ACM
An Improved Program for Constructing Open Hash Tables
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Improved fast similarity search in dictionaries
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Super-Linear indices for approximate dictionary searching
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Efficient fuzzy search in large text collections
ACM Transactions on Information Systems (TOIS)
Efficient error-tolerant query autocompletion
Proceedings of the VLDB Endowment
| Hi-index | 48.22 |
The most common spelling errors are one extra letter, one missing letter, one wrong letter, or the transposition of two letters. Deletion, exchange, and rotation operators are defined which detect and “mend” such spelling errors and thus permit retrieval despite the errors. These three operators essentially delete a letter of a word, exchange two adjacent letters, and rotate a word cyclically. Moreover, the operators can be used in conjunction with hashing, thus permitting very fast retrieval. Results of experiments run on large databases in Hebrew and in English are briefly indicated.