79 lines
3.9 KiB
C
79 lines
3.9 KiB
C
|
/*************************************************************************/
|
||
|
|
/* */
|
||
|
|
/* Language Technologies Institute */
|
||
|
|
/* Carnegie Mellon University */
|
||
|
|
/* Copyright (c) 1999 */
|
||
|
|
/* All Rights Reserved. */
|
||
|
|
/* */
|
||
|
|
/* Permission is hereby granted, free of charge, to use and distribute */
|
||
|
|
/* this software and its documentation without restriction, including */
|
||
|
|
/* without limitation the rights to use, copy, modify, merge, publish, */
|
||
|
|
/* distribute, sublicense, and/or sell copies of this work, and to */
|
||
|
|
/* permit persons to whom this work is furnished to do so, subject to */
|
||
|
|
/* the following conditions: */
|
||
|
|
/* 1. The code must retain the above copyright notice, this list of */
|
||
|
|
/* conditions and the following disclaimer. */
|
||
|
|
/* 2. Any modifications must be clearly marked as such. */
|
||
|
|
/* 3. Original authors' names are not deleted. */
|
||
|
|
/* 4. The authors' names are not used to endorse or promote products */
|
||
|
|
/* derived from this software without specific prior written */
|
||
|
|
/* permission. */
|
||
|
|
/* */
|
||
|
|
/* CARNEGIE MELLON UNIVERSITY AND THE CONTRIBUTORS TO THIS WORK */
|
||
|
|
/* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING */
|
||
|
|
/* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT */
|
||
|
|
/* SHALL CARNEGIE MELLON UNIVERSITY NOR THE CONTRIBUTORS BE LIABLE */
|
||
|
|
/* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES */
|
||
|
|
/* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN */
|
||
|
|
/* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, */
|
||
|
|
/* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF */
|
||
|
|
/* THIS SOFTWARE. */
|
||
|
|
/* */
|
||
|
|
/*************************************************************************/
|
||
|
|
/* Author: Alan W Black (awb@cs.cmu.edu) */
|
||
|
|
/* Date: December 1999 */
|
||
|
|
/*************************************************************************/
|
||
|
|
/* */
|
||
|
|
/* Letter to sound rules */
|
||
|
|
/* */
|
||
|
|
/*************************************************************************/
|
||
|
|
#ifndef _CST_LTS_H__
|
||
|
|
#define _CST_LTS_H__
|
||
|
|
|
||
|
|
#include "cst_val.h"
|
||
|
|
|
||
|
|
typedef unsigned short cst_lts_addr;
|
||
|
|
typedef int cst_lts_phone;
|
||
|
|
typedef unsigned char cst_lts_feat;
|
||
|
|
typedef unsigned char cst_lts_letter;
|
||
|
|
typedef unsigned char cst_lts_model;
|
||
|
|
|
||
|
|
/* end of rule value */
|
||
|
|
#define CST_LTS_EOR 255
|
||
|
|
|
||
|
|
typedef struct cst_lts_rules_struct {
|
||
|
|
char *name;
|
||
|
|
const cst_lts_addr *letter_index; /* index into model first state */
|
||
|
|
const cst_lts_model *models;
|
||
|
|
const char * const * phone_table;
|
||
|
|
int context_window_size;
|
||
|
|
int context_extra_feats;
|
||
|
|
const char * const * letter_table;
|
||
|
|
} cst_lts_rules;
|
||
|
|
|
||
|
|
/* Note this is designed to be 6 bytes */
|
||
|
|
typedef struct cst_lts_rule_struct {
|
||
|
|
cst_lts_feat feat;
|
||
|
|
cst_lts_letter val;
|
||
|
|
cst_lts_addr qtrue;
|
||
|
|
cst_lts_addr qfalse;
|
||
|
|
} cst_lts_rule;
|
||
|
|
|
||
|
|
cst_lts_rules *new_lts_rules();
|
||
|
|
|
||
|
|
cst_val *lts_apply(const char *word,const char *feats,const cst_lts_rules *r);
|
||
|
|
cst_val *lts_apply_val(const cst_val *wlist,const char *feats,const cst_lts_rules *r);
|
||
|
|
|
||
|
|
#endif
|
||
|
|
|