/usr/include/sphinxtrain/quest.h is in sphinxtrain 1.0.8+5prealpha+1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 | /* ====================================================================
* Copyright (c) 1996-2000 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.
*
* ====================================================================
*
*/
/*********************************************************************
*
* File: quest.h
*
* Description:
* This file defines the data structures used to implement
* the state-tying decision tree questions.
*
* Author:
* Eric Thayer (eht@cs.cmu.edu)
*********************************************************************/
#ifndef QUEST_H
#define QUEST_H
#ifdef __cplusplus
extern "C" {
#endif
#if 0
}
#endif
#include <sphinxbase/prim_type.h>
#include <s3/acmod_set.h>
#include <stdio.h>
typedef struct pset_s {
char *name; /* name of the phone set (e.g. sonor, vowel, etc.) */
acmod_id_t *phone; /* list of member phones */
uint32 n_phone; /* cardinality of the set */
/*
* Exactly one of the following must be non-NULL for all questions
*/
uint32 *member; /* member[p] == TRUE if p is in the phone[] list */
uint32 *posn; /* posn[pn] == TRUE if position pn satisfies the query */
} pset_t;
/*
* Simple Question
*
* Simple questions are of the form:
* (context[-1] \isin SONOR)
* (context[1] \isin LIQUID)
* etc.
*
* where SONOR and LIQUID are phone sets derived,
* for instance, linguistically.
*/
typedef struct quest_s {
int32 ctxt; /* .
.
-2 => two phones to left
-1 => one phone to left
1 => one phone to right
2 => two phones to right
.
.
*/
uint32 neg; /* TRUE if question q is to be negated */
uint32 pset; /* phone set id (index into master list) */
/*
* Exactly one of the following must be non-NULL for all questions
*/
uint32 *member; /* member[phone] is true if phone is a
member of the phone class */
uint32 *posn; /* posn[pn] == TRUE if position pn satisfies the query */
} quest_t;
/*
* Compound question:
*
* Compound questions are boolean expressions in
* standard sum of products form (where + == OR and * == AND).
* where the boolean variables are instances of simple
* questions above.
*
* For some compound question Q, Q.conj_q[i] is the
* the ith term in the sum. Q.conj_q[i][j] is the
* jth simple question in the ith term of the
* product. The # of terms in each product is
* found by Q.prod_len[i] and the total # of terms
* in the sum is Q.sum_len.
*/
typedef struct comp_quest_s {
quest_t **conj_q;
uint32 *prod_len;
uint32 sum_len;
} comp_quest_t;
/*
* Public Fns
*/
int
s3parse_comp_quest(pset_t *pset,
uint32 n_pset,
comp_quest_t *q,
char *q_str);
void
parse_compound_q(comp_quest_t *q,
char *q_str);
char *
parse_conj(quest_t **term,
uint32 *n_simple_q,
char *q_str);
void
print_comp_quest(FILE *fp,
pset_t *pset,
comp_quest_t *q);
void
print_quest(FILE *fp,
pset_t *pset,
quest_t *q);
uint32
cnt_q_term(char *q_str);
int
eval_comp_quest(comp_quest_t *q,
uint32 *feat,
uint32 n_feat);
int
eval_quest(quest_t *q,
uint32 *feat,
uint32 n_feat);
/* simplify the conjunctions of
* a composite question by removing
* sets that are supersets of other terms
* in the conjunction.
*/
int
simplify_comp_quest(comp_quest_t *q,
uint32 n_phone);
/*
* Private Fns
*/
#if 0
static void
parse_simple_q(quest_t *q,
char *q_str);
#endif
#ifdef __cplusplus
}
#endif
#endif /* QUEST_H */
|