Difference between revisions of "Hfst documentation"

From Apertium
Jump to navigation Jump to search
Line 45: Line 45:
 
** Compile a lexc file into a finite-state transducer
 
** Compile a lexc file into a finite-state transducer
 
* [https://kitwiki.csc.fi/twiki/bin/view/KitWiki/HfstLexc2Fst hfst-lexc2fst]
 
* [https://kitwiki.csc.fi/twiki/bin/view/KitWiki/HfstLexc2Fst hfst-lexc2fst]
  +
** Legacy support for HFST 2 lexc parser, '''use only if you really need the command-line version''' of HFST-based lexc parser
**
 
 
* [https://kitwiki.csc.fi/twiki/bin/view/KitWiki/HfstLookUp '''hfst-lookup''']
 
* [https://kitwiki.csc.fi/twiki/bin/view/KitWiki/HfstLookUp '''hfst-lookup''']
 
** lookup, gives ''lemma+analysis'' of wordforms
 
** lookup, gives ''lemma+analysis'' of wordforms

Revision as of 18:54, 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