Computational proofreading of the Croatian lexicon

The design of a spelling checker for a highly inflected language is commonly regarded as a difficult problem. In this paper we present an approach to this problem, which is mainly statistically based. The approach was tested on the Croatian language. An unconventional spelling checking tool was developed. The results obtained by performing the most demanding task for any spelling checker, the proofreading of a huge lexicon, point out that this approach could be applicable to many languages.