The method described assumes that a word which cannot be found in a dictionary has at most one error, which might be a wrong, missing or extra letter or a single transposition. The unidentified input word is compared to the dictionary again, testing each time to see if the words match—assuming one of these errors occurred. During a test run on garbled text, correct identifications were made for over 95 percent of these error types.
Описание
A technique for computer detection and correction of spelling errors
%0 Journal Article
%1 damerau1964technique
%A Damerau, Fred J.
%C New York, NY, USA
%D 1964
%I ACM
%J Commun. ACM
%K damerau distance levenshtein spelling
%N 3
%P 171--176
%R 10.1145/363958.363994
%T A Technique for Computer Detection and Correction of Spelling Errors
%U http://doi.acm.org/10.1145/363958.363994
%V 7
%X The method described assumes that a word which cannot be found in a dictionary has at most one error, which might be a wrong, missing or extra letter or a single transposition. The unidentified input word is compared to the dictionary again, testing each time to see if the words match—assuming one of these errors occurred. During a test run on garbled text, correct identifications were made for over 95 percent of these error types.
@article{damerau1964technique,
abstract = {The method described assumes that a word which cannot be found in a dictionary has at most one error, which might be a wrong, missing or extra letter or a single transposition. The unidentified input word is compared to the dictionary again, testing each time to see if the words match—assuming one of these errors occurred. During a test run on garbled text, correct identifications were made for over 95 percent of these error types.},
acmid = {363994},
added-at = {2015-03-13T18:44:37.000+0100},
address = {New York, NY, USA},
author = {Damerau, Fred J.},
biburl = {https://www.bibsonomy.org/bibtex/2e044ce6c52f977e009f9ca3d0e578eef/sdo},
description = {A technique for computer detection and correction of spelling errors},
doi = {10.1145/363958.363994},
interhash = {b10df81f1860fd8bd7990f4684ad6f3a},
intrahash = {e044ce6c52f977e009f9ca3d0e578eef},
issn = {0001-0782},
issue_date = {March 1964},
journal = {Commun. ACM},
keywords = {damerau distance levenshtein spelling},
month = mar,
number = 3,
numpages = {6},
pages = {171--176},
publisher = {ACM},
timestamp = {2015-03-13T18:46:58.000+0100},
title = {A Technique for Computer Detection and Correction of Spelling Errors},
url = {http://doi.acm.org/10.1145/363958.363994},
volume = 7,
year = 1964
}