Hfst documentation

Hfst is a compiler for finite state transducers. The best documentation for writing such transducers is still Beesley and Karttunen (2003): Finite State Morphology. There still are some important differences between Hfst and the compilers described in the B&K book.

The Hfst subprograms

Hfst consists of a large number of smaller programs, with different functions:

• hfst-calculate
• hfst-compare
• hfst-compose
• hfst-compose-intersect
• hfst-concatenate
• hfst-conjunct
• hfst-determinize
• hfst-diff-test
• hfst-disjunct
• hfst-duplicate
• hfst-foma-wrapper.sh
• hfst-format
• hfst-fst2fst
• hfst-fst2pairstrings
• hfst-fst2strings
• hfst-fst2txt
• hfst-head
• hfst-invert
• hfst-lexc
• hfst-lexc2fst
• hfst-lookup
• hfst-lookup-optimize
• hfst-minimize
• hfst-name
• hfst-omor-evaluate
• hfst-pair-test
• hfst-preprocess-for-optimized-lookup-format
• hfst-proc
• hfst-project
• hfst-push-weights
• hfst-regexp2fst
• hfst-remove-epsilons
• hfst-repeat
• hfst-reverse
• hfst-split
• hfst-strings2fst
• hfst-strip-header
• hfst-substitute
• hfst-subtract
• hfst-summarize
• hfst-symbols
• hfst-tail
• hfst-twolc
• hfst-twolc-loc
• hfst-txt2fst
• hfst-xfst