A technique for computer detection and correction of spelling errors

By F. J. Damerau. 1964

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Natural Language Processing

Citations in the corpus

An Improved Error Model for Noisy Channel Spelling Correction (2000, methodology): “Previous error models have all been based on Damerau-Levenshtein distance measures (Damerau 1964; Levenshtein 1966), where the distance between two strings is the minimum number of single character insertions, substitutions and deletions (and in some cases, character pair transpositions) necessary…”
PromptRobust: Towards Evaluating the Robustness of Large Language Models on Adversarial Prompts (2023, unknown): “Leveraging spelling checks (Kukich, 1992; Damerau, 1964) to maintain input fidelity can counteract basic adversarial techniques targeting typographical errors (character-level attacks) and inconsistencies (sentence level attacks).”
Text Entry for Mobile Computing: Models and Methods,Theory and Practice (2002, methodology): “Algorithms for “string distance” calculations, such as the Levenshtein string distance statistic (Damerau, 1964; Levenshtein, 1966), might assist in automating analyses such as these, as demonstrated by Soukoreff and MacKenzie (2001). Difficulties in error tabulation have pushed some researchers to ”
Measuring personalization of web search (2013, unknown): “, the Damerau-Levenshtein distance [7]) to make the test list identical to the control list.”
Learning a Spelling Error Model from Search Query Logs (2005, background): “The (cid:2)rst dictionary based approach to spelling correction (Damerau, 1964) considers all words that can not be found in a dictionary as misspellings.”
Data Matching (2012, methodology): “In this particular study, single character variations only accounted for 39 % of all variations compared to the over 80 % reported by Damerau [89].”
Google Scholar, Web of Science, and Scopus: a systematic comparison of citations in 252 subject categories (2018, methodology): “The title of each unmatched document citing X in A was compared to the titles of all the unmatched document citing X in B, using the restricted DamerauLevenshtein distance (optimal string alignment) (Damerau, 1964; Levenshtein, 1966).”
Dealing with Input Noise in Statistical Machine Translation (2012, methodology): “2 Related work Misspelling correction has been a recurrent issue to be resolved on NLP since its very first beginnings (Damerau, 1964).”
Mining Query Logs: Turning Search Usage Data into Knowledge (2010, methodology): “erau [71] published the seminal work on spelling correction.”
IoT SENTINEL: Automated Device-Type Identification for Security Enforcement in IoT (2016, methodology): “The fingerprint comparison is done by computing DamerauLevenshtein edit distance [10], which considers the insertion, deletion, substitution and immediate transposition of characters.”
Predictive Business Process Monitoring with LSTM Neural Networks (2016, methodology): “An evaluation measure that better reflects the prediction quality of is the Damerau-Levenstein distance [7], which adds a swapping operation to the set of operations used by Levenshtein distance.”
Partial Similarity of Objects, or How to Compare a Centaur to a Horse (2009, background): “Problems requiring comparison of such sequences arise in linguistics (Gooskens and Heeringa 2004), web search (Giles et al. 1998; Di Lucca et al. 2002), spell checking (Damerau 1964), plagiarism detection (Wise 1996), speech recognition, and bioinformatics (Kruskal 1999; Bonhoeffer et al. 2004).”
Text Entry Systems: Mobility, Accessibility, Universality (2007, methodology): “The error-correction operations available to us are inserting a character, deleting (or omitting) a character, and substituting a character (Damerau, 1964; Morgan, 1970; Gentner et al., 1984).”
Ontology Matching (2007, methodology): “distance (Damerau 1964) uses in addition the transposition operation, swapping two”
Making sense of credibility on the Web: Models for evaluating online information and recommendations for future research (2007, background): “A number of studies have highlighted the context for correcting such errors and eliminating ambiguity ( Damerau, 1964; Hull, 1992; Mays, Damerau, & Mercer, 1991; Riseman & Ehrich, 1971; Schulz & Mihov, 2002).”
A Comparison of Personal Name Matching: Techniques and Practical Issues (2006, methodology): “Damerau-Levenshtein distance is a variation of edit distance where a transposition of two characters is also considered to be an elementary edit operation [8, 19].”