00001 /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */ 00002 /* ==================================================================== 00003 * Copyright (c) 1999-2004 Carnegie Mellon University. All rights 00004 * reserved. 00005 * 00006 * Redistribution and use in source and binary forms, with or without 00007 * modification, are permitted provided that the following conditions 00008 * are met: 00009 * 00010 * 1. Redistributions of source code must retain the above copyright 00011 * notice, this list of conditions and the following disclaimer. 00012 * 00013 * 2. Redistributions in binary form must reproduce the above copyright 00014 * notice, this list of conditions and the following disclaimer in 00015 * the documentation and/or other materials provided with the 00016 * distribution. 00017 * 00018 * This work was supported in part by funding from the Defense Advanced 00019 * Research Projects Agency and the National Science Foundation of the 00020 * United States of America, and the CMU Sphinx Speech Consortium. 00021 * 00022 * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND 00023 * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 00024 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00025 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY 00026 * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 00027 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 00028 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 00029 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 00030 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 00031 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 00032 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00033 * 00034 * ==================================================================== 00035 * 00036 */ 00037 00038 /* 00039 * HISTORY 00040 * $Log$ 00041 * Revision 1.1 2006/04/05 20:27:30 dhdfu 00042 * A Great Reorganzation of header files and executables 00043 * 00044 * Revision 1.2 2006/02/23 05:16:14 arthchan2003 00045 * Merged from branch SPHINX3_5_2_RCI_IRII_BRANCH: Add wrapper of flat_fwd.c 00046 * 00047 * Revision 1.1.2.5 2006/01/16 20:11:23 arthchan2003 00048 * Interfaces for 2nd stage search, now commented. 00049 * 00050 * Revision 1.1.2.4 2005/11/17 06:42:15 arthchan2003 00051 * Added back crossword triphone traversing timing for search. Also. for consistency with srch.c. Some dummy code of IBM lattice conversion was added. They are now bypassed because it is not fully function. 00052 * 00053 * Revision 1.1.2.3 2005/09/25 19:23:55 arthchan2003 00054 * 1, Added arguments for turning on/off LTS rules. 2, Added arguments for turning on/off composite triphones. 3, Moved dict2pid deallocation back to dict2pid. 4, Tidying up the clean up code. 00055 * 00056 * Revision 1.1.2.2 2005/09/18 01:45:19 arthchan2003 00057 * Filled in all implementation in srch_flat_fwd.[ch], like the FSG mode, it takes care of reporting itselft. 00058 * 00059 * Revision 1.1.2.1 2005/07/24 01:40:37 arthchan2003 00060 * (Incomplete) The implementation of flat-lexicon decoding. 00061 * 00062 * 00063 * 00064 */ 00065 00066 /* \file srch_flat_fwd.h 00067 * 00068 * SOME ASSUMPTIONS 00069 * - All phones (ciphones and triphones) have same HMM topology with n_state states. 00070 * - Initial state = state 0; final state = state n_state-1. 00071 * - Final state is a non-emitting state with no arcs out of it. 00072 * - Some form of Bakis topology (ie, no cycles, except for self-transitions). 00073 * 00074 */ 00075 00076 #ifndef SRCH_FLT_FWD 00077 #define SRCH_FLT_FWD 00078 00079 extern struct srch_funcs_s srch_FLAT_FWD_funcs; 00080 00081 #endif /* SRCH_FLT_FWD*/