The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
An improved error model for noisy channel spelling correction
Open accessAbstract
The noisy channel model has been applied to a wide range of problems, including spelling correction. These models consist of two components: a source model and a channel model. Very little research has gone into improving the channel model for spelling correction. This paper describes a new channel model for spelling correction, based on generic string to string edits. Using this model gives significant performance improvements compared to previously proposed models.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Binary Codes capable of currecting deletions, insertions, and reversals
Levenshtein, V. I. (1965) · Soviet physics. Doklady · Cited by 14,807
Maximum Likelihood from Incomplete Data via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1976) · Cited by 4,517
Jurafsky, D. S., & Martin, J. (2000) · Cited by 4,132
Speech and language processing
(2010) · Day-to-Day Dyslexia in the Classroom · doi:10.4324/9780203461891_chapter_3 · Cited by 3,544
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
A technique for computer detection and correction of spelling errors
Damerau, F. J. (1964) · Communications of the ACM · doi:10.1145/363958.363994 · Cited by 1,575
Techniques for automatically correcting words in text
Kukich, K. (1992) · ACM Computing Surveys · doi:10.1145/146370.146380 · Cited by 1,257
Ristad, E. S., & Yianilos, P. N. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.682181 · Cited by 859
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
A Winnow-Based Approach to Context-Sensitive Spelling Correction
Golding, A. R., & Roth, D. (1999) · Machine Learning · doi:10.1023/a:1007545901558 · Cited by 291
Context based spelling correction
Mays, E., Damerau, F. J., & Mercer, R. L. (1991) · Information Processing & Management · doi:10.1016/0306-4573(91)90066-u · Cited by 266
Probability scoring for spelling correction
Church, K. W., & Gale, W. A. (1991) · Statistics and Computing · doi:10.1007/bf01889984 · Cited by 181
Learning string edit distancePreprint
Ristad, E. S., & Yianilos, P. N. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9610005 · Cited by 34
Cited by
Challenges in Data-to-Document Generation
Wiseman, S., Shieber, S., & Rush, A. (2017) · Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d17-1239 · Cited by 524
(2011) · Cited by 446
A phrase-based statistical model for SMS text normalization
Aw, A., Zhang, M., Xiao, J., & Su, J. (2006) · Proceedings of the COLING/ACL on Main conference poster sessions - · doi:10.3115/1273073.1273078 · Cited by 278
Combating Adversarial Misspellings with Robust Word Recognition
Pruthi, D., Dhingra, B., & Lipton, Z. C. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1561 · Cited by 275
Darwish, K., & Magdy, W. (2014) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000031 · Cited by 102
Metadata
- Authors
- Brill, E., & Moore, R. C.
- Venue
- Proceedings of the 38th Annual Meeting on Association for Computational Linguistics - ACL '00
- Published
- 2000
- Pages
- 286-293
- OpenAlex
- W2057900969
- Cited by
- 531
- References
- 16
- FWCI
- 3.38
- Type
- conference paper
- 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.