Up to Human language technology research.

Swedish spell checking

Researchers

• Viggo Kann
• Joachim Hollman

Ph.D. students

• Rickard Domeij

Short description

We have constructed a generally appreciated and very popular program for Swedish spelling error detection and correction, available on WWW as http://www.nada.kth.se/stava.

Funding

Publications

Implementation aspects and applications of a spelling correction algorithm.

V. Kann, R. Domeij, J. Hollman, M. Tillenius

L. Uhlirova, G. Wimmer, G. Altmann, R. Koehler: Text as a Linguistic Paradigm: Levels, Constituents, Constructs. Festschrift in honour of Ludek Hrebicek, Quantitative Linguistics, vol. 60, WVT, 2001.

NADA report TRITA-NA-9813, 1998.

Postscript. PDF.

Design and implementation of a probabilistic word prediction program

J. Carlberger

NADA report TRITA-NA-E9751, 1997.

HTML, Word and Postscript.

Äntligen kan datorn stava rätt (At last the computer can spell correctly), in Swedish.

V. Kann

Article in KTH's magazine KTH-nytt, 6/1996.

HTML.

Efficient generation and ranking of spelling error corrections

M. Tillenius

NADA report TRITA-NA-E9621, 1996.

Postscript, PDF.

Approximate Swedish name matching - survey and test of different algorithms

K. Erikson

NADA report TRITA-NA-E9721, 1997.

Postscript, PDF.

De ryska böjningsmönstrens betydelse vid maskinell rättstavning

L. Engebretsen

B-uppsats i ryska, april 1997.

PDF.

Stava ryska adjektiv

P. Axensten

Uppsats i språkteknologi, december 1997.

PDF.

Detection of spelling errors in Swedish not using a word list en clair

R. Domeij, J. Hollman, V. Kann

J. of Quantitative Linguistics 1:195-201, 1994.

QUALICO-94, 71-76, 1994.

Postscript.

En metod för svensk rättstavning baserad på bloomfilter (A method for Swedish spelling based on Bloom filters), in Swedish.

J. Hollman, V. Kann

NADA report TRITA-NA-P9213, 1992.

Postscript.

Up to Human language technology research.