-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCharacter.java
310 lines (284 loc) · 6.89 KB
/
Character.java
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
307
308
309
310
package NYLP;
import java.io.IOException;
public class Character {
public static void main(String []args) throws Exception
{
}
final double min = 2.111397322748195E-6/2 ;
final int ciNum = 44;
Poslist dic = new Poslist();
Launchmatrix lau = new Launchmatrix("NYLP\\fashe.txt"); //定义发射矩阵词典所在的位置
Convertmatrix ConMatrix = new Convertmatrix("NYLP\\zhuanyi.txt"); //定义转移矩阵词典所在位置
double convert[][] = ConMatrix.ProbabilityMatrix();
public Character() throws IOException
{
}
public double getProbability(String []str)
{
double []prob = new double[ciNum]; //记录发射概率
double [][]record = new double[ciNum][str.length];//记录后向变量,用于传递
double []record2 = new double[ciNum];//记录后向变量,用于传递
double []linshi = new double[ciNum]; //用于暂存 以便选出最大值
int bianhao[][] = new int[ciNum][str.length]; //记录最大值的编号和序号
for(int i = 0; i < ciNum; i++)
{
record2[i] = 0;
linshi[i] = 1;
}
for(int i = 0; i < 1; i++) //初始化概率 算出观察概率
{
for(int j = 0; j < ciNum; j++)
{
String s[][] = lau.ProbabilityMatrix(j);
for(int index = 0; index < s[0].length; index++)
{
if(s[0][index].equals(str[i]) )
{
record[j][0] = (Double.valueOf(s[1][index]) );
}
}
}
}
for(int i = 0; i < ciNum; i++) //平滑处理
{
if(record[i][0] == 0)
{
record[i][0] = min;
}
}
//输出第一列后向变量
/*
for(int i = 0; i < ciNum; i++)
{
System.out.println("第"+i+"个为"+record[i][0]);
}
*/
for(int i = 1; i < str.length; i++) //动态规划计算概率
{
prob = new double[ciNum];
for(int j = 0; j < ciNum; j++) //计算发射概率
{
String s[][] = lau.ProbabilityMatrix(j);
for(int index = 0; index < s[0].length; index++){
if(s[0][index].equals(str[i])){
prob[j] = Double.valueOf(s[1][index]);
break;
}
}
}
for(int k = 0; k < ciNum; k++) //平滑处理 发射概率
{
if(prob[k] == 0)
{
prob[k] = min;
}
}
/*
if(i == str.length - 1)
{
for(int l = 0; l < prob.length; l++)
{
System.out.println("最后一列的发射概率 "+dic.number_cixing(l)+"词性的概率为: "+ prob[l]);
}
}
*/
for(int m = 0; m < ciNum; m++) //m为主词性 n为副词性 n变动 m不动
{
int lnum = 0;
for(int n = 0; n < ciNum; n++)
{
linshi[lnum++] = record[n][i-1] * convert[n][m] * prob[m]; //hmm公式
}
double max = -1;
for(int k = 0; k < ciNum; k++)
{
if(linshi[k] > max)
{
//记录编号
bianhao[m][i] = k;
max = linshi[k];
}
}
record2[m] = max;
}
for(int t = 0; t < ciNum; t++)
{
record[t][i] = record2[t];
}
/*测试后向变量是否正确
if( i == 1)
for(int k = 0; k < ciNum; k++)
{
System.out.println("第"+k+"个为:"+record[k][i]);
}
*/
}
/*for(int i = 0; i < ciNum ;i++)
{
for(int j = 0; j < str.length; j++)
{
System.out.print(bianhao[i][j]+" ");
}
System.out.println();
}*/
double max = -1;
int index = -1;
for(int k = 0; k < ciNum; k++)
{
if(record[k][str.length - 1] > max)
{
//记录编号
index = k;
max = record[k][str.length - 1];
}
}
int shuchu[] = new int[str.length + 1]; //记录输出的编号
shuchu[str.length] = index;
for(int i = str.length - 1; i > 0 ; i--)
{
shuchu[i] = bianhao[shuchu[i+1]][i];
}
// String r[] = new String[shuchu.]
//结果可视化
/* for(int i = 1; i < shuchu.length; i++)
{
System.out.println("第"+i+"号词性为"+dic.number_cixing(shuchu[i]));
}
*/
//return 0;
return max;
}
public String[] getresult(String []str)
{
double []prob = new double[ciNum]; //记录发射概率
double [][]record = new double[ciNum][str.length];//记录后向变量,用于传递
double []record2 = new double[ciNum];//记录后向变量,用于传递
double []linshi = new double[ciNum]; //用于暂存 以便选出最大值
int bianhao[][] = new int[ciNum][str.length]; //记录最大值的编号和序号
for(int i = 0; i < ciNum; i++)
{
record2[i] = 0;
linshi[i] = 1;
}
for(int i = 0; i < 1; i++) //初始化概率 算出观察概率
{
for(int j = 0; j < ciNum; j++)
{
String s[][] = lau.ProbabilityMatrix(j);
for(int index = 0; index < s[0].length; index++)
{
if(s[0][index].equals(str[i]) )
{
record[j][0] = (Double.valueOf(s[1][index]) );
}
}
}
}
for(int i = 0; i < ciNum; i++) //平滑处理
{
if(record[i][0] == 0)
{
record[i][0] = min;
}
}
//输出第一列后向变量
/*
for(int i = 0; i < ciNum; i++)
{
System.out.println("第"+i+"个为"+record[i][0]);
}
*/
for(int i = 1; i < str.length; i++) //动态规划计算概率
{
prob = new double[ciNum];
for(int j = 0; j < ciNum; j++) //计算发射概率
{
String s[][] = lau.ProbabilityMatrix(j);
for(int index = 0; index < s[0].length; index++){
if(s[0][index].equals(str[i])){
prob[j] = Double.valueOf(s[1][index]);
break;
}
}
}
for(int k = 0; k < ciNum; k++) //平滑处理 发射概率
{
if(prob[k] == 0)
{
prob[k] = min;
}
}
/*
if(i == str.length - 1)
{
for(int l = 0; l < prob.length; l++)
{
System.out.println("最后一列的发射概率 "+dic.number_cixing(l)+"词性的概率为: "+ prob[l]);
}
}
*/
for(int m = 0; m < ciNum; m++) //m为主词性 n为副词性 n变动 m不动
{
int lnum = 0;
for(int n = 0; n < ciNum; n++)
{
linshi[lnum++] = record[n][i-1] * convert[n][m] * prob[m]; //hmm公式
}
double max = -1;
for(int k = 0; k < ciNum; k++)
{
if(linshi[k] > max)
{
//记录编号
bianhao[m][i] = k;
max = linshi[k];
}
}
record2[m] = max;
}
for(int t = 0; t < ciNum; t++)
{
record[t][i] = record2[t];
}
/*测试后向变量是否正确
if( i == 1)
for(int k = 0; k < ciNum; k++)
{
System.out.println("第"+k+"个为:"+record[k][i]);
}
*/
}
/*for(int i = 0; i < ciNum ;i++)
{
for(int j = 0; j < str.length; j++)
{
System.out.print(bianhao[i][j]+" ");
}
System.out.println();
}*/
double max = -1;
int index = -1;
for(int k = 0; k < ciNum; k++)
{
if(record[k][str.length - 1] > max)
{
//记录编号
index = k;
max = record[k][str.length - 1];
}
}
int shuchu[] = new int[str.length + 1]; //记录输出的编号
shuchu[str.length] = index;
for(int i = str.length - 1; i > 0 ; i--)
{
shuchu[i] = bianhao[shuchu[i+1]][i];
}
String r[] = new String[shuchu.length - 1];
for(int i = 1; i < shuchu.length; i++)
{
//System.out.println("第"+i+"号词性为"+dic.number_cixing(shuchu[i]));
r[i-1] = dic.number_cixing(shuchu[i]);
}
return r;
}
}