Compiling Apertium morphological dictionaries with HFST and using them in HFST applications
Tommi A. Pirinen, Francis Morton Tyers · Työväentutkimus Vuosikirja · 2012
In this paper we aim to improve interoperability and re-usability of the morphological dictionaries of Apertium machine translation system by formulating a generic finite-state compilation formula that is implemented in HFST finite-state system to compile Apertium dictionaries into general purpose finite-state automata. We demonstrate the use of the resulting automaton in FST-based spell-checking system.