专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US5875426A Recognizing speech having word liaisons by adding a phoneme to reference word models 失效
标题翻译：通过在参考词模型中添加一个音素来识别具有单词联络的语音
公开(公告)号：US5875426A
公开(公告)日：1999-02-23
申请号：US662407
申请日：1996-06-12
申请人： Lalit Rai Bahl , Steven Vincent De Gennaro , Peter Vincent deSouza , Edward Adam Epstein , Jean-Michel Le Roux , Burn Lewin Lewis , Claire Waast-Richard
发明人： Lalit Rai Bahl , Steven Vincent De Gennaro , Peter Vincent deSouza , Edward Adam Epstein , Jean-Michel Le Roux , Burn Lewin Lewis , Claire Waast-Richard
IPC分类号： G10L15/08 , G10L15/18 , G10L5/06
CPC分类号： G10L15/18 , G10L15/08 , G10L15/187
摘要： A method and system of recognizing speech. The method and system perform a fast match on a word in the string of speech to be recognized which generates a fast match list representing words in a system vocabulary that most likely match a current word to be recognized. Next, the method and system perform a detailed match on the words in the fast match list and generate a detailed match list representing words that most likely match the current word to be recognized. Then for each word in the detailed match list that can accept a liaison phoneme from a preceding word, where each word is a liaison receptor, adding to the detailed match list a form of the liaison receptor, where the form represents an addition of a liaison phoneme to the liaison receptor, creating a modified detailed match list which is inclusive of the forms of the liaison receptors added to the detailed match list. Finally the method and system outputs a word in the modified detailed match list that has the highest probability of matching the word to be recognized.
摘要翻译：识别语音的方法和系统。该方法和系统对要被识别的语音串中的单词执行快速匹配，其产生表示系统词汇表中最可能匹配要被识别的当前单词的单词的快速匹配列表。接下来，方法和系统对快速匹配列表中的单词进行详细匹配，并生成表示最可能匹配要识别的当前单词的单词的详细匹配列表。然后，对于可以接受来自前一单词的联络音素的详细匹配列表中的每个单词，其中每个单词是联络受体，在详细匹配列表中添加一种联络受体的形式，其中形式表示添加联络音素到联络受体，创建修改的详细匹配列表，其中包括添加到详细匹配列表中的联络受体的形式。最后，方法和系统输出修改后的详细匹配列表中匹配要识别字词的概率最高的单词。

2. 发明授权

US6058205A System and method for partitioning the feature space of a classifier in a pattern classification system 失效
公开(公告)号：US6058205A
公开(公告)日：2000-05-02
申请号：US781574
申请日：1997-01-09
申请人： Lalit Rai Bahl , Peter Vincent deSouza , David Nahamoo , Mukund Padmanabhan
发明人： Lalit Rai Bahl , Peter Vincent deSouza , David Nahamoo , Mukund Padmanabhan
IPC分类号： G06K9/62 , G06F17/20
CPC分类号： G06K9/6282
摘要： A system and method are provided which partition the feature space of a classifier by using hyperplanes to construct a binary decision tree or hierarchical data structure for obtaining the class probabilities for a particular feature vector. One objective in the construction of the decision tree is to minimize the average entropy of the empirical class distributions at each successive node or subset, such that the average entropy of the class distributions at the terminal nodes is minimized. First, a linear discriminant vector is computed that maximally separates the classes at any particular node. A threshold is then chosen that can be applied on the value of the projection onto the hyperplane such that all feature vectors that have a projection onto the hyperplane that is less than the threshold are assigned to a child node (say, left child node) and the feature vectors that have a projection greater than or equal to the threshold are assigned to a right child node. The above two steps are then repeated for each child node until the data at a node falls below a predetermined threshold and the node is classified as a terminal node (leaf of the decision tree). After all non-terminal nodes have been processed, the final step is to store a class distribution associated with each terminal node. The class probabilities for a particular feature vector can then be obtained by traversing the decision tree in a top-down fashion until a terminal node is identified which corresponds to the particular feature vector. The information provided by the decision tree is that, in computing the class probabilities for the particular feature vector, only the small number of classes associated with that particular terminal node need be considered. Alternatively, the required class probabilities can be obtained simply by taking the stored distribution of the terminal node associated with the particular feature vector.

3. 发明授权

US5995931A Method for modeling and recognizing speech including word liaisons 有权
标题翻译：用于建模和识别语音的方法，包括字词联络
公开(公告)号：US5995931A
公开(公告)日：1999-11-30
申请号：US253987
申请日：1999-02-22
申请人： Lalit Rai Bahl , Steven Vincent De Gennaro , Peter Vincent deSouza , Edward Adam Epstein , Jean-Michel Le Roux , Burn Lewin Lewis , Claire Waast-Richard
发明人： Lalit Rai Bahl , Steven Vincent De Gennaro , Peter Vincent deSouza , Edward Adam Epstein , Jean-Michel Le Roux , Burn Lewin Lewis , Claire Waast-Richard
IPC分类号： G10L15/08 , G10L15/18 , G10L7/08
CPC分类号： G10L15/18 , G10L15/08 , G10L15/187
摘要： A system and method for recognizing spoken liaisoned words. The method and system identify each word in the vocabulary as a liaison generator and/or liaison receptor. If the word is a liaison receptor, and if the word is preceded by a liaison generator, the most probable recognition result for the word will be the liaison generated by the preceding word plus the word. Liaisons are identified on an immediately preceding word in accordance with rules in a language. A word that ends with an unpronounced consonant phoneme, when followed by a word beginning with a consonant phoneme, and ends with a pronounced phoneme, when followed by a word with a vowel-like phoneme, causes a match list for the current word to be amended with words having liaisons added at their beginnings.
摘要翻译：用于识别口语的联系词的系统和方法。方法和系统将词汇表中的每个单词识别为联络发生器和/或联络受体。如果这个词是联络受体，如果这个词前面有一个联络发生器，这个词的最可能的识别结果将是前一个词加上这个词产生的联系。根据一种语言的规则，在紧接着前面的单词上确定联络人。一个以无声的辅音音素结尾的单词，当后跟一个以辅音音素开头的单词，并以一个明显的音素结尾，当跟一个含有元音的音素的单词时，会使当前单词的匹配列表为用起初添加了联络的单词进行修改。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式