RECURSIVE FINITE STATE GRAMMAR

专利名称：RECURSIVE FINITE STATE GRAMMAR 发明人：CHOW, Yen-Lu,LEE, Kai-Fu
申请号：US1993012598
申请日：19931228
公开号：WO94/016434P1
公开日：
19940721
专利内容由知识产权出版社提供
摘要：A method and means for performing speech recognition are described. The method and means include multiple finite state grammars. The multiple finite state grammars include at least one global finite state grammar and at least one sub-finite state grammar. Each of the multiple finite state grammars includes multiple states and at least one transition arranged in a network. The transitions in the network are capable of including either terminals or non-terminals. Each of the terminals is associated with an acoustic model, while each of the non-terminals is associated with a call to one of the sub-finite state grammars. The present invention also includes a recognition engine which performs the recognition by traveling through the global finite state grammar. As terminals are encountered, the recognition engine matches the acoustic model of the terminal to the speech signals. As non-terminals are encountered, the recognition engine calls the sub-finite state grammar associated with the non-terminal and continues performing recognition by traversing the sub-finite state grammar. In traversing the sub-finite state grammar, the recognition engine matches the acoustic model to the speech signals to continue with the recognition. Upon traversing the sub-finite state grammar, the recognition engine returns to and continues traversing the global finite state grammar at the location of the call. In this manner, the speech signals are matched
against the acoustic models in the global and sub-finite state grammars to generate textual output.
申请人：APPLE COMPUTER, INC.
地址：US
国籍：US
代理机构：SCHELLER, James, C.
更多信息请下载全文后查看。