Sciweavers

IMCSIT
2010

Building and Using Existing Hunspell Dictionaries and TeX Hyphenators as Finite-State Automata

13 years 1 months ago
Building and Using Existing Hunspell Dictionaries and TeX Hyphenators as Finite-State Automata
Abstract--There are numerous formats for writing spellcheckers 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.
Tommi Pirinen, Krister Lindén
Added 13 Feb 2011
Updated 13 Feb 2011
Type Journal
Year 2010
Where IMCSIT
Authors Tommi Pirinen, Krister Lindén
Comments (0)