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
|
/*
Copyright (C) 1997,1998,1999,2000,2001 Franz Josef Och
mkcls - a program for making word classes .
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
USA.
*/
#ifndef KATEGPROBLEMKBC_H
#define KATEGPROBLEMKBC_H
typedef Array<FreqType> FreqArray;
typedef Array<double> FreqArrayReal;
double verfaelsche(int a,double b);
double verfaelsche(double a,double b);
class KategProblemKBC
{
friend class KategProblem;
private:
Array<FreqArray> _n;
Array<FreqType> _n1;
Array<FreqType> _n2;
double sigmaVerfaelschung;
short withVerfaelschung;
Array<FreqArrayReal> _nverf;
Array<double> _n1verf;
Array<double> _n2verf;
FreqType _nWords;
protected:
int eta0;
int eta1;
int c1_0;
int c2_0;
double _bigramVerfSum;
double _unigramVerfSum1;
double _unigramVerfSum2;
double verfInit0;
public:
int nKats;
KategProblemKBC(int nKats,double sv);
double fullBewertung(int auswertung);
FreqType n(int w1,int w2) {
return _n[w1][w2];
};
FreqType n1(int w) {
return _n1[w];
};
FreqType n2(int w) {
return _n2[w];
};
double bigramVerfSum();
double unigramVerfSum1();
double unigramVerfSum2();
double nverf(int w1,int w2) {
return _nverf[w1][w2];
}
double n1verf(int w) {
return _n1verf[w];
};
double n2verf(int w) {
return _n2verf[w];
};
inline void addN(int w1,int w2, FreqType n);
void setN(int w1,int w2, FreqType n);
double myCriterionTerm();
};
inline void KategProblemKBC::addN(int w1,int w2, FreqType n)
{
if(n!=0) {
FreqType &s= _n[w1][w2];
if(s==0)
eta0--;
else if(s==1)
eta1--;
if(_n1[w1]==0)
c1_0--;
if(_n2[w2]==0)
c2_0--;
if(withVerfaelschung) {
double verfOld=verfaelsche(s,sigmaVerfaelschung);
double verfNew=verfaelsche(s+n,sigmaVerfaelschung);
double verfOld1=verfaelsche(_n1[w1],sigmaVerfaelschung);
assert(verfOld1==_n1verf[w1]);
double verfNew1=verfaelsche(_n1[w1]+n,sigmaVerfaelschung);
double verfOld2=verfaelsche(_n2[w2],sigmaVerfaelschung);
assert(verfOld2==_n2verf[w2]);
double verfNew2=verfaelsche(_n2[w2]+n,sigmaVerfaelschung);
_n1verf[w1]=verfNew1;
_unigramVerfSum1+=verfNew1-verfOld1;
_n2verf[w2]=verfNew2;
_unigramVerfSum2+=verfNew2-verfOld2;
_nverf[w1][w2]=verfNew;
_bigramVerfSum+=verfNew-verfOld;
_nWords+=n;
}
s+=n;
_n1[w1]+=n;
_n2[w2]+=n;
assert(_n[w1][w2]>=0);
assert(_n1[w1]>=0);
assert(_n2[w2]>=0);
if(s==0)
eta0++;
else if(s==1)
eta1++;
if(_n1[w1]==0)
c1_0++;
if(_n2[w2]==0)
c2_0++;
}
};
#endif
|
