forked from jaiminpan/pg_jieba
-
Notifications
You must be signed in to change notification settings - Fork 0
/
jieba.cpp
175 lines (136 loc) · 3.23 KB
/
jieba.cpp
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
/*-------------------------------------------------------------------------
*
* jieba.cpp
* Contains functions which acted as an interface between the C++ and C
*
* Author: Jaimin Pan <[email protected]>
*
* IDENTIFICATION
* jieba.cpp
*
*-------------------------------------------------------------------------
*/
#include <string>
#include <vector>
#include "jieba.h"
#include "cppjieba/Jieba.hpp"
using namespace cppjieba;
using namespace std;
#ifdef __cplusplus
extern "C" {
#endif
struct JiebaCtx
{
DictTrie* dict_trie_;
HMMModel* hmm_model_;
// They share the same dict trie and model
MixSegment* mix_seg_;
QuerySegment* query_seg_;
MPSegment* mp_seg_;
HMMSegment* hmm_seg_;
unordered_map<string, int> lex_id_;
};
struct ParStat
{
vector<string>::iterator iter;
vector<string> *words;
JiebaResult cur;
};
static int Jieba_LookupType(JiebaCtx* ctx, const string& str);
JiebaCtx *
Jieba_New(const char* dict_path, const char* model_path, const char* user_dict_path)
{
JiebaCtx* ctx = new JiebaCtx();
ctx->dict_trie_ = new DictTrie(dict_path, user_dict_path);
ctx->hmm_model_ = new HMMModel(model_path);
ctx->mix_seg_ = new MixSegment(ctx->dict_trie_, ctx->hmm_model_);
ctx->query_seg_ = new QuerySegment(ctx->dict_trie_, ctx->hmm_model_);
ctx->mp_seg_ = new MPSegment(ctx->dict_trie_);
ctx->hmm_seg_ = new HMMSegment(ctx->hmm_model_);
int num_types = sizeof(lex_descr) / sizeof(lex_descr[0]);
for (auto i = 1; i < num_types; ++i) {
ctx->lex_id_.insert({lex_descr[i].token, i});
}
return ctx;
}
void
Jieba_Free(JiebaCtx* ctx)
{
delete ctx->mix_seg_;
delete ctx->query_seg_;
delete ctx->mp_seg_;
delete ctx->hmm_seg_;
delete ctx->dict_trie_;
delete ctx->hmm_model_;
delete ctx;
}
ParStat *
Jieba_Cut(JiebaCtx* ctx, const char* str, int len, int mode)
{
SegmentBase* x;
string sentence(str, len);
vector<string> *words = new vector<string>();
switch (mode) {
case MODE_MIX:
x = (SegmentBase*) ctx->mix_seg_;
break;
case MODE_MP:
x = (SegmentBase*) ctx->mp_seg_;
break;
case MODE_HMM:
x = (SegmentBase*) ctx->hmm_seg_;
break;
case MODE_QRY:
x = (SegmentBase*) ctx->query_seg_;
break;
default:
x = (SegmentBase*) ctx->mix_seg_;
break;
}
x->Cut(sentence, *words);
ParStat* stat = ParStat_New();
stat->words = words;
stat->iter = words->begin();
return stat;
}
JiebaResult *
Jieba_GetNext(JiebaCtx* ctx, ParStat* stat)
{
if (!stat->words)
return NULL;
vector<string>::iterator& cur_iter = stat->iter;
vector<string>::iterator end_iter = stat->words->end();
JiebaResult* result = &(stat->cur);
if (cur_iter == end_iter)
return NULL;
result->str = (char *) cur_iter->c_str();
result->len = cur_iter->length();
result->attr = Jieba_LookupType(ctx, *cur_iter);
++cur_iter;
return result;
}
static int
Jieba_LookupType(JiebaCtx* ctx, const string& str) {
MixSegment* x = (MixSegment*) ctx->mix_seg_;
string typ = x->LookupTag(str);
unordered_map<string, int>::const_iterator got = ctx->lex_id_.find(typ);
if (got == ctx->lex_id_.end())
return 0;
return got->second;
}
ParStat *
ParStat_New()
{
ParStat* stat = new ParStat();
return stat;
}
void
ParStat_Free(ParStat* stat)
{
if (stat->words)
delete stat->words;
delete stat;
}
#ifdef __cplusplus
}
#endif