A comparison of a novel neural spell checker and standard spell checking algorithms

作者:

Highlights:

摘要

In this paper, we propose a simple and flexible spell checker using efficient associative matching in the AURA modular neural system. Our approach aims to provide a pre-processor for an information retrieval (IR) system allowing the user's query to be checked against a lexicon and any spelling errors corrected, to prevent wasted searching. IR searching is computationally intensive so much so that if we can prevent futile searches we can minimise computational cost. We evaluate our approach against several commonly used spell checking techniques for memory-use, retrieval speed and recall accuracy. The proposed methodology has low memory use, high speed for word presence checking, reasonable speed for spell checking and a high recall rate.

论文关键词:Binary neural spell checker,Associative matching,Supervised learning,Accuracy,Memory usage

论文评审过程:Received 12 September 2000, Revised 23 May 2001, Accepted 17 July 2001, Available online 1 August 2002.

论文官网地址:https://doi.org/10.1016/S0031-3203(01)00174-1