fst-match.1
1.16 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
.TH fst-infl 1 "March 2005" "" "fst-match"
.SH NAME
fst-match \- longest match analyser
.SH SYNOPSIS
.B fst-match [ options ]
.I file
[
.I input-file
[
.I output-file
]
]
.SH OPTIONS
.TP
.B \-q
Suppress status messages.
.TP
.B \-h
Print usage information.
.SH DESCRIPTION
.I fst-match
is a longest match analyser. The first argument is the name of a
compact transducer file which was generated by
.I 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
directed to
.I stdout.
If the second argument is missing, as well, input is read from
.I stdin.
.I 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.
.SH BUGS
If the longest match can be mapped to several target strings, only one
of them is printed.
.SH "SEE ALSO"
fst-compiler, fst-mor, fst-infl, fst-parse
.SH AUTHOR
Helmut Schmid,
Institute for Computational Linguistics,
University of Stuttgart,
Email: schmid@ims.uni-stuttgart.de,
This software is available under the GNU Public License.