Abstract
In this paper we propose a simple, flexible and efficient hybrid spell checking methodology based upon phonetic matching, supervised learning and associative matching in the AURA neural system. We evaluate our approach against several benchmark spell-checking algorithms for recall accuracy. Our proposed hybrid methodology has the joint highest top 10 recall rate of the techniques evaluated. The method has a high recall rate and low computational cost.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aspell. Web page http://aspell.sourceforge.net/.
J. Austin. Distributed associative memories for high speed symbolic reasoning. In R. Sun and F. Alexandre, (editors), IJCAI’ 95 Working Notes of Workshop on Connectionist-Symbolic Integration: From Unified to Hybrid Approaches, pages 87–93, Montreal, Quebec, Aug. 1995.
F. Damerau. A technique for Computer Detection and Correction of Spelling Errors. Communications of the ACM, 7(3):171–176, 1964.
K. Kukich. Techniques for Automatically Correcting Words in Text. ACM Computing Surveys, 24(4):377–439, 1992.
J. R. Ullman. A Binary N-Gram Technique for Automatic Correction of Substitution, Deletion, Insertion and Reversal Errors in Words. Computer Journal, 20(2):141–147, May 1977.
S. Wu and U. Manber. AGREP-A Fast Approximate Pattern Matching Tool. In Usenix Winter 1992 Technical Conference, pages 153–162, San Francisco, CA, Jan. 1992.
S. Wu and U. Manber. Fast Text Searching With Errors. Communications of the ACM, 35, Oct. 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hodge, V.J., Austin, J. (2001). A Novel Binary Spell Checker. In: Dorffner, G., Bischof, H., Hornik, K. (eds) Artificial Neural Networks — ICANN 2001. ICANN 2001. Lecture Notes in Computer Science, vol 2130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44668-0_167
Download citation
DOI: https://doi.org/10.1007/3-540-44668-0_167
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42486-4
Online ISBN: 978-3-540-44668-2
eBook Packages: Springer Book Archive