Manual Reference Pages - FST-MATCH (1)
fst-match - longest match analyser
fst-match [ options ]
Suppress status messages.
Print usage information.
fst-match is a longest match analyser. The first argument is the name of a
compact transducer file which was generated by
fst-compiler -c. The second argument is the name of the input file. The third argument
is the output file. If the third argument is missing, output is
stdout. If the second argument is missing, as well, input is read from
fst-match reads the argument transducer and performs a longest-match analysis of
the input string. Given the transducer <x>:<>ab+<x>:<>, it will
analyse the string baabbca as ba<x>abb<x>ca.
If the longest match can be mapped to several target strings, only one
of them is printed.
fst-compiler, fst-mor, fst-infl, fst-parse
Institute for Computational Linguistics,
University of Stuttgart,
This software is available under the GNU Public License.
Visit the GSP FreeBSD Man Page Interface.
Output converted with manServer 1.07.