Download src/ms_mgau.c from camenduru/pocketsphinx: direct link, hf CLI and curl.
- Browser
- Download file 8.9 kB
-
https://huggingface.co/camenduru/pocketsphinx/resolve/main/src/ms_mgau.c
- Command line
-
hf download hf://camenduru/pocketsphinx/src/ms_mgau.c
-
curl -L -o ms_mgau.c https://huggingface.co/camenduru/pocketsphinx/resolve/main/src/ms_mgau.c
8.9 kB
| /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */ | |
| /* ==================================================================== | |
| * Copyright (c) 1999-2004 Carnegie Mellon University. All rights | |
| * reserved. | |
| * | |
| * Redistribution and use in source and binary forms, with or without | |
| * modification, are permitted provided that the following conditions | |
| * are met: | |
| * | |
| * 1. Redistributions of source code must retain the above copyright | |
| * notice, this list of conditions and the following disclaimer. | |
| * | |
| * 2. Redistributions in binary form must reproduce the above copyright | |
| * notice, this list of conditions and the following disclaimer in | |
| * the documentation and/or other materials provided with the | |
| * distribution. | |
| * | |
| * This work was supported in part by funding from the Defense Advanced | |
| * Research Projects Agency and the National Science Foundation of the | |
| * United States of America, and the CMU Sphinx Speech Consortium. | |
| * | |
| * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND | |
| * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, | |
| * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | |
| * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY | |
| * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| * | |
| * ==================================================================== | |
| * | |
| */ | |
| /* | |
| * ms_mgau.c -- Essentially a wrapper that wrap up gauden and | |
| * senone. It supports multi-stream. | |
| * | |
| * | |
| * ********************************************** | |
| * CMU ARPA Speech Project | |
| * | |
| * Copyright (c) 1997 Carnegie Mellon University. | |
| * ALL RIGHTS RESERVED. | |
| * ********************************************** | |
| * HISTORY | |
| * $Log$ | |
| * Revision 1.2 2006/02/22 16:56:01 arthchan2003 | |
| * Merged from SPHINX3_5_2_RCI_IRII_BRANCH: Added ms_mgau.[ch] into the trunk. It is a wrapper of ms_gauden and ms_senone | |
| * | |
| * Revision 1.1.2.4 2005/09/25 18:55:19 arthchan2003 | |
| * Added a flag to turn on and off precomputation. | |
| * | |
| * Revision 1.1.2.3 2005/08/03 18:53:44 dhdfu | |
| * Add memory deallocation functions. Also move all the initialization | |
| * of ms_mgau_model_t into ms_mgau_init (duh!), which entails removing it | |
| * from decode_anytopo and friends. | |
| * | |
| * Revision 1.1.2.2 2005/08/02 21:05:38 arthchan2003 | |
| * 1, Added dist and mgau_active as intermediate variable for computation. 2, Added ms_cont_mgau_frame_eval, which is a multi stream version of GMM computation mainly s3.0 family of tools. 3, Fixed dox-doc. | |
| * | |
| * Revision 1.1.2.1 2005/07/20 19:37:09 arthchan2003 | |
| * Added a multi-stream cont_mgau (ms_mgau) which is a wrapper of both gauden and senone. Add ms_mgau_init and model_set_mllr. This allow eliminating 600 lines of code in decode_anytopo/align/allphone. | |
| * | |
| * | |
| * | |
| */ | |
| static ps_mgaufuncs_t ms_mgau_funcs = { | |
| "ms", | |
| ms_cont_mgau_frame_eval, /* frame_eval */ | |
| ms_mgau_mllr_transform, /* transform */ | |
| ms_mgau_free /* free */ | |
| }; | |
| ps_mgau_t * | |
| ms_mgau_init(acmod_t *acmod, logmath_t *lmath, bin_mdef_t *mdef) | |
| { | |
| /* Codebooks */ | |
| ms_mgau_model_t *msg; | |
| ps_mgau_t *mg; | |
| gauden_t *g; | |
| senone_t *s; | |
| cmd_ln_t *config; | |
| int i; | |
| config = acmod->config; | |
| msg = (ms_mgau_model_t *) ckd_calloc(1, sizeof(ms_mgau_model_t)); | |
| msg->config = config; | |
| msg->g = NULL; | |
| msg->s = NULL; | |
| if ((g = msg->g = gauden_init(ps_config_str(config, "mean"), | |
| ps_config_str(config, "var"), | |
| ps_config_float(config, "varfloor"), | |
| lmath)) == NULL) { | |
| E_ERROR("Failed to read means and variances\n"); | |
| goto error_out; | |
| } | |
| /* Verify n_feat and veclen, against acmod. */ | |
| if (g->n_feat != feat_dimension1(acmod->fcb)) { | |
| E_ERROR("Number of streams does not match: %d != %d\n", | |
| g->n_feat, feat_dimension1(acmod->fcb)); | |
| goto error_out; | |
| } | |
| for (i = 0; i < g->n_feat; ++i) { | |
| if ((uint32)g->featlen[i] != feat_dimension2(acmod->fcb, i)) { | |
| E_ERROR("Dimension of stream %d does not match: %d != %d\n", i, | |
| g->featlen[i], feat_dimension2(acmod->fcb, i)); | |
| goto error_out; | |
| } | |
| } | |
| s = msg->s = senone_init(msg->g, | |
| ps_config_str(config, "mixw"), | |
| ps_config_str(config, "senmgau"), | |
| ps_config_float(config, "mixwfloor"), | |
| lmath, mdef); | |
| s->aw = ps_config_int(config, "aw"); | |
| /* Verify senone parameters against gauden parameters */ | |
| if (s->n_feat != (uint32)g->n_feat) | |
| E_FATAL("#Feature mismatch: gauden= %d, senone= %d\n", g->n_feat, | |
| s->n_feat); | |
| if (s->n_cw != (uint32)g->n_density) | |
| E_FATAL("#Densities mismatch: gauden= %d, senone= %d\n", | |
| g->n_density, s->n_cw); | |
| if (s->n_gauden > (uint32)g->n_mgau) | |
| E_FATAL("Senones need more codebooks (%d) than present (%d)\n", | |
| s->n_gauden, g->n_mgau); | |
| if (s->n_gauden < (uint32)g->n_mgau) | |
| E_ERROR("Senones use fewer codebooks (%d) than present (%d)\n", | |
| s->n_gauden, g->n_mgau); | |
| msg->topn = ps_config_int(config, "topn"); | |
| E_INFO("The value of topn: %d\n", msg->topn); | |
| if (msg->topn == 0 || msg->topn > msg->g->n_density) { | |
| E_WARN | |
| ("-topn argument (%d) invalid or > #density codewords (%d); set to latter\n", | |
| msg->topn, msg->g->n_density); | |
| msg->topn = msg->g->n_density; | |
| } | |
| msg->dist = (gauden_dist_t ***) | |
| ckd_calloc_3d(g->n_mgau, g->n_feat, msg->topn, | |
| sizeof(gauden_dist_t)); | |
| msg->mgau_active = ckd_calloc(g->n_mgau, sizeof(int8)); | |
| mg = (ps_mgau_t *)msg; | |
| mg->vt = &ms_mgau_funcs; | |
| return mg; | |
| error_out: | |
| ms_mgau_free(ps_mgau_base(msg)); | |
| return NULL; | |
| } | |
| void | |
| ms_mgau_free(ps_mgau_t * mg) | |
| { | |
| ms_mgau_model_t *msg = (ms_mgau_model_t *)mg; | |
| if (msg == NULL) | |
| return; | |
| if (msg->g) | |
| gauden_free(msg->g); | |
| if (msg->s) | |
| senone_free(msg->s); | |
| if (msg->dist) | |
| ckd_free_3d((void *) msg->dist); | |
| if (msg->mgau_active) | |
| ckd_free(msg->mgau_active); | |
| ckd_free(msg); | |
| } | |
| int | |
| ms_mgau_mllr_transform(ps_mgau_t *s, | |
| ps_mllr_t *mllr) | |
| { | |
| ms_mgau_model_t *msg = (ms_mgau_model_t *)s; | |
| return gauden_mllr_transform(msg->g, mllr, msg->config); | |
| } | |
| int32 | |
| ms_cont_mgau_frame_eval(ps_mgau_t * mg, | |
| int16 *senscr, | |
| uint8 *senone_active, | |
| int32 n_senone_active, | |
| mfcc_t ** feat, | |
| int32 frame, | |
| int32 compallsen) | |
| { | |
| ms_mgau_model_t *msg = (ms_mgau_model_t *)mg; | |
| int32 gid; | |
| int32 topn; | |
| int32 best; | |
| gauden_t *g; | |
| senone_t *sen; | |
| (void)frame; | |
| topn = ms_mgau_topn(msg); | |
| g = ms_mgau_gauden(msg); | |
| sen = ms_mgau_senone(msg); | |
| if (compallsen) { | |
| int32 s; | |
| for (gid = 0; gid < g->n_mgau; gid++) | |
| gauden_dist(g, gid, topn, feat, msg->dist[gid]); | |
| best = MAX_INT32; | |
| for (s = 0; (uint32)s < sen->n_sen; s++) { | |
| senscr[s] = senone_eval(sen, s, msg->dist[sen->mgau[s]], topn); | |
| if (best > senscr[s]) { | |
| best = senscr[s]; | |
| } | |
| } | |
| /* Normalize senone scores */ | |
| for (s = 0; (uint32)s < sen->n_sen; s++) { | |
| int32 bs = senscr[s] - best; | |
| if (bs > 32767) | |
| bs = 32767; | |
| if (bs < -32768) | |
| bs = -32768; | |
| senscr[s] = bs; | |
| } | |
| } | |
| else { | |
| int32 i, n; | |
| /* Flag all active mixture-gaussian codebooks */ | |
| for (gid = 0; gid < g->n_mgau; gid++) | |
| msg->mgau_active[gid] = 0; | |
| n = 0; | |
| for (i = 0; i < n_senone_active; i++) { | |
| /* senone_active consists of deltas. */ | |
| int32 s = senone_active[i] + n; | |
| msg->mgau_active[sen->mgau[s]] = 1; | |
| n = s; | |
| } | |
| /* Compute topn gaussian density values (for active codebooks) */ | |
| for (gid = 0; gid < g->n_mgau; gid++) { | |
| if (msg->mgau_active[gid]) | |
| gauden_dist(g, gid, topn, feat, msg->dist[gid]); | |
| } | |
| best = MAX_INT32; | |
| n = 0; | |
| for (i = 0; i < n_senone_active; i++) { | |
| int32 s = senone_active[i] + n; | |
| senscr[s] = senone_eval(sen, s, msg->dist[sen->mgau[s]], topn); | |
| if (best > senscr[s]) { | |
| best = senscr[s]; | |
| } | |
| n = s; | |
| } | |
| /* Normalize senone scores */ | |
| n = 0; | |
| for (i = 0; i < n_senone_active; i++) { | |
| int32 s = senone_active[i] + n; | |
| int32 bs = senscr[s] - best; | |
| if (bs > 32767) | |
| bs = 32767; | |
| if (bs < -32768) | |
| bs = -32768; | |
| senscr[s] = bs; | |
| n = s; | |
| } | |
| } | |
| return 0; | |
| } | |