The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Generation and search of clustered files
ACM Transactions on Database Systems (TODS)
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Office Information Systems and Computer Science
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Another spelling correction program
Communications of the ACM
The keystroke-level model for user performance time with interactive systems
Communications of the ACM
Computer programs for detecting and correcting spelling errors
Communications of the ACM
The choice of reference points in best-match file searching
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
Communications of the ACM
Some approaches to best-match file searching
Communications of the ACM
Hierarchical storage in information retrieval
Communications of the ACM
A retrieval system for on-line English-Japanese dictionaries
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
New techniques for best-match retrieval
ACM Transactions on Information Systems (TOIS)
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
Browsing in a digital library collecting linearly arranged documents
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Query Processing for Distance Metrics
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
The automatic correction of misspelled inputs is discussed from a viewpoint of similar-string matching. First a hierarchical file organization based on a linear ordering of records is presented for retrieving records highly similar to any input query. Then the spelling problem is attacked by constructing a hierarchical file for a set of strings in a dictionary of English words. The spelling correction steps proceed as follows: (1) find one of the best-match strings which are most similar to a query, (2) expand the search area for obtaining the good-match strings, and (3) interrupt the file search as soon as the required string is displayed. Computational experiments verify the performance of the proposed methods for similar-string matching under the UNIX™ time-sharing system.