1 | /*************************************************************************/ |
2 | /* */ |
3 | /* Language Technologies Institute */ |
4 | /* Carnegie Mellon University */ |
5 | /* Copyright (c) 1999 */ |
6 | /* All Rights Reserved. */ |
7 | /* */ |
8 | /* Permission is hereby granted, free of charge, to use and distribute */ |
9 | /* this software and its documentation without restriction, including */ |
10 | /* without limitation the rights to use, copy, modify, merge, publish, */ |
11 | /* distribute, sublicense, and/or sell copies of this work, and to */ |
12 | /* permit persons to whom this work is furnished to do so, subject to */ |
13 | /* the following conditions: */ |
14 | /* 1. The code must retain the above copyright notice, this list of */ |
15 | /* conditions and the following disclaimer. */ |
16 | /* 2. Any modifications must be clearly marked as such. */ |
17 | /* 3. Original authors' names are not deleted. */ |
18 | /* 4. The authors' names are not used to endorse or promote products */ |
19 | /* derived from this software without specific prior written */ |
20 | /* permission. */ |
21 | /* */ |
22 | /* CARNEGIE MELLON UNIVERSITY AND THE CONTRIBUTORS TO THIS WORK */ |
23 | /* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING */ |
24 | /* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT */ |
25 | /* SHALL CARNEGIE MELLON UNIVERSITY NOR THE CONTRIBUTORS BE LIABLE */ |
26 | /* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES */ |
27 | /* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN */ |
28 | /* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, */ |
29 | /* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF */ |
30 | /* THIS SOFTWARE. */ |
31 | /* */ |
32 | /*************************************************************************/ |
33 | /* Author: Alan W Black (awb@cs.cmu.edu) */ |
34 | /* Date: December 1999 */ |
35 | /*************************************************************************/ |
36 | /* */ |
37 | /* Letter to sound rules */ |
38 | /* */ |
39 | /*************************************************************************/ |
40 | #ifndef _CST_LTS_H__ |
41 | #define _CST_LTS_H__ |
42 | |
43 | #include "cst_val.h" |
44 | |
45 | typedef unsigned short cst_lts_addr; |
46 | typedef int cst_lts_phone; |
47 | typedef unsigned char cst_lts_feat; |
48 | typedef unsigned char cst_lts_letter; |
49 | typedef unsigned char cst_lts_model; |
50 | |
51 | /* end of rule value */ |
52 | #define CST_LTS_EOR 255 |
53 | |
54 | typedef struct cst_lts_rules_struct { |
55 | char *name; |
56 | const cst_lts_addr *letter_index; /* index into model first state */ |
57 | const cst_lts_model *models; |
58 | const char * const * phone_table; |
59 | int context_window_size; |
60 | int ; |
61 | const char * const * letter_table; |
62 | } cst_lts_rules; |
63 | |
64 | /* Note this is designed to be 6 bytes */ |
65 | typedef struct cst_lts_rule_struct { |
66 | cst_lts_feat feat; |
67 | cst_lts_letter val; |
68 | cst_lts_addr qtrue; |
69 | cst_lts_addr qfalse; |
70 | } cst_lts_rule; |
71 | |
72 | cst_lts_rules *new_lts_rules(); |
73 | |
74 | cst_val *lts_apply(const char *word,const char *feats,const cst_lts_rules *r); |
75 | cst_val *lts_apply_val(const cst_val *wlist,const char *feats,const cst_lts_rules *r); |
76 | |
77 | #endif |
78 | |
79 | |