A model and a fast algorithm for multiple errors spelling correction (Q808697): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A program for correcting spelling errors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Data structures and algorithms for approximate string matching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Extension of the String-to-String Correction Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spelling correction in systems programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast algorithm for the longest-common-subsequence problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The String-to-String Correction Problem / rank | |||
Normal rank |
Latest revision as of 09:36, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A model and a fast algorithm for multiple errors spelling correction |
scientific article |
Statements
A model and a fast algorithm for multiple errors spelling correction (English)
0 references
1992
0 references
A new model for new multiple errors spelling correction is proposed. The model handles insert, delete, change, and transpose errors. In the new model, we put constraints on possible editing sequences to reflect the error occurrence phenomenon in spelling, resulting in an error measure different from the traditional editing distance error measure. Properties of the ``error distance matrix'' between two character strings are studied under the assumptions of the new model. A cut-off criterion has been discovered, which can detect whether the error distance between two character strings is greater than a prespectified value during the calculation. Based on this cut-off criterion, a fast algorithm has been developed to find the nearest neighbors of a given character string in a dictionary. Experiments have been conducted with results showing that the cut-off criterion can greatly cut down the computation time needed for the nearest neighbor searching.
0 references
errors spelling correction
0 references
error distance between two character strings
0 references