A spelling correction method and its application to an OCR system

Takahashi, Hidetoshi; Itoh, Nobuyasu; Amano, Tomio; Yamashita, Atsushi

doi:10.1016/0031-3203(90)90023-e

Cited by 47 publications

(16 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The system is designed around common knowledge about typical OCR errors and dynamic knowledge which is gathered as the user interactively spell checks a document. Approximate string matching techniques [26,25] are used to determine what we refer to as confusions. Consider the following misspelling:…”

Section: Methodsmentioning

confidence: 99%

OCRSpell: an interactive spelling correction system for OCR errors in text

Taghva

Stofsky

2001

IJDAR

View full text Add to dashboard Cite

In this paper, we describe a spelling correction system designed specifically for OCR-generated text that selects candidate words through the use of information gathered from multiple knowledge sources. This system for text correction is based on static and dynamic device mappings, approximate string matching, and ngram analysis. Our statistically based, Bayesian system incorporates a learning feature that collects confusion information at the collection and document levels. An evaluation of the new system is presented as well.

show abstract

Section: Methodsmentioning

confidence: 99%

OCRSpell: an interactive spelling correction system for OCR errors in text

Taghva

Stofsky

2001

IJDAR

View full text Add to dashboard Cite

show abstract

“…This metric is well suited for touch-typed text but other metrics should be used for texts entered in other ways; for instance, hand-written text, and texts that have been entered using OCRtechniques, see Takahashi et al (1990) and the section below, are likely to contain different types of errors.…”

Section: Spelling Error Correctionmentioning

confidence: 98%

“…In earlier studies of automatic spelling correction, see for instance Takahashi et al (1990), it has been considered impractical to use word lists larger than about 10,000 words. Using our methods, it is possible to have extremely large word lists without having to sacrifice speed.…”

Section: Spelling Error Correctionmentioning

confidence: 99%

Detection of spelling errors in Swedish not using a word list En Clair*

Domeij

Hollman

Kann

1994

Journal of Quantitative Linguistics

View full text Add to dashboard Cite

show abstract

“…Many studies focus on automatic spelling correction (Accomazzi, Eichhorn, Kurtz, Grant, & Murray, 2000;Angell, Freund, & Willett, 1983;Blair, 1960;Cucerzan & Brill, 2004;Damerau & Mays, 1989;Davidson, 1962;Gadd, 1988;Kukich, 1992;Landau & Vishkin, 1986;Petersen, 1986;Pollock & Zamora, 1984;Rogers & Willett, 1991;Takahashi, Itoh, Amano, & Yamashita, 1990;Ullmann, 1977;Zobel & Dart, 1995). 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).…”

Section: Introductionmentioning

confidence: 99%

Approximate personal name‐matching through finite‐state graphs

Gálvez

Anegón

2007

J. Am. Soc. Inf. Sci.

View full text Add to dashboard Cite

This article shows how finite-state methods can be employed in a new and different task: the conflation of personal name variants in standard forms. In bibliographic databases and citation index systems, variant forms create problems of inaccuracy that affect information retrieval, the quality of information from databases, and the citation statistics used for the evaluation of scientists' work. A number of approximate string matching techniques have been developed to validate variant forms, based on similarity and equivalence relations. We classify the personal name variants as nonvalid and valid forms. In establishing an equivalence relation between valid variants and the standard form of its equivalence class, we defend the application of finite-state transducers. The process of variant identification requires the elaboration of: (a) binary matrices and (b) finite-state graphs. This procedure was tested on samples of author names from bibliographic records, selected from the Library and Information Science Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The results demonstrate the usefulness of this approach, although it should be complemented with methods based on similarity relations for the recognition of spelling variants and misspellings.

show abstract

A spelling correction method and its application to an OCR system

Cited by 47 publications

References 9 publications

OCRSpell: an interactive spelling correction system for OCR errors in text

OCRSpell: an interactive spelling correction system for OCR errors in text

Detection of spelling errors in Swedish not using a word list En Clair*

Approximate personal name‐matching through finite‐state graphs

Contact Info

Product

Resources

About