| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
|
| #include <string.h> |
|
|
| #include "util/pio.h" |
| #include "util/ckd_alloc.h" |
| #include "util/strfuncs.h" |
| #include "dict.h" |
|
|
|
|
| #define DELIM " \t\n" |
| #define DEFAULT_NUM_PHONE (MAX_S3CIPID+1) |
|
|
| #if WIN32 |
| #define snprintf sprintf_s |
| #endif |
|
|
| extern const char *const cmu6_lts_phone_table[]; |
|
|
| static s3cipid_t |
| dict_ciphone_id(dict_t * d, const char *str) |
| { |
| if (d->nocase) |
| return bin_mdef_ciphone_id_nocase(d->mdef, str); |
| else |
| return bin_mdef_ciphone_id(d->mdef, str); |
| } |
|
|
|
|
| const char * |
| dict_ciphone_str(dict_t * d, s3wid_t wid, int32 pos) |
| { |
| assert(d != NULL); |
| assert((wid >= 0) && (wid < d->n_word)); |
| assert((pos >= 0) && (pos < d->word[wid].pronlen)); |
|
|
| return bin_mdef_ciphone_str(d->mdef, d->word[wid].ciphone[pos]); |
| } |
|
|
|
|
| s3wid_t |
| dict_add_word(dict_t * d, char const *word, s3cipid_t const * p, int32 np) |
| { |
| int32 len; |
| dictword_t *wordp; |
| s3wid_t newwid; |
| char *wword; |
|
|
| if (d->n_word >= d->max_words) { |
| E_INFO("Reallocating to %d KiB for word entries\n", |
| (d->max_words + S3DICT_INC_SZ) * sizeof(dictword_t) / 1024); |
| d->word = |
| (dictword_t *) ckd_realloc(d->word, |
| (d->max_words + |
| S3DICT_INC_SZ) * sizeof(dictword_t)); |
| d->max_words = d->max_words + S3DICT_INC_SZ; |
| } |
|
|
| wordp = d->word + d->n_word; |
| wordp->word = (char *) ckd_salloc(word); |
|
|
| |
| wword = ckd_salloc(word); |
| if ((len = dict_word2basestr(wword)) > 0) { |
| int32 w; |
|
|
| |
| if (hash_table_lookup_int32(d->ht, wword, &w) < 0) { |
| E_ERROR("Missing base word for: %s\n", word); |
| ckd_free(wword); |
| ckd_free(wordp->word); |
| wordp->word = NULL; |
| return BAD_S3WID; |
| } |
|
|
| |
| wordp->basewid = w; |
| wordp->alt = d->word[w].alt; |
| d->word[w].alt = d->n_word; |
| } else { |
| wordp->alt = BAD_S3WID; |
| wordp->basewid = d->n_word; |
| } |
| ckd_free(wword); |
|
|
| |
| if (hash_table_enter_int32(d->ht, wordp->word, d->n_word) != d->n_word) { |
| ckd_free(wordp->word); |
| wordp->word = NULL; |
| return BAD_S3WID; |
| } |
|
|
| |
| if (p && (np > 0)) { |
| wordp->ciphone = (s3cipid_t *) ckd_malloc(np * sizeof(s3cipid_t)); |
| memcpy(wordp->ciphone, p, np * sizeof(s3cipid_t)); |
| wordp->pronlen = np; |
| } |
| else { |
| wordp->ciphone = NULL; |
| wordp->pronlen = 0; |
| } |
|
|
| newwid = d->n_word++; |
|
|
| return newwid; |
| } |
|
|
|
|
| static int32 |
| dict_read(FILE * fp, dict_t * d) |
| { |
| lineiter_t *li; |
| char **wptr; |
| s3cipid_t *p; |
| int32 lineno, nwd; |
| s3wid_t w; |
| int32 i, maxwd; |
| size_t stralloc, phnalloc; |
|
|
| maxwd = 512; |
| p = (s3cipid_t *) ckd_calloc(maxwd + 4, sizeof(*p)); |
| wptr = (char **) ckd_calloc(maxwd, sizeof(char *)); |
|
|
| lineno = 0; |
| stralloc = phnalloc = 0; |
| for (li = lineiter_start(fp); li; li = lineiter_next(li)) { |
| lineno++; |
| if (0 == strncmp(li->buf, "##", 2) |
| || 0 == strncmp(li->buf, ";;", 2)) |
| continue; |
|
|
| if ((nwd = str2words(li->buf, wptr, maxwd)) < 0) { |
| |
| nwd = str2words(li->buf, NULL, 0); |
| assert(nwd > maxwd); |
| maxwd = nwd; |
| p = (s3cipid_t *) ckd_realloc(p, (maxwd + 4) * sizeof(*p)); |
| wptr = (char **) ckd_realloc(wptr, maxwd * sizeof(*wptr)); |
| } |
|
|
| if (nwd == 0) |
| continue; |
| |
| if (nwd == 1) { |
| E_ERROR("Line %d: No pronunciation for word '%s'; ignored\n", |
| lineno, wptr[0]); |
| continue; |
| } |
|
|
|
|
| |
| for (i = 1; i < nwd; i++) { |
| p[i - 1] = dict_ciphone_id(d, wptr[i]); |
| if (NOT_S3CIPID(p[i - 1])) { |
| E_ERROR("Line %d: Phone '%s' is missing in the acoustic model; word '%s' ignored\n", |
| lineno, wptr[i], wptr[0]); |
| break; |
| } |
| } |
|
|
| if (i == nwd) { |
| w = dict_add_word(d, wptr[0], p, nwd - 1); |
| if (NOT_S3WID(w)) |
| E_ERROR |
| ("Line %d: Failed to add the word '%s' (duplicate?); ignored\n", |
| lineno, wptr[0]); |
| else { |
| stralloc += strlen(d->word[w].word); |
| phnalloc += d->word[w].pronlen * sizeof(s3cipid_t); |
| } |
| } |
| } |
| E_INFO("Dictionary size %d, allocated %d KiB for strings, %d KiB for phones\n", |
| dict_size(d), (int)stralloc / 1024, (int)phnalloc / 1024); |
| ckd_free(p); |
| ckd_free(wptr); |
|
|
| return 0; |
| } |
|
|
| int |
| dict_write(dict_t *dict, char const *filename, char const *format) |
| { |
| FILE *fh; |
| int i; |
|
|
| (void)format; |
| if ((fh = fopen(filename, "w")) == NULL) { |
| E_ERROR_SYSTEM("Failed to open '%s'", filename); |
| return -1; |
| } |
| for (i = 0; i < dict->n_word; ++i) { |
| char *phones; |
| int j, phlen; |
| if (!dict_real_word(dict, i)) |
| continue; |
| for (phlen = j = 0; j < dict_pronlen(dict, i); ++j) |
| phlen += strlen(dict_ciphone_str(dict, i, j)) + 1; |
| phones = ckd_calloc(1, phlen); |
| for (j = 0; j < dict_pronlen(dict, i); ++j) { |
| strcat(phones, dict_ciphone_str(dict, i, j)); |
| if (j != dict_pronlen(dict, i) - 1) |
| strcat(phones, " "); |
| } |
| fprintf(fh, "%-30s %s\n", dict_wordstr(dict, i), phones); |
| ckd_free(phones); |
| } |
| fclose(fh); |
| return 0; |
| } |
|
|
|
|
| dict_t * |
| dict_init(ps_config_t *config, bin_mdef_t * mdef) |
| { |
| FILE *fp, *fp2; |
| int32 n; |
| lineiter_t *li; |
| dict_t *d; |
| s3cipid_t sil; |
| char const *dictfile = NULL, *fillerfile = NULL; |
|
|
| if (config) { |
| dictfile = ps_config_str(config, "dict"); |
| fillerfile = ps_config_str(config, "fdict"); |
| } |
|
|
| |
| |
| |
| |
| |
| fp = NULL; |
| n = 0; |
| if (dictfile) { |
| if ((fp = fopen(dictfile, "r")) == NULL) { |
| E_ERROR_SYSTEM("Failed to open dictionary file '%s' for reading", dictfile); |
| return NULL; |
| } |
| for (li = lineiter_start(fp); li; li = lineiter_next(li)) { |
| if (0 != strncmp(li->buf, "##", 2) |
| && 0 != strncmp(li->buf, ";;", 2)) |
| n++; |
| } |
| fseek(fp, 0L, SEEK_SET); |
| } |
|
|
| fp2 = NULL; |
| if (fillerfile) { |
| if ((fp2 = fopen(fillerfile, "r")) == NULL) { |
| E_ERROR_SYSTEM("Failed to open filler dictionary file '%s' for reading", fillerfile); |
| fclose(fp); |
| return NULL; |
| } |
| for (li = lineiter_start(fp2); li; li = lineiter_next(li)) { |
| if (0 != strncmp(li->buf, "##", 2) |
| && 0 != strncmp(li->buf, ";;", 2)) |
| n++; |
| } |
| fseek(fp2, 0L, SEEK_SET); |
| } |
|
|
| |
| |
| |
| |
| d = (dict_t *) ckd_calloc(1, sizeof(dict_t)); |
| d->refcnt = 1; |
| d->max_words = |
| (n + S3DICT_INC_SZ < MAX_S3WID) ? n + S3DICT_INC_SZ : MAX_S3WID; |
| if (n >= MAX_S3WID) { |
| E_ERROR("Number of words in dictionaries (%d) exceeds limit (%d)\n", n, |
| MAX_S3WID); |
| if (fp) fclose(fp); |
| if (fp2) fclose(fp2); |
| ckd_free(d); |
| return NULL; |
| } |
|
|
| E_INFO("Allocating %d * %d bytes (%d KiB) for word entries\n", |
| d->max_words, sizeof(dictword_t), |
| d->max_words * sizeof(dictword_t) / 1024); |
| d->word = (dictword_t *) ckd_calloc(d->max_words, sizeof(dictword_t)); |
| d->n_word = 0; |
| if (mdef) |
| d->mdef = bin_mdef_retain(mdef); |
|
|
| |
| if (config) |
| d->nocase = ps_config_bool(config, "dictcase"); |
| d->ht = hash_table_new(d->max_words, d->nocase); |
|
|
| |
| if (fp) { |
| E_INFO("Reading main dictionary: %s\n", dictfile); |
| dict_read(fp, d); |
| fclose(fp); |
| E_INFO("%d words read\n", d->n_word); |
| } |
|
|
| if (dict_wordid(d, S3_START_WORD) != BAD_S3WID) { |
| E_ERROR("Remove sentence start word '<s>' from the dictionary\n"); |
| dict_free(d); |
| return NULL; |
| } |
| if (dict_wordid(d, S3_FINISH_WORD) != BAD_S3WID) { |
| E_ERROR("Remove sentence start word '</s>' from the dictionary\n"); |
| dict_free(d); |
| return NULL; |
| } |
| if (dict_wordid(d, S3_SILENCE_WORD) != BAD_S3WID) { |
| E_ERROR("Remove silence word '<sil>' from the dictionary\n"); |
| dict_free(d); |
| return NULL; |
| } |
|
|
| |
| d->filler_start = d->n_word; |
| if (fp2) { |
| E_INFO("Reading filler dictionary: %s\n", fillerfile); |
| dict_read(fp2, d); |
| fclose(fp2); |
| E_INFO("%d words read\n", d->n_word - d->filler_start); |
| } |
| if (mdef) |
| sil = bin_mdef_silphone(mdef); |
| else |
| sil = 0; |
| if (dict_wordid(d, S3_START_WORD) == BAD_S3WID) { |
| dict_add_word(d, S3_START_WORD, &sil, 1); |
| } |
| if (dict_wordid(d, S3_FINISH_WORD) == BAD_S3WID) { |
| dict_add_word(d, S3_FINISH_WORD, &sil, 1); |
| } |
| if (dict_wordid(d, S3_SILENCE_WORD) == BAD_S3WID) { |
| dict_add_word(d, S3_SILENCE_WORD, &sil, 1); |
| } |
|
|
| d->filler_end = d->n_word - 1; |
|
|
| |
| d->startwid = dict_wordid(d, S3_START_WORD); |
| d->finishwid = dict_wordid(d, S3_FINISH_WORD); |
| d->silwid = dict_wordid(d, S3_SILENCE_WORD); |
|
|
| if ((d->filler_start > d->filler_end) |
| || (!dict_filler_word(d, d->silwid))) { |
| E_ERROR("Word '%s' must occur (only) in filler dictionary\n", |
| S3_SILENCE_WORD); |
| dict_free(d); |
| return NULL; |
| } |
|
|
| |
|
|
| return d; |
| } |
|
|
|
|
| s3wid_t |
| dict_wordid(dict_t *d, const char *word) |
| { |
| int32 w; |
|
|
| assert(d); |
| assert(word); |
|
|
| if (hash_table_lookup_int32(d->ht, word, &w) < 0) |
| return (BAD_S3WID); |
| return w; |
| } |
|
|
|
|
| int |
| dict_filler_word(dict_t *d, s3wid_t w) |
| { |
| assert(d); |
| assert((w >= 0) && (w < d->n_word)); |
|
|
| w = dict_basewid(d, w); |
| if ((w == d->startwid) || (w == d->finishwid)) |
| return 0; |
| if ((w >= d->filler_start) && (w <= d->filler_end)) |
| return 1; |
| return 0; |
| } |
|
|
| int |
| dict_real_word(dict_t *d, s3wid_t w) |
| { |
| assert(d); |
| assert((w >= 0) && (w < d->n_word)); |
|
|
| w = dict_basewid(d, w); |
| if ((w == d->startwid) || (w == d->finishwid)) |
| return 0; |
| if ((w >= d->filler_start) && (w <= d->filler_end)) |
| return 0; |
| return 1; |
| } |
|
|
|
|
| int32 |
| dict_word2basestr(char *word) |
| { |
| int32 i, len; |
|
|
| len = strlen(word); |
| if (word[len - 1] == ')') { |
| for (i = len - 2; (i > 0) && (word[i] != '('); --i); |
|
|
| if (i > 0) { |
| |
| word[i] = '\0'; |
| return i; |
| } |
| } |
|
|
| return -1; |
| } |
|
|
| dict_t * |
| dict_retain(dict_t *d) |
| { |
| ++d->refcnt; |
| return d; |
| } |
|
|
| int |
| dict_free(dict_t * d) |
| { |
| int i; |
| dictword_t *word; |
|
|
| if (d == NULL) |
| return 0; |
| if (--d->refcnt > 0) |
| return d->refcnt; |
|
|
| |
| for (i = 0; i < d->n_word; i++) { |
| word = (dictword_t *) & (d->word[i]); |
| if (word->word) |
| ckd_free((void *) word->word); |
| if (word->ciphone) |
| ckd_free((void *) word->ciphone); |
| } |
|
|
| if (d->word) |
| ckd_free((void *) d->word); |
| if (d->ht) |
| hash_table_free(d->ht); |
| if (d->mdef) |
| bin_mdef_free(d->mdef); |
| ckd_free((void *) d); |
|
|
| return 0; |
| } |
|
|
| void |
| dict_report(dict_t * d) |
| { |
| E_INFO_NOFN("Initialization of dict_t, report:\n"); |
| E_INFO_NOFN("Max word: %d\n", d->max_words); |
| E_INFO_NOFN("No of word: %d\n", d->n_word); |
| E_INFO_NOFN("\n"); |
| } |
|
|