Abstract
The information in a database is usually accessed using SQL or some other query language, but if one uses a free text retrieval system the retrieval of text based information becomes much easier and user friendly, since one can use natural languages techniques such as automatic spell checking and stemming. The free text retrieval system needs first to index the database but then it is just to search the database. Normally a search engine does not give any answers to queries when the search words does not exist in the index, therefore we connected a spell checker module into a search engine and evaluated it. The domain used was the web site of the Swedish National Tax Board (Riksskatteverket, RSV), where the search engine was used between April and Sept 2001. One million queries were made by the public. Of these queries 10 percent were “misspelled” or erroneous and our spell checker corrected around 90 percent of these.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Carlberger, J., H. Dalianis, M. Hassel and O. Knutsson. Improving Precision in Information Retrieval for Swedish using Stemming. In the Proceedings of NODALIDA’ 01-13th Nordic Conference on Computational Linguistics, May 21-22, 2001, Uppsala, Sweden,2001.
Carlberger, J. and V. Kann. 2000. Some applications of a statistical tagger for Swedish. Proc. 4:th conference of the International Quantitative Linguistics Association (Qualico-2000), pp. 51–52, August 2000
Carlberger, J. and V. Kann. Implementing an efficient part-of-speech tagger. Software Practice and Experience, 29, pp. 815–832, 1999.
Domeij, R., J.. Hollman, and Viggo Kann. Detection of spelling errors in Swedish not using a word list en clair. Journal of Quantitative Linguistics1:195–201, 1994.
Hodge, V and J. Austin. A Comparison of a Novel Neural Spell Checker and Standard Spell Checking Algorithms, accepted for Pattern Recognition, Elsevier Publications, 2001
Hultman, T. and M, Westman,. Gymnasistsvenska, LiberLäromedel, Lund, 1977.
Knutsson, O. Automatisk språkgranskning av svensk text (in Swedish), (Automatic Proofreading of Swedish text), Licentiate Thesis. IPLAB-NADA, Royal Institute of Technology, KTH, Stockholm, 2001.
Kukich, K. Techniques for automatically correcting words in text, ACM Computing Surveys. Vol.24, No. 4 (Dec. 1992), pp. 377–439, 1992.
Pearce, C and C. Nicholas. Generating a Dynamic Hypertext environment with N-gram Analysis. Proceedings of the second International Conference on Information and knowledge Management, Washington DC, USA, pp. 148–153, 1993.
van Rijsbergen, C. J. Information retrieval. Butterworths, 1979
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dalianis, H. (2002). Evaluating a Spelling Support in a Search Engine. In: Andersson, B., Bergholtz, M., Johannesson, P. (eds) Natural Language Processing and Information Systems. NLDB 2002. Lecture Notes in Computer Science, vol 2553. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36271-1_16
Download citation
DOI: https://doi.org/10.1007/3-540-36271-1_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00307-6
Online ISBN: 978-3-540-36271-5
eBook Packages: Springer Book Archive