Difference between revisions of "Hfst documentation"
Jump to navigation
Jump to search
| Line 7: | Line 7: | ||
* hfst-calculate |
* hfst-calculate |
||
| + | ** Compiles SFST files into HFST transducers |
||
| − | ** |
||
* hfst-compare |
* hfst-compare |
||
| + | ** Compares two transducers, checking for equivalence |
||
| − | ** |
||
* hfst-compose |
* hfst-compose |
||
| + | ** Composes two transducers |
||
| − | ** |
||
* hfst-compose-intersect |
* hfst-compose-intersect |
||
** Perform intersecting composition on two transducers (typically the morphotactic transducer/lexicon and the morphophonological transducer) |
** Perform intersecting composition on two transducers (typically the morphotactic transducer/lexicon and the morphophonological transducer) |
||
* hfst-concatenate |
* hfst-concatenate |
||
| + | ** Concatenates two transducers |
||
| − | ** |
||
* hfst-conjunct |
* hfst-conjunct |
||
| + | ** Conjuncts two transducers |
||
| − | ** |
||
* hfst-determinize |
* hfst-determinize |
||
** |
** |
||
| Line 23: | Line 23: | ||
** |
** |
||
* hfst-disjunct |
* hfst-disjunct |
||
| + | ** Disjuncts two transducers |
||
| − | ** |
||
* hfst-duplicate |
* hfst-duplicate |
||
** |
** |
||
| Line 31: | Line 31: | ||
** |
** |
||
* hfst-fst2fst |
* hfst-fst2fst |
||
| + | ** Converts between Hfst, OpenFst, SFST and Foma transducers |
||
| − | ** |
||
* hfst-fst2pairstrings |
* hfst-fst2pairstrings |
||
** |
** |
||
| Line 37: | Line 37: | ||
** |
** |
||
* hfst-fst2txt |
* hfst-fst2txt |
||
| + | ** Prints transducers in AT&T tabular format |
||
| − | ** |
||
* hfst-head |
* hfst-head |
||
** |
** |
||
* hfst-invert |
* hfst-invert |
||
** Turn a transducer upside down. |
** Turn a transducer upside down. |
||
| − | * hfst-lexc |
+ | * '''hfst-lexc''' |
** Compile a lexc file into a finite-state transducer |
** Compile a lexc file into a finite-state transducer |
||
* hfst-lexc2fst |
* hfst-lexc2fst |
||
** |
** |
||
| − | * hfst-lookup |
+ | * '''hfst-lookup''' |
| + | ** lookup, gives ''lemma+analysis'' of wordforms |
||
| − | ** |
||
* hfst-lookup-optimize |
* hfst-lookup-optimize |
||
** |
** |
||
| Line 77: | Line 77: | ||
** |
** |
||
* hfst-strings2fst |
* hfst-strings2fst |
||
| + | ** Compiles string-pairs and pair-strings into transducers |
||
| − | ** |
||
* hfst-strip-header |
* hfst-strip-header |
||
** |
** |
||
| Line 85: | Line 85: | ||
** |
** |
||
* hfst-summarise |
* hfst-summarise |
||
| + | ** Calculates the properties of a transducer |
||
| − | ** |
||
* hfst-symbols |
* hfst-symbols |
||
** |
** |
||
* hfst-tail |
* hfst-tail |
||
** |
** |
||
| − | * hfst-twolc |
+ | * '''hfst-twolc''' |
| + | ** Compiles a twol (two-level morphophonology) file into an Hfst transducer |
||
| − | ** |
||
* hfst-twolc-loc |
* hfst-twolc-loc |
||
** |
** |
||
* hfst-txt2fst |
* hfst-txt2fst |
||
| + | ** Converts AT&T tabular format into binary transducers |
||
| − | ** |
||
| − | * hfst-xfst |
+ | * '''hfst-xfst''' |
| + | ** Compiles xfst files into Hfst transducers |
||
| − | ** |
||
==See also== |
==See also== |
||
Revision as of 12:55, 18 July 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:
- hfst-calculate
- Compiles SFST files into HFST transducers
- hfst-compare
- Compares two transducers, checking for equivalence
- hfst-compose
- Composes two transducers
- hfst-compose-intersect
- Perform intersecting composition on two transducers (typically the morphotactic transducer/lexicon and the morphophonological transducer)
- hfst-concatenate
- Concatenates two transducers
- hfst-conjunct
- Conjuncts two transducers
- hfst-determinize
- hfst-diff-test
- hfst-disjunct
- Disjuncts two transducers
- hfst-duplicate
- hfst-foma-wrapper.sh
- hfst-format
- hfst-fst2fst
- Converts between Hfst, OpenFst, SFST and Foma transducers
- hfst-fst2pairstrings
- hfst-fst2strings
- hfst-fst2txt
- Prints transducers in AT&T tabular format
- hfst-head
- hfst-invert
- Turn a transducer upside down.
- hfst-lexc
- Compile a lexc file into a finite-state transducer
- hfst-lexc2fst
- hfst-lookup
- lookup, gives lemma+analysis of wordforms
- 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
- Compiles string-pairs and pair-strings into transducers
- hfst-strip-header
- hfst-substitute
- hfst-subtract
- hfst-summarise
- Calculates the properties of a transducer
- hfst-symbols
- hfst-tail
- hfst-twolc
- Compiles a twol (two-level morphophonology) file into an Hfst transducer
- hfst-twolc-loc
- hfst-txt2fst
- Converts AT&T tabular format into binary transducers
- hfst-xfst
- Compiles xfst files into Hfst transducers
