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
|
/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ====================================================================
* Copyright (c) 1999-2007 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 ngram_model_dmp.h DMP format for N-Gram models
*
* Author: David Huggins-Daines <dhuggins@cs.cmu.edu>
*/
#ifndef __NGRAM_MODEL_DMP_H__
#define __NGRAM_MODEL_DMP_H__
#include "sphinxbase/mmio.h"
#include "ngram_model_internal.h"
#include "lm3g_model.h"
/**
* On-disk representation of bigrams.
*/
struct bigram_s {
uint16 wid; /**< Index of unigram entry for this. (NOT dictionary id.) */
uint16 prob2; /**< Index into array of actual bigram probs */
uint16 bo_wt2; /**< Index into array of actual bigram backoff wts */
uint16 trigrams; /**< Index of 1st entry in lm_t.trigrams[],
RELATIVE TO its segment base (see lm3g_model.h) */
};
/**
* On-disk representation of trigrams.
*
* As with bigrams, trigram prob info kept in a separate table for conserving
* memory space.
*/
struct trigram_s {
uint16 wid; /**< Index of unigram entry for this. (NOT dictionary id.) */
uint16 prob3; /**< Index into array of actual trigram probs */
};
/**
* Subclass of ngram_model for DMP file reading.
*/
typedef struct ngram_model_dmp_s {
ngram_model_t base; /**< Base ngram_model_t structure */
lm3g_model_t lm3g; /**< Common lm3g_model_t structure */
mmio_file_t *dump_mmap; /**< mmap() of dump file (or NULL if none) */
} ngram_model_dmp_t;
/**
* Construct a DMP format model from a generic base model.
*
* Note: If base is already a DMP format model, this just calls
* ngram_model_retain(), and any changes will also be made in the base
* model.
*/
ngram_model_dmp_t *ngram_model_dmp_build(ngram_model_t *base);
#endif /* __NGRAM_MODEL_DMP_H__ */
|
