Back to: FsmReg
AbbrName HFST
FullName Helsinki Finite-State Technology
ItemDesc A project called HFST (Helsinki Finite-State Technology) was started in late 2007 with the aim of producing a programming interface on top of some existing free open source finite-state packages. It is expected to:
- provide a better documented programming interface which makes the building of new finite-state NLP tools more efficient and robust,
- allow the developer of a compiler to create code which is independent of a particular finite-state package, possibly changing the underlying package if that makes the tool run faster,
- allow comparisons of the efficiency of algorithms in different packages and stimulate further improvement of the packages and their algorithms,
- allow free combining of various transducers as Unix pipelines (in the spirit of the AT\&T finite-state tools), and
- include weighted FSTs as a part of the basic finite-state tools.

Contains HFST API and various command line tools and formalism compilers.



Type FsmCompiler

Author The HFST Team: Erik Axelsson, Kimmo Koskenniemi, Krister Lindén, Tommi Pirinen, Miikka Silfverberg, Anssi Yli-Jyrä
Copyright The HFST Team.
License The licensing policy aims at maximum compatibility.
The used license is not more restrictive than the license the underlying libraries. The user can use
HFST either with SFST or OpenFST (or both) and the choice affects the license of HFST.


Availability Downloadable.

RelatedWork - Koskenniemi's Two-Level Morphology.
- Xerox' LEXC and TWOLC
- SFST, OpenFST and AFST
- Generalized Restriction (Yli-Jyrä and Koskenniemi 2004)

LatestVersion HFST 1. HFST 2 under development. HFST3 is being planned.
Topic revision: r1 - 2008-10-23 - AnssiYliJyra
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2018 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback