会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method of recognizing a sequence of words and device for carrying out
the method
    • 识别用于执行该方法的单词序列和装置的方法
    • US5946655A
    • 1999-08-31
    • US413051
    • 1995-03-29
    • Volker SteinbissBach-Hiep TranHermann Ney
    • Volker SteinbissBach-Hiep TranHermann Ney
    • G10L15/10G10L15/05G10L15/08G10L15/197G10L5/02
    • G10L15/197G10L15/05G10L15/08
    • When a language model is to be used for the recognition of a speech signal and the vocabulary is composed as a tree, the language model value cannot be taken into account before the word end. Customarily, after each word end the comparison with a tree root is started anew, be it with a score which has been increased by the language model value so that the threshold value for the scores at which hypotheses are terminated must be high and hence many, even unattractive hypotheses remain active for a prolonged period of time. In order to avoid this, in accordance with the invention a correction value is added to the score for at least a part of the nodes of the vocabulary tree; the sum of the correction values on the path to a word then may not be greater than the language model value for the relevant word. As a result, for each test signal the scores of all hypotheses are of a comparable order of magnitude. When a word end is reached, the sum of all added correction values is subtracted and the correct language model value is added.
    • 当语言模型被用于语音信号的识别并且词汇被组合成树时,语言模型值在单词结束之前不能被考虑。 通常情况下,在每个单词结束之后,重新开始与树根的比较,不管是具有通过语言模型值增加的分数,使得假设终止的分数的阈值必须很高,因此许多, 即使没有吸引力的假设仍然长时间保持活跃。 为了避免这种情况,根据本发明,对词汇树的至少一部分节点的分数添加校正值; 在一个字的路径上的校正值的和可能不会大于该相关词的语言模型值。 因此,对于每个测试信号,所有假设的分数具有可比的数量级。 当达到字结束时,减去所有添加的校正值的总和,并添加正确的语言模型值。
    • 2. 发明授权
    • Method of and apparatus for deriving a plurality of sequences of words
from a speech signal
    • 从语音信号中导出多个词序列的方法和装置
    • US5987409A
    • 1999-11-16
    • US938922
    • 1997-09-26
    • Bach-Hiep TranFrank SeideVolker Steinbiss
    • Bach-Hiep TranFrank SeideVolker Steinbiss
    • G10L15/08G10L15/18G10L7/08
    • G10L15/18G10L15/08
    • The determination of a plurality of sequences of words from a speech signal with a decreasing probability of correspondence utilizes the best word sequence as a basis and as further word sequences there are determined only those which enclose a part of the best word sequence, that is to say the remainder of these word sequences. To this end, the recognition involves first the formation of a word graph and the best word sequence is separately stored as a tree which initially has one branch only. The word boundaries of this word sequence form nodes in this tree. Because only nodes of this tree have to be taken into account for the next-best word sequences, the calculation is substantially simpler than if the complete word graph were first completely expanded in the form of a tree and completely searched again for each new word sequence.
    • 从具有降低的对应概率的语音信号中确定多个单词序列利用最佳单词序列作为基础,并且作为另外的单词序列,仅确定包含最佳单词序列的一部分的单词序列,即 说这些单词序列的其余部分。 为此,识别首先要形成一个单词图,最好的单词序列分别存储为最初只有一个分支的树。 该单词序列的单词边界形成该树中的节点。 因为只有这个树的节点必须考虑到下一个最好的单词序列,所以计算比如果完整的单词图形首先以树的形式完全展开并再次完全搜索每个新的单词序列简单得多 。