Speech recognition of a list entry
First Claim
1. A method of generating a candidate list from a list of entries in accordance with a string of subword units corresponding to a speech input in a speech recognition system, the list of entries including plural list entries each comprising at least one fragment having one or more subword units, the method comprising:
- for each list entry, comparing fragments of the list entry with the string of subword units;
determining in the speech recognition system a matching score for each of the compared fragments based on the comparison, the matching score for a fragment being further based on a comparison of at least one other fragment of the same list entry with the string of subword units;
determining a total score for each list entry on the basis of the matching scores for the compared fragments of the respective list entry; and
generating the candidate list with the best matching entries from the list of entries based on the total scores of the list entries.
1 Assignment
0 Petitions
Accused Products
Abstract
The present invention relates to a method of generating a candidate list from a list of entries in accordance with a string of subword units corresponding to a speech input in a speech recognition system, the list of entries including plural list entries each comprising at least one fragment having one or more subword units. For each list entry, the fragments of the list entry are compared with the string of subword units. A matching score for each of the compared fragments based on the comparison is determined. The matching score for a fragment is further based on a comparison of at least one other fragment of the same list entry with the string of subword units. A total score for each list entry is determined based on the matching scores for the compared fragments of the respective list entry. A candidate list with the best matching entries from the list of entries based on the total scores of the list entries is generated.
-
Citations
55 Claims
-
1. A method of generating a candidate list from a list of entries in accordance with a string of subword units corresponding to a speech input in a speech recognition system, the list of entries including plural list entries each comprising at least one fragment having one or more subword units, the method comprising:
-
for each list entry, comparing fragments of the list entry with the string of subword units; determining in the speech recognition system a matching score for each of the compared fragments based on the comparison, the matching score for a fragment being further based on a comparison of at least one other fragment of the same list entry with the string of subword units; determining a total score for each list entry on the basis of the matching scores for the compared fragments of the respective list entry; and generating the candidate list with the best matching entries from the list of entries based on the total scores of the list entries. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method of generating a candidate list from a list of entries in accordance with a string of subword units corresponding to a speech input in a speech recognition system, the list of entries including plural list entries each comprising at least one fragment having one or more subword units, the method comprising:
-
comparing within the speech recognition system fragments of the list entries to the string of subword units within the speech recognition system; determining a matching score for each fragment on the basis of the comparison, the matching score indicating how well the fragment matches the string of subword units; determining a total score for each list entry based on the matching scores of the fragments of the respective list entry; and generating the candidate list with the best matching entries from the list of entries based on the total scores of the list entries wherein the comparing is performed for different context variants of a fragment, and wherein the matching score for a context variant of the fragment considers how well the context of the fragment corresponds to the context of a corresponding segment in the string of subword units. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. A method of selecting a list entry from a list of entries via speech input in a speech recognition system, the list of entries including plural list entries each comprising at least one fragment, the method comprising:
-
receiving a speech input; generating a string of subword units from the speech input; generating a candidate list comprising entries from the list of entries which are a preferred match for the string of subword units; and performing speech recognition in the speech recognition system on the speech input using the candidate list as a vocabulary, wherein for an entry of the candidate list, a probability for the entry matching the speech input is obtained; wherein the speech recognition step is configured so as to enable the recognition of any combination of fragments of a list entry for each list entry of the candidate list. - View Dependent Claims (21, 22, 23, 24, 25, 26, 27)
wherein the enrolment is performed so as to consider the grouping of the fragments in the list entries of the candidate list, and so as to enable the recognition of any combination of fragments within one list entry. -
22. The method according to claim 20, wherein the speech recognition is based on Hidden Markov Models assigned to fragments or to subword units of fragments of the list entries of the candidate list.
-
23. The method according to claim 20, further comprising:
-
enrolling the candidate list as a vocabulary for performing the speech recognition by; assigning a state sequence to each fragment of the candidate list; and for each candidate list entry, connecting the final state of the state sequence of each fragment of the list entry to the initial states of the state sequences of the other fragments of the same list entry.
-
-
24. The method according to claim 23, wherein a language model is considered for determining transition probabilities between connected state sequences, the language model considering at least probabilities for an occurrence of predetermined sequences of fragments in a spoken input.
-
25. The method according to claim 20, further comprising:
-
generating a shortened candidate list from the list of entries or the candidate list by; determining all possible permutations of predetermined fragments of a list entry for predetermined list entries of the list of entries or the candidate list; matching each determined permutation of the predetermined fragments against the string of subword units to obtain a matching score for each permutation; determining a total score for each predetermined list entry on the basis of the matching scores for the permutations determined for the list entry; and generating the shortened candidate list of best matching entries from the predetermined list entries based on the total scores of the list entries, wherein entries from the shortened candidate list are provided for being used in the vocabulary for the speech recognition.
-
-
26. The method according to claim 25, wherein the predetermined list entries for which the permutations are determined are the list entries from the list of entries or the candidate list having a number of fragments smaller than a predetermined threshold value.
-
27. The method according to claim 20, further comprising:
a second speech recognition step on the speech input, the second speech recognition step using a predetermined number of best matching entries from the result of first speech recognition step as a vocabulary.
-
-
28. A speech recognition system for selecting a list entry from a list of entries via speech input, the list of entries including plural list entries each comprising at least one fragment, the system comprising:
-
a database adapted to provide the list of entries; a recording unit for recording a speech input; a subword unit recognition unit adapted to generate a string of subword units from the speech input; a candidate list generation unit adapted to generate a candidate list comprising entries from the list of entries which are a preferred match for the string of subword units; and a speech recognition unit adapted to perform a speech recognition step on the speech input using the candidate list as a vocabulary, wherein for an entry of the candidate list, a probability for the entry matching the speech input is obtained; wherein the speech recognition unit is further configured so as to enable the recognition of any combination of fragments of a list entry for each list entry of the candidate list.
-
-
29. A computer program product having a computer readable storage medium with computer code thereon for generating a candidate list from a list of entries in accordance with a string of subword units corresponding to a speech input, the list of entries including plural list entries each comprising at least one fragment having one or more subword units, the computer code comprising:
-
computer code for comparing fragments for each list entry with the string of subword units; computer code for determining a matching score for each of the compared fragments based on the comparison, the matching score for a fragment being further based on a comparison of at least one other fragment of the same list entry with the string of subword units; computer code for determining a total score for each list entry on the basis of the matching scores for the compared fragments of the respective list entry; and computer code for generating the candidate list with the best matching entries from the list of entries based on the total scores of the list entries. - View Dependent Claims (30, 31, 32, 33, 34, 35, 36)
-
-
37. A computer program product having a computer readable storage medium with computer code thereon for generating a candidate list from a list of entries in accordance with a string of subword units corresponding to a speech input in a speech recognition system, the list of entries including plural list entries each comprising at least one fragment having one or more subword units, the computer code comprising:
-
computer code for comparing fragments of the list entries to the string of subword units; computer code for determining a matching score for each fragment on the basis of the comparison, the matching score indicating how well the fragment matches the string of subword units; computer code for determining a total score for each list entry based on the matching scores of the fragments of the respective list entry; and computer code for generating the candidate list with the best matching entries from the list of entries based on the total scores of the list entries wherein the computer code for comparing is performed for different context variants of a fragment, and wherein the matching score for a context variant of the fragment considers how well the context of the fragment corresponds to the context of a corresponding segment in the string of subword units. - View Dependent Claims (38, 39, 40, 41, 42, 43, 44, 45, 46, 47)
-
-
48. A computer program product including a computer readable storage medium having computer code thereon for selecting a list entry from a list of entries via speech input, the list of entries including plural list entries each comprising at least one fragment, the computer code comprising:
-
computer code for receiving a speech input; computer code for generating a string of subword units from the speech input; computer code for generating a candidate list comprising entries from the list of entries which are a preferred match for the string of subword units; and computer code for performing a speech recognition step on the speech input using the candidate list as a vocabulary, wherein for an entry of the candidate list, a probability for the entry matching the speech input is obtained; wherein the speech recognition step is configured so as to enable the recognition of any combination of fragments of a list entry for each list entry of the candidate list. - View Dependent Claims (49, 50, 51, 52, 53, 54, 55)
wherein entries from the shortened candidate list are provided for being used in the vocabulary for the speech recognition.
-
-
54. The computer program product according to claim 53, wherein the predetermined list entries for which the permutations are determined are the list entries from the list of entries or the candidate list having a number of fragments smaller than a predetermined threshold value.
-
55. The computer program product according to claim 48, further comprising:
computer code for a second speech recognition step on the speech input, the second speech recognition step using a predetermined number of best matching entries from the result of first speech recognition step as a vocabulary.
Specification