SphinxBase 5prealpha
lm_trie_quant.h
1/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
2/* ====================================================================
3 * Copyright (c) 2015 Carnegie Mellon University. All rights
4 * reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 *
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 *
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
16 * distribution.
17 *
18 * This work was supported in part by funding from the Defense Advanced
19 * Research Projects Agency and the National Science Foundation of the
20 * United States of America, and the CMU Sphinx Speech Consortium.
21 *
22 * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND
23 * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
24 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
25 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
26 * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
27 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
28 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
32 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 *
34 * ====================================================================
35 *
36 */
37#ifndef __LM_TRIE_QUANT_H__
38#define __LM_TRIE_QUANT_H__
39
40#include <sphinxbase/bitarr.h>
41
42#include "ngrams_raw.h"
43
44typedef struct lm_trie_quant_s lm_trie_quant_t;
45
49lm_trie_quant_t *lm_trie_quant_create(int order);
50
54lm_trie_quant_t *lm_trie_quant_read_bin(FILE * fp, int order);
55
59void lm_trie_quant_write_bin(lm_trie_quant_t * quant, FILE * fp);
60
64void lm_trie_quant_free(lm_trie_quant_t * quant);
65
70uint8 lm_trie_quant_msize(lm_trie_quant_t * quant);
71
76uint8 lm_trie_quant_lsize(lm_trie_quant_t * quant);
77
81void lm_trie_quant_train(lm_trie_quant_t * quant, int order, uint32 counts,
82 ngram_raw_t * raw_ngrams);
83
87void lm_trie_quant_train_prob(lm_trie_quant_t * quant, int order,
88 uint32 counts, ngram_raw_t * raw_ngrams);
89
93void lm_trie_quant_mwrite(lm_trie_quant_t * quant,
94 bitarr_address_t address, int order_minus_2,
95 float prob, float backoff);
96
100void lm_trie_quant_lwrite(lm_trie_quant_t * quant,
101 bitarr_address_t address, float prob);
102
106float lm_trie_quant_mboread(lm_trie_quant_t * quant,
107 bitarr_address_t address, int order_minus_2);
108
112float lm_trie_quant_mpread(lm_trie_quant_t * quant,
113 bitarr_address_t address, int order_minus_2);
114
118float lm_trie_quant_lpread(lm_trie_quant_t * quant,
119 bitarr_address_t address);
120
121#endif /* __LM_TRIE_QUANT_H__ */
An implementation bit array - memory efficient storage for digit int and float data.
Structure that stores address of certain value in bit array.
Definition bitarr.h:73