Computers have become important in the document preparation process, with programs to check for spelling errors and to format documents. Recently, due to the development of desktop publishing, document preparation such as editing and typesetting is processed using computers by individuals or publishers. And the number of written documents has dramatically increased. But proofreading of draft documents by human is costly, time-consuming, subjective, and often tedious. Therefore, mechanized aids for proofreading can simplify and speed the documentation process.
This paper describes a design and implementation of Hangul spelling and word-spacing checker for Hangul text in $UNIX^{TM}$ environment by batch processing. By analyzing only morphologically one word phrase (eojeol) using connectivity information of morphemes, this system checks spelling and wordspacing errors in the text.
Spelling checker only checks whether possible Korean morphemes can morphologically composed into an word phrase or not. In this thesis, a new morphological analysis method for spelling checking called he shortest match strategy is proposed to find speedly an word phrase's separable morphemes. This method finds first matched (i.e. shorter ) morphemes in dictionary with prefix of rest part of the given word phrase. This system consists of LRCIT (Left and Right connection Information Table) that represents the aspect of connection between morphemes, dictionaries (Master dictionary and Noun dictionary) having morphemes and connectivity information pairs, and dictionary editor that helps the management of the dictionary. $UNIX^{TM}$ is a trade marke of Bell Laboratories.
