| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/tslmpack/ |
| arpa_conv.h | 54 TNodeLevels& nodeLevels, CThreadSlm::TLeaf*& leafLevel);
|
| arpa_slm.h | 49 struct TLeaf {
58 TLeaf() : wid(0), pr(.0), ch(0), bon(0), bol(0) {}
61 struct TNode : public TLeaf {
68 typedef std::vector<TLeaf> TLeafLevel;
|
| arpa_conv.cpp | 42 // convert CArpaSlm::TLeaf to CThreadSlm::TLeaf
58 CThreadSlm::TLeaf operator()(const CArpaSlm::TLeaf& leaf) {
59 CThreadSlm::TLeaf tleaf; local
60 tleaf.set_wid(leaf.wid);
61 tleaf.set_bon(leaf.bon);
62 tleaf.set_bol(leaf.bol);
64 tleaf.set_pr(pr_idx)
[all...] |
| common.h | 47 typedef std::vector<CThreadSlm::TLeaf> TLeafLevel;
|
| /nv-g11n/inputmethod/sunpinyin2/src/slm/tslmpack/ |
| arpa_conv.h | 54 TNodeLevels& nodeLevels, CThreadSlm::TLeaf*& leafLevel);
|
| arpa_slm.h | 49 struct TLeaf {
58 TLeaf() : wid(0), pr(.0), ch(0), bon(0), bol(0) {}
61 struct TNode : public TLeaf {
68 typedef std::vector<TLeaf> TLeafLevel;
|
| arpa_conv.cpp | 42 // convert CArpaSlm::TLeaf to CThreadSlm::TLeaf
58 CThreadSlm::TLeaf operator()(const CArpaSlm::TLeaf& leaf) {
59 CThreadSlm::TLeaf tleaf; local
60 tleaf.set_wid(leaf.wid);
61 tleaf.set_bon(leaf.bon);
62 tleaf.set_bol(leaf.bol);
64 tleaf.set_pr(pr_idx)
[all...] |
| common.h | 47 typedef std::vector<CThreadSlm::TLeaf> TLeafLevel;
|
| /nv-g11n/inputmethod/sunpinyin2/src/slm/tslmendian/ |
| slm_file.cpp | 47 * - leaf[N-1][] : CThreadSlm::TLeaf * slm.getLevelSize(N)
67 typedef CThreadSlm::TLeaf TLeaf;
83 // byte order reversed CThreadSlm::TLeaf small-endian presentation on big-endian machine
97 CThreadSlm::TLeaf leaf_betole(const CThreadSlm::TLeaf& v)
99 // since the CThreadSlm::TLeaf `protects' its bits, we duplicated a `public' one
112 TLeaf leaf;
134 TLeaf leaf_letobe(const TLeaf& v
[all...] |
| slm_file.h | 98 CThreadSlm::TLeaf* m_leafs;
|
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/tslmendian/ |
| slm_file.cpp | 47 * - leaf[] : CThreadSlm::TLeaf * slm.getLevelSize(N)
67 typedef CThreadSlm::TLeaf TLeaf;
83 // byte order reversed CThreadSlm::TLeaf small-endian presentation on big-endian machine
97 CThreadSlm::TLeaf leaf_betole(const CThreadSlm::TLeaf& v)
99 // since the CThreadSlm::TLeaf `protects' its bits, we duplicated a `public' one
112 TLeaf leaf;
134 TLeaf leaf_letobe(const TLeaf& v
[all...] |
| slm_file.h | 98 CThreadSlm::TLeaf* m_leafs;
|
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/ |
| sim_slm.h | 52 struct TLeaf {
59 TLeaf(TSIMWordId theId=0, FREQ_TYPE fr=0) : id(theId), freq(fr)
61 bool operator< (const TLeaf & r) const
63 bool operator> (const TLeaf & r) const
65 bool operator==(const TLeaf & r) const
69 struct TNode : public TLeaf {
74 : TLeaf(theId, fr), child(ch), bow(theBOW)
|
| sim_slm.cpp | 57 level[lvl] = new TLeaf [sz[lvl]];
58 fread(level[lvl], sizeof(TLeaf), sz[lvl], fp);
72 delete [] ((TLeaf*)level[lvl]);
112 TLeaf* p = (TLeaf*)level[lvl+1];
122 return ((TLeaf*)pstate)->pr; // as we derive TNode from TLeaf
144 TLeaf* p = (TLeaf*)level[lvl+1];
154 return ((TLeaf*)pstate)->pr; // as we derive TNode from TLea
[all...] |
| slm.cpp | 205 TLeaf* pBase =(TLeaf*)m_Levels[lvl+1];
258 const TLeaf* pn = ((const TLeaf *)m_Levels[m_N]) + st.getIdx();
277 TLeaf* pl = ((TLeaf *)m_Levels[m_N]) + st.getIdx();
292 TLeaf* pl = ((TLeaf *)m_Levels[m_N]) + st.getIdx();
|
| /nv-g11n/inputmethod/sunpinyin2/src/slm/ |
| sim_slm.h | 52 struct TLeaf {
59 TLeaf(TSIMWordId theId=0, FREQ_TYPE fr=0) : id(theId), freq(fr)
61 bool operator< (const TLeaf & r) const
63 bool operator> (const TLeaf & r) const
65 bool operator==(const TLeaf & r) const
69 struct TNode : public TLeaf {
74 : TLeaf(theId, fr), child(ch), bow(theBOW)
|
| sim_slm.cpp | 57 level[lvl] = new TLeaf [sz[lvl]];
58 fread(level[lvl], sizeof(TLeaf), sz[lvl], fp);
72 delete [] ((TLeaf*)level[lvl]);
112 TLeaf* p = (TLeaf*)level[lvl+1];
122 return ((TLeaf*)pstate)->pr; // as we derive TNode from TLeaf
144 TLeaf* p = (TLeaf*)level[lvl+1];
154 return ((TLeaf*)pstate)->pr; // as we derive TNode from TLea
[all...] |
| slm.cpp | 211 TLeaf* pBase =(TLeaf*)m_Levels[lvl+1];
264 const TLeaf* pn = ((const TLeaf *)m_Levels[m_N]) + st.getIdx();
283 TLeaf* pl = ((TLeaf *)m_Levels[m_N]) + st.getIdx();
298 TLeaf* pl = ((TLeaf *)m_Levels[m_N]) + st.getIdx();
|
| /nv-g11n/inputmethod/sunpinyin/ime/src/slm/ |
| slm.cpp | 203 TLeaf* pBase =(TLeaf*)m_Levels[lvl+1];
256 const TLeaf* pn = ((const TLeaf *)m_Levels[m_N]) + st.getIdx();
275 TLeaf* pl = ((TLeaf *)m_Levels[m_N]) + st.getIdx();
290 TLeaf* pl = ((TLeaf *)m_Levels[m_N]) + st.getIdx();
|
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/slmprune/ |
| slmprune.cpp | 115 fwrite(level[N], sizeof(TLeaf), sz[N], out);
177 hw[lvl] = (((TLeaf*)level[lvl])+idx[lvl])->id;
208 (((TLeaf*)level[lvl]) + pinfo->idx)->pr = 0.0; // -log(1.0)
210 (((TLeaf*)level[lvl]) + pinfo->idx)->pr = 1.0;
220 k = CutLevel((TNode*)level[lvl-1], ((TNode*)level[lvl-1])+sz[lvl-1], (TLeaf*)level[lvl], ((TLeaf*)level[lvl])+sz[lvl], bUseLogPr);
273 TLeaf* ch = (TLeaf*)level[lvl+1];
306 PHW = exp(-((((TLeaf*)level[lvl])+idx[lvl])->pr));
308 PHW = ((((TLeaf*)level[lvl])+idx[lvl])->pr)
[all...] |
| /nv-g11n/inputmethod/sunpinyin2/src/slm/slmprune/ |
| slmprune.cpp | 115 fwrite(level[N], sizeof(TLeaf), sz[N], out);
177 hw[lvl] = (((TLeaf*)level[lvl])+idx[lvl])->id;
208 (((TLeaf*)level[lvl]) + pinfo->idx)->pr = 0.0; // -log(1.0)
210 (((TLeaf*)level[lvl]) + pinfo->idx)->pr = 1.0;
220 k = CutLevel((TNode*)level[lvl-1], ((TNode*)level[lvl-1])+sz[lvl-1], (TLeaf*)level[lvl], ((TLeaf*)level[lvl])+sz[lvl], bUseLogPr);
273 TLeaf* ch = (TLeaf*)level[lvl+1];
306 PHW = exp(-((((TLeaf*)level[lvl])+idx[lvl])->pr));
308 PHW = ((((TLeaf*)level[lvl])+idx[lvl])->pr)
[all...] |
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/thread/ |
| slmthread.cpp | 84 TLeaf*
112 TLeaf* p = (TLeaf*)level[lvl+1];
114 m = (pstate != NULL)?(((TLeaf*)pstate) - p):(-1);
145 history.push_back(((TLeaf*)(level[i]))[idx].id);
187 CSIMSlm::TLeaf*
193 return (((TLeaf*)(level[lvl]))+idx);
212 CThreadSlm::TLeaf* lastLevel;
247 CSIMSlm::TLeaf* pl = slm.getNodePtr(it);
378 lastLevel = new CThreadSlm::TLeaf [slm.getLevelSize(slm.getN())]
[all...] |
| /nv-g11n/inputmethod/sunpinyin2/src/slm/thread/ |
| slmthread.cpp | 84 TLeaf*
112 TLeaf* p = (TLeaf*)level[lvl+1];
114 m = (pstate != NULL)?(((TLeaf*)pstate) - p):(-1);
145 history.push_back(((TLeaf*)(level[i]))[idx].id);
187 CSIMSlm::TLeaf*
193 return (((TLeaf*)(level[lvl]))+idx);
212 CThreadSlm::TLeaf* lastLevel;
247 CSIMSlm::TLeaf* pl = slm.getNodePtr(it);
378 lastLevel = new CThreadSlm::TLeaf [slm.getLevelSize(slm.getN())]
[all...] |
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/slminfo/ |
| slminfo.cpp | 137 fseek(fp, level_offset[i]+sizeof(CSIMSlm::TLeaf)*idx[i], SEEK_SET);
138 fread(&(nodes[i][0]), sizeof(CSIMSlm::TLeaf), 1, fp);
139 fread(&(nodes[i][1]), sizeof(CSIMSlm::TLeaf), 1, fp);
196 fseek(fp, level_offset[lvl]+sizeof(CSIMSlm::TLeaf)*(idx[lvl]+1), SEEK_SET);
197 fread(&(nodes[lvl][1]), sizeof(CSIMSlm::TLeaf), 1, fp);
|
| /nv-g11n/inputmethod/sunpinyin2/src/slm/slminfo/ |
| slminfo.cpp | 137 fseek(fp, level_offset[i]+sizeof(CSIMSlm::TLeaf)*idx[i], SEEK_SET);
138 fread(&(nodes[i][0]), sizeof(CSIMSlm::TLeaf), 1, fp);
139 fread(&(nodes[i][1]), sizeof(CSIMSlm::TLeaf), 1, fp);
196 fseek(fp, level_offset[lvl]+sizeof(CSIMSlm::TLeaf)*(idx[lvl]+1), SEEK_SET);
197 fread(&(nodes[lvl][1]), sizeof(CSIMSlm::TLeaf), 1, fp);
|
