Difference between revisions of "Hfst documentation"

From Apertium
Jump to navigation Jump to search
Line 51: Line 51:
 
**
 
**
 
* [https://kitwiki.csc.fi/twiki/bin/view/KitWiki/HfstMinimize hfst-minimize]
 
* [https://kitwiki.csc.fi/twiki/bin/view/KitWiki/HfstMinimize hfst-minimize]
  +
** Minimize a transducer, i.e. create an equivalent, epsilon-free, deterministic transducer that has as few states as possible.
**
 
 
* [https://kitwiki.csc.fi/twiki/bin/view/KitWiki/HfstName hfst-name]
 
* [https://kitwiki.csc.fi/twiki/bin/view/KitWiki/HfstName hfst-name]
 
**
 
**

Revision as of 18:52, 18 December 2011

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:

See also