File size: 4,648 Bytes
5610573 | 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 | /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ====================================================================
* Copyright (c) 2013 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 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.
*
* ====================================================================
*
*/
/*
* kws_search.h -- Search structures for keyphrase spotting.
*/
#ifndef __KWS_SEARCH_H__
#define __KWS_SEARCH_H__
#include <pocketsphinx.h>
#include "util/glist.h"
#include "pocketsphinx_internal.h"
#include "kws_detections.h"
#include "hmm.h"
#ifdef __cplusplus
extern "C" {
#endif
#if 0
}
#endif
/**
* Segmentation "iterator" for KWS history.
*/
typedef struct kws_seg_s {
ps_seg_t base; /**< Base structure. */
kws_detection_t **detections; /**< Vector of current detections. */
frame_idx_t last_frame; /**< Last frame to raise the detection. */
int n_detections; /**< Size of vector. */
int pos; /**< Position of iterator. */
} kws_seg_t;
typedef struct kws_keyphrase_s {
char* word;
int32 threshold;
hmm_t* hmms;
int32 n_hmms;
} kws_keyphrase_t;
/**
* Implementation of KWS search structure.
*/
typedef struct kws_search_s {
ps_search_t base;
hmm_context_t *hmmctx; /**< HMM context. */
glist_t keyphrases; /**< Keyphrases to spot */
kws_detections_t *detections; /**< Keyword spotting history */
frame_idx_t frame; /**< Frame index */
int32 beam;
int32 plp; /**< Phone loop probability */
int32 bestscore; /**< For beam pruning */
int32 def_threshold; /**< default threshold for p(hyp)/p(altern) ratio */
int32 delay; /**< Delay to wait for best detection score */
int32 n_pl; /**< Number of CI phones */
hmm_t *pl_hmms; /**< Phone loop hmms - hmms of CI phones */
ptmr_t perf; /**< Performance counter */
int32 n_tot_frame;
} kws_search_t;
/**
* Create, initialize and return a search module. Gets keyphrases either
* from keyphrase or from a keyphrase file.
*/
ps_search_t *kws_search_init(const char *name,
const char *keyphrase,
const char *keyfile,
ps_config_t * config,
acmod_t * acmod,
dict_t * dict, dict2pid_t * d2p);
/**
* Deallocate search structure.
*/
void kws_search_free(ps_search_t * search);
/**
* Update KWS search module for new key phrase.
*/
int kws_search_reinit(ps_search_t * kwss, dict_t * dict, dict2pid_t * d2p);
/**
* Prepare the KWS search structure for beginning decoding of the next
* utterance.
*/
int kws_search_start(ps_search_t * search);
/**
* Step one frame forward through the Viterbi search.
*/
int kws_search_step(ps_search_t * search, int frame_idx);
/**
* Windup and clean the KWS search structure after utterance.
*/
int kws_search_finish(ps_search_t * search);
/**
* Get hypothesis string from the KWS search.
*/
char const *kws_search_hyp(ps_search_t * search, int32 * out_score);
/**
* Get active keyphrases
*/
char* kws_search_get_keyphrases(ps_search_t * search);
#ifdef __cplusplus
} /* extern "C" */
#endif
#endif /* __KWS_SEARCH_H__ */
|