Building and using existing hunspell dictionaries and TEX hyphenators as finite-state automata

There are numerous formats for writing spell-checkers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word hyphenation by computer there are TEX rules for many languages. In this paper we demonstrate a method for converting these spell-checking lexicons and hyphenation rule sets into finite-state automata, and present a new finite-state based system for writer´s tools used in current open-source software such as Firefox, OpenOffice.org and enchant via the spell-checking library voikko.