The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - September/October (2003 vol.15)
pp: 1073-1081
ABSTRACT
<p><b>Abstract</b>—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 integrate Hamming Distance and n-gram algorithms that have high <it>recall</it> for typing errors and a phonetic spell-checking algorithm in a single novel architecture. Our approach is suitable for any spell checking application though aimed toward isolated word error correction, particularly spell checking user queries in a search engine. We use a novel scoring scheme to integrate the retrieved words from each spelling approach and calculate an overall score for each matched word. From the overall scores, we can rank the possible matches. In this paper, we evaluate our approach against several benchmark spellchecking algorithms for recall accuracy. Our proposed hybrid methodology has the highest recall rate of the techniques evaluated. The method has a high <it>recall</it> rate and low-computational cost.</p>
INDEX TERMS
Binary neural spell checker, integrated modular spell checker, associative matching.
CITATION
Victoria J. Hodge, Jim Austin, "A Comparison of Standard Spell Checking Algorithms and a Novel Binary Neural Approach", IEEE Transactions on Knowledge & Data Engineering, vol.15, no. 5, pp. 1073-1081, September/October 2003, doi:10.1109/TKDE.2003.1232265
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool