File size: 3,940 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 | /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ====================================================================
* Copyright (c) 2014 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_detections.c -- Object for storing keyphrase search results
*/
#include "kws_detections.h"
void
kws_detections_reset(kws_detections_t *detections)
{
gnode_t *gn;
if (!detections->detect_list)
return;
for (gn = detections->detect_list; gn; gn = gnode_next(gn))
ckd_free(gnode_ptr(gn));
glist_free(detections->detect_list);
detections->detect_list = NULL;
}
void
kws_detections_add(kws_detections_t *detections, const char* keyphrase, int sf, int ef, int prob, int ascr)
{
gnode_t *gn;
kws_detection_t* detection;
for (gn = detections->detect_list; gn; gn = gnode_next(gn)) {
kws_detection_t *det = (kws_detection_t *)gnode_ptr(gn);
if (strcmp(keyphrase, det->keyphrase) == 0 && det->sf < ef && det->ef > sf) {
if (det->prob < prob) {
det->sf = sf;
det->ef = ef;
det->prob = prob;
det->ascr = ascr;
}
return;
}
}
/* Nothing found */
detection = (kws_detection_t *)ckd_calloc(1, sizeof(*detection));
detection->sf = sf;
detection->ef = ef;
detection->keyphrase = keyphrase;
detection->prob = prob;
detection->ascr = ascr;
detections->detect_list = glist_add_ptr(detections->detect_list, detection);
}
char *
kws_detections_hyp_str(kws_detections_t *detections, int frame, int delay)
{
gnode_t *gn;
char *c;
int len;
char *hyp_str;
len = 0;
for (gn = detections->detect_list; gn; gn = gnode_next(gn)) {
kws_detection_t *det = (kws_detection_t *)gnode_ptr(gn);
if (det->ef < frame - delay) {
len += strlen(det->keyphrase) + 1;
}
}
if (len == 0) {
return NULL;
}
hyp_str = (char *)ckd_calloc(len, sizeof(char));
c = hyp_str;
detections->detect_list = glist_reverse(detections->detect_list);
for (gn = detections->detect_list; gn; gn = gnode_next(gn)) {
kws_detection_t *det = (kws_detection_t *)gnode_ptr(gn);
if (det->ef < frame - delay) {
memcpy(c, det->keyphrase, strlen(det->keyphrase));
c += strlen(det->keyphrase);
*c = ' ';
c++;
}
}
if (c > hyp_str) {
c--;
*c = '\0';
}
detections->detect_list = glist_reverse(detections->detect_list);
return hyp_str;
}
|