File: wfst_build_main.cc

package info (click to toggle)
speech-tools 1%3A2.5.0-11
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, sid
  • size: 9,988 kB
  • sloc: cpp: 67,350; ansic: 12,174; sh: 4,055; java: 3,748; makefile: 1,111; lisp: 711; perl: 396; awk: 85; xml: 9
file content (306 lines) | stat: -rw-r--r-- 10,189 bytes parent folder | download | duplicates (7)
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
/*************************************************************************/
/*                                                                       */
/*                Centre for Speech Technology Research                  */
/*                     University of Edinburgh, UK                       */
/*                      Copyright (c) 1996,1997                          */
/*                        All Rights Reserved.                           */
/*                                                                       */
/*  Permission is hereby granted, free of charge, to use and distribute  */
/*  this software and its documentation without restriction, including   */
/*  without limitation the rights to use, copy, modify, merge, publish,  */
/*  distribute, sublicense, and/or sell copies of this work, and to      */
/*  permit persons to whom this work is furnished to do so, subject to   */
/*  the following conditions:                                            */
/*   1. The code must retain the above copyright notice, this list of    */
/*      conditions and the following disclaimer.                         */
/*   2. Any modifications must be clearly marked as such.                */
/*   3. Original authors' names are not deleted.                         */
/*   4. The authors' names are not used to endorse or promote products   */
/*      derived from this software without specific prior written        */
/*      permission.                                                      */
/*                                                                       */
/*  THE UNIVERSITY OF EDINBURGH AND THE CONTRIBUTORS TO THIS WORK        */
/*  DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING      */
/*  ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT   */
/*  SHALL THE UNIVERSITY OF EDINBURGH NOR THE CONTRIBUTORS BE LIABLE     */
/*  FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES    */
/*  WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN   */
/*  AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,          */
/*  ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF       */
/*  THIS SOFTWARE.                                                       */
/*                                                                       */
/*************************************************************************/
/*                     Author :  Alan W Black                            */
/*                     Date   :  November 1997                           */
/*-----------------------------------------------------------------------*/
/*  Build a WFST from some base:                                         */
/*  1 a set of context dependent rewrite rules using the                 */
/*    the algorithms from "An Efficient Compiler for Weighted Rewrite    */
/*    Rules", by Mehryar Mohri and Richard Sproat ACL 1996               */
/*    and information from the techniques in Rithie el al. 1992          */
/*  2 A regular grammar (but can be written as a CFG as long as it       */
/*    contains no centre embedding                                       */
/*  3 A regular expression                                               */
/*  4 lts rules (but that doesn't work yet)                              */
/*                                                                       */
/*  or apply some operator on existing wfst(s): compose, concatenate,    */
/*  difference, union,                                                   */
/*                                                                       */
/*  Also allow determinizing and minimization as required                */
/*                                                                       */
/*=======================================================================*/
#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <fstream>
#include <cstring>
#include "EST.h"
#include "EST_WFST.h"

static int wfst_build_main(int argc, char **argv);



/** @name <command>wfst_build</command> <emphasis>Build a weighted finite-state transducer</emphasis>
    @id wfst-build-manual
  * @toc
 */

//@{


/**@name Synopsis
  */
//@{

//@synopsis

/**

Build and.or process weighted finite state transducers (WFSTs) form
various input formats.  This program accepts descriptions
in the following formats and converts them to WFSTs
<itemizedlist>
<listitem><para>regular expressions</para></listitem>
<listitem><para>regular grammars</para></listitem>
<listitem><para>Koskenniemi/Kay/Kaplan context restriction rules</para></listitem>
</itemizedlist>
In addition various operations can be performed on two WFSTs
<itemizedlist>
<listitem><para>compose: form new WFST feeding output of first WFSTs into
second WFSTs.</para></listitem>
<listitem><para>union: form new WFST accepting the language both WFSTs
</para></listitem>
<listitem><para>intersect: form new WFST accepting only the language common
to both WFSTs
</para></listitem>
<listitem><para>concat: form new WFST accepting the language from the
concatenation of all strings in the first WFST to all strings in the
second.
</para></listitem>
</itemizedlist>
The newly formed WFSTs can be optionally determinized and minimzed.

The option asis allows a single WFSTs to be loaded and determinized
and/or minimized

 */

//@}

/**@name OPTIONS
  */
//@{

//@options

//@}
int main(int argc, char **argv)
{

    wfst_build_main(argc,argv);

    exit(0);
    return 0;
}

static int wfst_build_main(int argc, char **argv)
{
    // Top level function generates a WFST from rules
    EST_Option al;
    EST_StrList files;
    EST_String outfile;

    parse_command_line
	(argc, argv,
	 EST_String("[option] [rulefile0] [rulefile1] ...\n")+
	 "Summary: Build a weighted finite state transducer from rules/wfsts\n"+
	 "-type <string> {kk} Input rule type: kk, lts, rg, tl, compose, regex\n"+
	 "                    union, intersect, concat, asis\n"+
	 "-determinize        Determinize WFST before saving it\n"+
	 "-detmin             Determinize and minimize WFST before saving it\n"+
	 "-o <ofile>          Output file for saved WFST (default stdout)\n"+
	 "-otype <string> {ascii}\n"+
         "                    Output type, ascii or binary\n"+
	 "-heap <int> {210000}\n"+
	 "                    Set size of Lisp heap, needed for large rulesets\n"+
	 "-q                  Quiet mode, no summary generated\n",
		       files, al);
    
    if (al.present("-o"))
	outfile = al.val("-o");
    else
	outfile = "-";

    siod_init(al.ival("-heap"));

    LISP ruleset;
    LISP inalpha, outalpha;
    EST_WFST *wfst = new EST_WFST;
    gc_protect(&ruleset);

    if (al.val("-type") == "kk")
    {
	ruleset = car(vload(files(files.head()),1));
	kkcompile(ruleset,*wfst);
    }
    else if (al.val("-type") == "lts")
    {
	ruleset = car(vload(files(files.head()),1));
	ltscompile(ruleset,*wfst);
    }
    else if (al.val("-type") == "rg")
    {
	ruleset = car(vload(files(files.head()),1));
	rgcompile(ruleset,*wfst);
    }
    else if (al.val("-type") == "tl")
    {
	ruleset = car(vload(files(files.head()),1));
	tlcompile(ruleset,*wfst);
    }
    else if (al.val("-type") == "asis")
    {
	if (wfst->load(files.nth(0)) != format_ok) exit(-1);
    }
    else if (al.val("-type") == "compose")
    {
	EST_WFST a,b;
	
	if (files.length() != 2)
	    EST_error("compose requires two WFSTs to combine");

	if (a.load(files.nth(0)) != format_ok) exit(-1);
	if (b.load(files.nth(1)) != format_ok) exit(-1);
	
	wfst->compose(a,b);
    }
    else if (al.val("-type") == "union")
    {
	EST_WFST a,b;

	if (files.length() != 2)
	    EST_error("union requires two WFSTs to combine");
	
	if (a.load(files.nth(0)) != format_ok) exit(-1);
	if (b.load(files.nth(1)) != format_ok) exit(-1);
	
	wfst->uunion(a,b);
    }
    else if (al.val("-type") == "intersect")
    {
	EST_WFST a,b;
	
	if (files.length() != 2)
	    EST_error("intersect requires two WFSTs to combine");
	if (a.load(files.nth(0)) != format_ok) exit(-1);
	if (b.load(files.nth(1)) != format_ok) exit(-1);
	
	wfst->intersection(a,b);
    }
    else if (al.val("-type") == "concat")
    {
	EST_WFST a,b;
	
	if (files.length() != 2)
	    EST_error("concat requires two WFSTs to combine");
	if (a.load(files.nth(0)) != format_ok) exit(-1);
	if (b.load(files.nth(1)) != format_ok) exit(-1);
	
 	wfst->concat(a,b);
    }
    else if (al.val("-type") == "difference")
    {
	EST_WFST a,b;
	
	if (files.length() != 2)
	    EST_error("difference requires two WFSTs to combine");
	if (a.load(files.nth(0)) != format_ok) exit(-1);
	if (b.load(files.nth(1)) != format_ok) exit(-1);
	
	wfst->difference(a,b);
    }
    else if (al.val("-type") == "regex")
    {
	ruleset = car(vload(files(files.head()),1));
	inalpha = siod_nth(0,ruleset);
	outalpha = siod_nth(1,ruleset);
	wfst->build_from_regex(inalpha,outalpha,car(cdr(cdr(ruleset))));
    }
    else
    {
	cerr << "wfst_build: unknown rule type \"" << al.val("-type") 
	    << "\"" << endl;
	exit(-1);
    }	

    if (al.present("-determinize"))
    {
	EST_WFST *dwfst = new EST_WFST;
	dwfst->determinize(*wfst);
	if (!al.present("-q"))
	{
	    cout << "wfst_build summary: " << endl;
	    cout << "   non-deterministic wfst: " << 
		wfst->summary() << endl;
	    cout << "       deterministic wfst: " << 
		dwfst->summary() << endl;
	}
	delete wfst;
	wfst = dwfst;
    }
    else if (al.present("-detmin"))
    {
	if (!al.present("-q"))
	{
	    cout << "wfst_build summary: " << endl;
	    cout << "   non-deterministic wfst: " << 
		wfst->summary() << endl;
	}
	EST_WFST *dwfst = new EST_WFST;
	dwfst->determinize(*wfst);
	delete wfst;
	if (!al.present("-q"))
	    cout << "       deterministic wfst: " << 
		dwfst->summary() << endl;
	EST_WFST *mwfst = new EST_WFST;
	mwfst->minimize(*dwfst);
	if (!al.present("-q"))
	    cout << "           minimized wfst: " << 
		mwfst->summary() << endl;
	delete dwfst;
	wfst = mwfst;
    }
    else
    {
	if (!al.present("-q"))
	    cout << "wfst_build: " << wfst->summary() << endl;
    }

    wfst->save(outfile,al.val("-otype"));
    delete wfst;
    gc_unprotect(&ruleset);

    return 0;
}