The library functions as an interchanging interface to multiple backends, such as OpenFST, foma and SFST. The utilities comprise various compilers, such as hfst-twolc (a compiler for morphological two-level rules),[2] hfst-lexc (a compiler for lexicon definitions) and hfst-regexp2fst (a regular expression compiler). Functions from Xerox's proprietary scripting language xfst is duplicated in hfst-xfst, and the pattern matching utility pmatch in hfst-pmatch, which goes beyond the finite-state formalism in having recursive transition networks (RTNs).
The library and utilities are written in C++, with an interface to the library in Python and a utility for looking up results from transducers ported to Java and Python.
Transducers in HFST may incorporate weights depending on the backend. For performing FST operations, this is currently only possible via the OpenFST backend. HFST provides two native backends, one designed for fast lookup (hfst-optimized-lookup), the other for format interchange. Both of them can be weighted.
Uses
HFST has been used for writing various linguistic tools, such as spell-checkers, hyphenators, and morphologies.[3][4] Morphological dictionaries written in other formalisms have also been converted to HFST's formats.[5]
Lindén, Krister; Axelson, Erik; Drobac, Senka; Hardwick, Sam; Kuokkala, Juha; Niemi, Jyrki; Pirinen, Tommi; Silfverberg, Miikka (2013). "HFST - A System for Creating NLP Tools". In Mahlow, Cerstin; Piotrowski, Michael (eds.). Systems and Frameworks for Computational Morphology. Systems and Frameworks for Computational Morphology. Communications in Computer and Information Science. Vol.380. Humboldt-Universität in Berlin: Springer. pp.53–71.
This page is based on this Wikipedia article Text is available under the CC BY-SA 4.0 license; additional terms may apply. Images, videos and audio are available under their respective licenses.
