3 * Library to deal with pinyin.
5 * Copyright (C) 2011 Peng Wu <alexepico@gmail.com>
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
27 #include "pinyin_parser2.h"
28 #include "pinyin_phrase2.h"
29 #include "pinyin_custom2.h"
30 #include "chewing_key.h"
31 #include "pinyin_parser_table.h"
32 #include "double_pinyin_table.h"
33 #include "chewing_table.h"
36 using namespace pinyin;
38 static bool check_pinyin_options(guint32 options, const pinyin_index_item_t * item) {
39 guint32 flags = item->m_flags;
40 assert (flags & IS_PINYIN);
42 /* handle incomplete pinyin. */
43 if (flags & PINYIN_INCOMPLETE) {
44 if (!(options & PINYIN_INCOMPLETE))
48 /* handle correct pinyin, currently only one flag per item. */
49 flags &= PINYIN_CORRECT_ALL;
50 options &= PINYIN_CORRECT_ALL;
53 if ((flags & options) != flags)
60 static bool check_chewing_options(guint32 options, const chewing_index_item_t * item) {
61 guint32 flags = item->m_flags;
62 assert (flags & IS_CHEWING);
64 /* handle incomplete chewing. */
65 if (flags & CHEWING_INCOMPLETE) {
66 if (!(options & CHEWING_INCOMPLETE))
74 /* methods for Chewing Keys to access pinyin parser table. */
75 const char * ChewingKeyRest::get_pinyin_string(){
76 if (m_table_index == 0)
79 /* check end boundary. */
80 assert(m_table_index < G_N_ELEMENTS(content_table));
81 return content_table[m_table_index].m_pinyin_str;
84 const char * ChewingKeyRest::get_chewing_string(){
85 if (m_table_index == 0)
88 /* check end boundary. */
89 assert(m_table_index < G_N_ELEMENTS(content_table));
90 return content_table[m_table_index].m_chewing_str;
96 /* internal information for pinyin parsers. */
99 ChewingKeyRest m_key_rest;
113 const guint16 max_full_pinyin_length = 7; /* include tone. */
115 const guint16 max_double_pinyin_length = 3; /* include tone. */
117 const guint16 max_chewing_length = 4; /* include tone. */
119 static bool compare_less_than(const pinyin_index_item_t & lhs,
120 const pinyin_index_item_t & rhs){
121 return 0 > strcmp(lhs.m_pinyin_input, rhs.m_pinyin_input);
124 static inline bool search_pinyin_index(guint32 options, const char * pinyin,
126 ChewingKeyRest & key_rest){
127 pinyin_index_item_t item;
128 memset(&item, 0, sizeof(item));
129 item.m_pinyin_input = pinyin;
131 std_lite::pair<const pinyin_index_item_t *,
132 const pinyin_index_item_t *> range;
133 range = std_lite::equal_range
134 (pinyin_index, pinyin_index + G_N_ELEMENTS(pinyin_index),
135 item, compare_less_than);
137 guint16 range_len = range.second - range.first;
138 assert (range_len <= 1);
139 if ( range_len == 1 ) {
140 const pinyin_index_item_t * index = range.first;
142 if (!check_pinyin_options(options, index))
145 key_rest.m_table_index = index->m_table_index;
146 key = content_table[key_rest.m_table_index].m_chewing_key;
153 /* Full Pinyin Parser */
154 FullPinyinParser2::FullPinyinParser2 (){
155 m_parse_steps = g_array_new(TRUE, FALSE, sizeof(parse_value_t));
159 bool FullPinyinParser2::parse_one_key (guint32 options, ChewingKey & key,
160 ChewingKeyRest & key_rest,
161 const char * pinyin, int len) const {
162 /* "'" are not accepted in parse_one_key. */
163 assert(NULL == strchr(pinyin, '\''));
164 gchar * input = g_strndup(pinyin, len);
166 guint16 tone = CHEWING_ZERO_TONE; guint16 tone_pos = 0;
167 guint16 parsed_len = len;
168 key = ChewingKey(); key_rest = ChewingKeyRest();
170 if (options & USE_TONE) {
171 /* find the tone in the last character. */
172 char chr = input[parsed_len - 1];
173 if ( '0' < chr && chr <= '5' ) {
176 tone_pos = parsed_len;
180 /* parse pinyin core staff here. */
182 /* Note: optimize here? */
183 input[parsed_len] = '\0';
184 if (!search_pinyin_index(options, input, key, key_rest))
187 if (options & USE_TONE) {
188 /* post processing tone. */
189 if ( parsed_len == tone_pos ) {
190 if (tone != CHEWING_ZERO_TONE) {
197 key_rest.m_raw_begin = 0; key_rest.m_raw_end = parsed_len;
199 return parsed_len == len;
203 int FullPinyinParser2::parse (guint32 options, ChewingKeyVector & keys,
204 ChewingKeyRestVector & key_rests,
205 const char *str, int len) const {
208 g_array_set_size(keys, 0);
209 g_array_set_size(key_rests, 0);
211 /* init m_parse_steps, and prepare dynamic programming. */
212 int step_len = len + 1;
213 g_array_set_size(m_parse_steps, 0);
215 for (i = 0; i < step_len; ++i) {
216 g_array_append_val(m_parse_steps, value);
220 gchar * input = g_strndup(str, len);
221 parse_value_t * curstep = NULL, * nextstep = NULL;
223 for (i = 0; i < len; ) {
224 if (input[i] == '\'') {
225 curstep = &g_array_index(m_parse_steps, parse_value_t, i);
226 nextstep = &g_array_index(m_parse_steps, parse_value_t, i + 1);
228 /* propagate current step into next step. */
229 nextstep->m_key = ChewingKey();
230 nextstep->m_key_rest = ChewingKeyRest();
231 nextstep->m_num_keys = curstep->m_num_keys;
232 nextstep->m_parsed_len = curstep->m_parsed_len + 1;
233 nextstep->m_last_step = i;
238 /* forward to next "'" */
239 if ( 0 == next_sep ) {
241 for (k = i; k < len; ++k) {
242 if (input[k] == '\'')
249 /* dynamic programming here. */
250 for (size_t m = i; m < next_sep; ++m) {
251 curstep = &g_array_index(m_parse_steps, parse_value_t, m);
252 size_t try_len = std_lite::min
253 (m + max_full_pinyin_length, next_sep);
254 for (size_t n = m + 1; n < try_len + 1; ++n) {
255 nextstep = &g_array_index(m_parse_steps, parse_value_t, n);
258 const char * onepinyin = input + m;
259 gint16 onepinyinlen = n - m;
260 value = parse_value_t();
262 ChewingKey key; ChewingKeyRest rest;
263 bool parsed = parse_one_key
264 (options, key, rest, onepinyin, onepinyinlen);
265 rest.m_raw_begin = m; rest.m_raw_end = n;
268 value.m_key = key; value.m_key_rest = rest;
269 value.m_num_keys = curstep->m_num_keys + 1;
270 value.m_parsed_len = curstep->m_parsed_len + onepinyinlen;
271 value.m_last_step = m;
274 if (-1 == nextstep->m_last_step)
276 if (value.m_parsed_len > nextstep->m_parsed_len)
278 if (value.m_parsed_len == nextstep->m_parsed_len &&
279 value.m_num_keys < nextstep->m_num_keys)
285 /* final step for back tracing. */
286 gint16 parsed_len = final_step(step_len, keys, key_rests);
288 /* post processing for re-split table. */
289 if (options & USE_RESPLIT_TABLE) {
290 post_process(options, keys, key_rests);
297 int FullPinyinParser2::final_step(size_t step_len, ChewingKeyVector & keys,
298 ChewingKeyRestVector & key_rests) const{
300 gint16 parsed_len = 0;
301 parse_value_t * curstep = NULL;
303 /* find longest match, which starts from the beginning of input. */
304 for (i = step_len - 1; i >= 0; --i) {
305 curstep = &g_array_index(m_parse_steps, parse_value_t, i);
306 if (i == curstep->m_parsed_len)
309 /* prepare saving. */
310 parsed_len = curstep->m_parsed_len;
311 gint16 num_keys = curstep->m_num_keys;
312 g_array_set_size(keys, num_keys);
313 g_array_set_size(key_rests, num_keys);
315 /* save the match. */
316 while (curstep->m_last_step != -1) {
317 gint16 pos = curstep->m_num_keys - 1;
320 if (0 != curstep->m_key_rest.m_table_index) {
321 ChewingKey * key = &g_array_index(keys, ChewingKey, pos);
322 ChewingKeyRest * rest = &g_array_index
323 (key_rests, ChewingKeyRest, pos);
324 *key = curstep->m_key; *rest = curstep->m_key_rest;
328 curstep = &g_array_index(m_parse_steps, parse_value_t,
329 curstep->m_last_step);
335 bool FullPinyinParser2::post_process(guint32 options,
336 ChewingKeyVector & keys,
337 ChewingKeyRestVector & key_rests) const {
339 assert(keys->len == key_rests->len);
340 gint16 num_keys = keys->len;
342 ChewingKey * cur_key = NULL, * next_key = NULL;
343 ChewingKeyRest * cur_rest = NULL, * next_rest = NULL;
344 guint16 cur_tone = CHEWING_ZERO_TONE, next_tone = CHEWING_ZERO_TONE;
346 for (i = 0; i < num_keys - 1; ++i) {
347 cur_rest = &g_array_index(key_rests, ChewingKeyRest, i);
348 next_rest = &g_array_index(key_rests, ChewingKeyRest, i + 1);
351 if (cur_rest->m_raw_end != next_rest->m_raw_begin)
354 cur_key = &g_array_index(keys, ChewingKey, i);
355 next_key = &g_array_index(keys, ChewingKey, i + 1);
357 if (options & USE_TONE) {
358 cur_tone = cur_key->m_tone;
359 next_tone = next_key->m_tone;
360 cur_key->m_tone = next_key->m_tone = CHEWING_ZERO_TONE;
363 /* lookup re-split table */
365 const resplit_table_item_t * item = NULL;
366 for (k = 0; k < G_N_ELEMENTS(resplit_table); ++k) {
367 item = resplit_table + k;
369 if (item->m_orig_freq >= item->m_new_freq)
372 /* use pinyin_exact_compare2 here. */
373 if (0 == pinyin_exact_compare2(item->m_orig_keys,
380 if (k < G_N_ELEMENTS(resplit_table)) {
382 item = resplit_table + k;
383 *cur_key = item->m_new_keys[0];
384 *next_key = item->m_new_keys[1];
385 /* assumes only moved one char in gen_all_resplit script. */
386 cur_rest->m_raw_end --;
387 next_rest->m_raw_begin --;
390 /* save back tones */
391 if (options & USE_TONE) {
392 cur_key->m_tone = cur_tone;
393 next_key->m_tone = next_tone;
400 #define IS_KEY(x) (('a' <= x && x <= 'z') || x == ';')
402 bool DoublePinyinParser2::parse_one_key (guint32 options, ChewingKey & key,
403 ChewingKeyRest & key_rest,
404 const char *str, int len) const{
407 if (!(options & PINYIN_INCOMPLETE))
414 int charid = ch == ';' ? 26 : ch - 'a';
415 const char * sheng = m_shengmu_table[charid].m_shengmu;
416 if (NULL == sheng || strcmp(sheng, "'") == 0)
419 if (search_pinyin_index(options, sheng, key, key_rest)) {
420 key_rest.m_raw_begin = 0; key_rest.m_raw_end = len;
427 ChewingTone tone = CHEWING_ZERO_TONE;
428 options &= ~(PINYIN_CORRECT_ALL|PINYIN_AMB_ALL);
432 if (!(options & USE_TONE))
435 if (!('0' < ch && ch <= '5'))
437 tone = (ChewingTone) (ch - '0');
440 if (2 == len || 3 == len) {
441 /* parse shengmu here. */
446 int charid = ch == ';' ? 26 : ch - 'a';
447 const char * sheng = m_shengmu_table[charid].m_shengmu;
450 if (strcmp(sheng, "'") == 0)
453 /* parse yunmu here. */
458 charid = ch == ';' ? 26 : ch - 'a';
460 const char * yun = m_yunmu_table[charid].m_yunmus[0];
461 gchar * pinyin = g_strdup_printf("%s%s", sheng, yun);
462 if (search_pinyin_index(options, pinyin, key, key_rest)) {
463 key_rest.m_raw_begin = 0; key_rest.m_raw_end = len;
471 yun = m_yunmu_table[charid].m_yunmus[1];
472 pinyin = g_strdup_printf("%s%s", sheng, yun);
473 if (search_pinyin_index(options, pinyin, key, key_rest)) {
474 key_rest.m_raw_begin = 0; key_rest.m_raw_end = len;
487 /* only 'a'-'z' and ';' are accepted here. */
488 int DoublePinyinParser2::parse (guint32 options, ChewingKeyVector & keys,
489 ChewingKeyRestVector & key_rests,
490 const char *str, int len) const{
491 g_array_set_size(keys, 0);
492 g_array_set_size(key_rests, 0);
494 int maximum_len = 0; int i;
495 /* probe the longest possible double pinyin string. */
496 for (i = 0; i < len; ++i) {
502 /* maximum forward match for double pinyin. */
504 while (parsed_len < maximum_len) {
505 const char * cur_str = str + parsed_len;
506 i = std_lite::min(maximum_len - parsed_len,
507 (int)max_double_pinyin_length);
509 ChewingKey key; ChewingKeyRest key_rest;
511 bool success = parse_one_key(options, key, key_rest, cur_str, i);
516 if (0 == i) /* no more possible double pinyins. */
519 key_rest.m_raw_begin = parsed_len; key_rest.m_raw_end = parsed_len + i;
522 /* save the pinyin */
523 g_array_append_val(keys, key);
524 g_array_append_val(key_rests, key_rest);
532 bool DoublePinyinParser2::set_scheme(DoublePinyinScheme scheme) {
535 case DOUBLE_PINYIN_ZRM:
536 m_shengmu_table = double_pinyin_zrm_sheng;
537 m_yunmu_table = double_pinyin_zrm_yun;
539 case DOUBLE_PINYIN_MS:
540 m_shengmu_table = double_pinyin_mspy_sheng;
541 m_yunmu_table = double_pinyin_mspy_yun;
543 case DOUBLE_PINYIN_ZIGUANG:
544 m_shengmu_table = double_pinyin_zgpy_sheng;
545 m_yunmu_table = double_pinyin_zgpy_yun;
547 case DOUBLE_PINYIN_ABC:
548 m_shengmu_table = double_pinyin_abc_sheng;
549 m_yunmu_table = double_pinyin_abc_yun;
551 case DOUBLE_PINYIN_PYJJ:
552 m_shengmu_table = double_pinyin_pyjj_sheng;
553 m_yunmu_table = double_pinyin_pyjj_yun;
555 case DOUBLE_PINYIN_XHE:
556 m_shengmu_table = double_pinyin_xhe_sheng;
557 m_yunmu_table = double_pinyin_xhe_yun;
559 case DOUBLE_PINYIN_CUSTOMIZED:
563 return false; /* no such scheme. */
567 bool ChewingParser2::parse_one_key(guint32 options, ChewingKey & key, ChewingKeyRest & key_rest, const char *str, int len) const {
572 int ChewingParser2::parse(guint32 options, ChewingKeyVector & keys, ChewingKeyRestVector & key_rests, const char *str, int len) const {
577 bool ChewingParser2::set_scheme(ChewingScheme scheme) {
579 case CHEWING_STANDARD:
580 m_symbol_table = chewing_standard_symbols;
581 m_tone_table = chewing_standard_tones;
584 m_symbol_table = chewing_ibm_symbols;
585 m_tone_table = chewing_ibm_tones;
587 case CHEWING_GINYIEH:
588 m_symbol_table = chewing_ginyieh_symbols;
589 m_tone_table = chewing_ginyieh_tones;
592 m_symbol_table = chewing_eten_symbols;
593 m_tone_table = chewing_eten_tones;