Hodge, V.J. orcid.org/0000-0002-2469-0224 and Austin, J. orcid.org/0000-0001-5762-8614 (2001) A novel binary spell checker. In: Dorffner, G., Bischof, H. and Hornik, K., (eds.) Artificial neural networks : ICANN 2001 : International Conference, Vienna, Austria, August 21-25, 2001 : proceedings. Lecture Notes in Computer Science . Springer , Berlin, Germany , pp. 1199-1204.
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.
Metadata
Authors/Creators: |
|
---|---|
Copyright, Publisher and Additional Information: | Copyright © 2001 Springer-Verlag. This is an author produced version of a chapter published in Artificial neural networks : ICANN 2001 : International Conference, Vienna, Austria, August 21-25, 2001 : proceedings. This paper has been peer-reviewed but does not include the final publisher proof-corrections or journal pagination. |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Sherpa Assistant |
Date Deposited: | 11 Nov 2005 |
Last Modified: | 06 Dec 2023 09:52 |
Status: | Published |
Publisher: | Springer |
Series Name: | Lecture Notes in Computer Science |
Refereed: | No |