The DOI matches its Crossref record.
A technique for computer detection and correction of spelling errors
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Martín-Martín, A., Orduna-Malea, E., Thelwall, M., & Delgado López-Cózar, E. (2018) · Journal of Informetrics · doi:10.1016/j.joi.2018.09.002 · Cited by 1,990
Martín-Martín, A., Thelwall, M., Orduna-Malea, E., & Delgado López-Cózar, E. (2021) · Scientometrics · doi:10.1007/s11192-020-03690-4 · Cited by 1,018
Ego4D: Around the World in 3,000 Hours of Egocentric Video
Grauman, K., Westbury, A., Byrne, E., Chavis, Z., Furnari, A., Girdhar, R., Hamburger, J., Jiang, H., Liu, M., Liu, X., et al. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01842 · Cited by 630
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
Measuring personalization of web search
Hannak, A., Sapiezynski, P., Molavi Kakhki, A., Krishnamurthy, B., Lazer, D., Mislove, A., & Wilson, C. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488435 · Cited by 396
Information retrieval and text mining technologies for chemistry
Krallinger, M., Rabal, O., Lourenço, A., Oyarzabal, J., & Valencia, A. (2017) · Chemical Reviews · doi:10.1021/acs.chemrev.6b00851 · Cited by 281
Nguyen (2022) · doi:10.1145/3453476 · Cited by 286
Tracking Code Clones in Evolving Software
Duala-Ekoko, E., & Robillard, M. P. (2007) · 29th International Conference on Software Engineering (ICSE'07) · doi:10.1109/icse.2007.90 · Cited by 222
Analyzing the input stream for character- level errors in unconstrained text entry evaluations
Wobbrock, J. O., & Myers, B. A. (2006) · ACM Transactions on Computer-Human Interaction · doi:10.1145/1188816.1188819 · Cited by 200
Mining query logs: turning search usage data into knowledge
Silvestri, F. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000013 · Cited by 194
(2007) · Cited by 192
Is this app safe?: a large scale study on application permissions and risk signals
Chia, P. H., Yamamoto, Y., & Asokan, N. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187879 · Cited by 184
PromptRobust: Towards Evaluating the Robustness of Large Language Models on Adversarial Prompts
Zhu, K., Wang, J., Zhou, J., Wang, Z., Chen, H., Wang, Y., Yang, L., Ye, W., Zhang, Y., Gong, N., et al. (2023) · Proceedings of the 1st ACM Workshop on Large AI Systems and Models with Privacy and Safety Analysis · doi:10.1145/3689217.3690621 · Cited by 151
(2014) · USENIX Security Symposium · Cited by 121
(2007) · doi:10.1016/b978-012373591-1/50003-6 · Cited by 84
Lu, N., Wu, G., Zhang, Z., Zheng, Y., Ren, Y., & Choo, K. R. (2020) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.5627 · Cited by 76
Enhancing Levenshtein’s Edit Distance Algorithm for Evaluating Document Similarity
Rani, S., & Singh, J. (2018) · Communications in Computer and Information Science · doi:10.1007/978-981-13-0755-3_6 · Cited by 27
From Legacy to Standard: LLM-Assisted Transformation of Cybersecurity Playbooks into CACAO Format
Akbari Gurabi, M., Nitz, L., Castravet, R.-M., Matzutt, R., Mandal, A., & Decker, S. (2026) · Lecture Notes in Computer Science · doi:10.1007/978-3-032-16092-8_27 · Cited by 3
Metadata
- Authors
- Damerau, F. J.
- Venue
- Communications of the ACM
- Published
- 1964-03
- Volume
- 7
- Issue
- 3
- Pages
- 171-176
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2066792529
- Cited by
- 1,575
- References
- 0
- FWCI
- 3.17
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.