In:
ACM Transactions on Database Systems, Association for Computing Machinery (ACM), Vol. 8, No. 3 ( 1983-09), p. 410-433
Abstract:
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.
Type of Medium:
Online Resource
ISSN:
0362-5915
,
1557-4644
DOI:
10.1145/319989.319994
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
1983
detail.hit.zdb_id:
196155-X
detail.hit.zdb_id:
2006335-0
Permalink
