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 /* srch_time_switch_tree.h 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.3 2006/02/23 16:46:50 arthchan2003 00045 * Merged from branch SPHINX3_5_2_RCI_IRII_BRANCH: 00046 * 1, Used the corresponding lextree interface. 00047 * 2, 2nd-stage search logic are all commented. 00048 * 00049 * Revision 1.2.4.3 2006/01/16 20:14:02 arthchan2003 00050 * Remove the unlink silences part because that could affect the performance of the 1st pass search when -bestpath is specified. 00051 * 00052 * Revision 1.2.4.2 2005/07/07 02:38:35 arthchan2003 00053 * 1, Remove -lminsearch, 2 Remove rescoring interface in the header. 00054 * 00055 * Revision 1.2.4.1 2005/07/04 07:20:48 arthchan2003 00056 * 1, Ignored -lmsearch, 2, cleaned up memory, 3 added documentation of TST search. 00057 * 00058 * Revision 1.2 2005/06/22 02:45:52 arthchan2003 00059 * Log. Implementation of word-switching tree. Currently only work for a 00060 * very small test case and it's deliberately fend-off from users. Detail 00061 * omitted. 00062 * 00063 * Revision 1.8 2005/05/11 00:18:46 archan 00064 * Add comments on srch.h and srch_time_switch_tree.h and srch_debug.h on how things work. A very detail comment is added in srch.h to describe how generally srch_t is interacting with other parts of the code. 00065 * 00066 * 00067 * 17-Mar-2005 A. Chan (archan@cs.cmu.edu) at Carnegie Mellon University 00068 * Started. Time switching tree implementation. 00069 */ 00070 00071 00072 #ifndef _SRCH_TST_H_ 00073 #define _SRCH_TST_H_ 00074 00075 extern struct srch_funcs_s srch_TST_funcs; 00076 00077 #endif 00078 00079 00080 00081 00082 00083