Source: https://patents.google.com/patent/JP4734155B2/en
Timestamp: 2019-12-13 03:35:24
Document Index: 167298216

Matched Legal Cases: ['art 115', 'art 116', 'art 117', 'art 118', 'art 115', 'art 2216', 'art 117', 'art 118', 'art 2219']

JP4734155B2 - Speech recognition apparatus, speech recognition method, and speech recognition program - Google Patents
JP4734155B2
JP4734155B2 JP2006083762A JP2006083762A JP4734155B2 JP 4734155 B2 JP4734155 B2 JP 4734155B2 JP 2006083762 A JP2006083762 A JP 2006083762A JP 2006083762 A JP2006083762 A JP 2006083762A JP 4734155 B2 JP4734155 B2 JP 4734155B2
JP2006083762A
JP2007256836A (en
2006-03-24 Application filed by 株式会社東芝 filed Critical 株式会社東芝
2006-03-24 Priority to JP2006083762A priority Critical patent/JP4734155B2/en
2007-10-04 Publication of JP2007256836A publication Critical patent/JP2007256836A/en
2011-07-27 Publication of JP4734155B2 publication Critical patent/JP4734155B2/en
The present invention relates to a speech recognition device, a speech recognition method, and a speech recognition program that convert a speech signal into a character string as an input.
In recent years, human interfaces using voice input have been put into practical use. For example, a voice operation system in which a user can operate a system by voice by inputting a specific command set in advance by voice and recognizing this by the system and executing a corresponding operation. Is realized. In addition, a system that can create a document by voice input is realized by the system analyzing an arbitrary sentence generated by the user and converting it into a character string.
Furthermore, research and development to enable interaction between the robot and the user by voice input is also actively conducted, and it is attempted to perform operation instructions to the robot and access to various information via the robot by voice input. It has been.
In such a system, a voice recognition technique is used in which a voice signal uttered by a user is converted into digital data and compared with a predetermined pattern to recognize the utterance content.
In speech recognition, misrecognition may occur due to the influence of noise in the surrounding environment and differences in the user's voice quality, volume, speech rate, and the like. When a dialect is uttered, it becomes an unknown word unless the word corresponding to the dialect is registered in the word dictionary, and the dialect cannot be recognized correctly. Furthermore, features and probability values in standard patterns, word networks, language models, etc. are constructed in advance using speech data or text corpus, but misrecognition due to incompleteness of these data may also occur. . In addition, the correct recognition result is excluded from the candidates due to the restriction on the number of candidates provided for reducing the calculation load, and erroneous recognition may eventually occur, or misrecognition may occur due to the user's mistakes or rephrasing. It may occur.
As described above, in voice recognition, misrecognition may occur due to various causes. Therefore, the user needs to correct an error part to a correct character string by some means. As the most reliable and simple method for correcting an error, a method of correcting the error by using a keyboard or a pen device is conceivable. However, the feature of hands-free voice input is lost. Further, if the keyboard and pen device can be used easily, it is not preferable from the viewpoint of the user interface because it is sufficient to perform input using the keyboard and pen device instead of voice input from the beginning.
As another method for correcting the misrecognition, a method in which the user utters and corrects the voice having the same content again can be considered, but it is difficult to avoid the recurrence of the misrecognition simply by re-speaking the same content. In addition, when all long sentences are re-input, the burden on the user increases.
On the other hand, Patent Document 1 and Patent Document 2 propose a technique for correcting an error by uttering only a part of the voice corresponding to the erroneously recognized portion again. In this technique, the feature amount time-series data of the first voice input earlier is compared with the feature amount time-series data of the second sound that is the sound for correction. A part similar to the second sound is detected as a misrecognized part. Then, the character string corresponding to the misrecognized portion in the first voice is deleted from the recognition candidates for the second voice, and the most probable character string is selected, thereby realizing more accurate recognition.
JP 11-338493 A JP 2003-316386 A
However, the methods disclosed in Patent Document 1 and Patent Document 2 have a problem that erroneous recognition is likely to occur again when there are a large number of homonyms or words with similar pronunciation.
For example, in the case of Japanese, there are many homonyms, such as “lecture”, “park”, and “sponsored”, for reading “Kouen”. In addition, there are many words that are similar in pronunciation with homonyms, such as “1 o'clock”, “Kijo”, “One character”, “7 o'clock”, and “Seventh”. To do.
When there are a large number of homonyms and similar words, the conventional speech recognition technology cannot identify an appropriate word from a large number of homonyms and the like with high accuracy. It was difficult to recognize.
For this reason, the methods of Patent Literature 1 and Patent Literature 2 have a problem that the same voice must be uttered many times until a correct result is output, which may increase the burden of correction processing.
The present invention has been made in view of the above, and an object of the present invention is to provide a speech recognition device, a speech recognition method, and a speech recognition program capable of reducing the burden of correcting speech recognition errors with respect to input speech. .
In order to solve the above-described problems and achieve the object, the present invention provides a semantic relationship storage means for storing a semantic relationship between words and a degree of association representing the degree of the semantic relationship in association with each other, and voice input. Candidate generation for recognizing the speech received by the input receiving means, the speech received by the input receiving means, and generating a recognition candidate including a phoneme string candidate and a word candidate, and a likelihood indicating the likelihood of the recognition candidate And a first candidate that selects a recognition result of the first speech based on a likelihood of the first recognition candidate from first recognition candidates generated by the candidate generation unit for the first speech The second generated by the candidate generating means for the second sound including the selecting means, the word to be corrected included in the recognition result of the first sound , and the clue word that is the word serving as a clue for correction. Should be corrected from the recognition candidates A word recognition candidate for a word and a word recognition candidate for the clue word are extracted, and a semantic relationship between the extracted word recognition candidate for the word to be corrected and the word recognition candidate for the extracted clue word A second candidate selection unit that acquires the relevance level associated with the second speech selection unit from the semantic relationship storage unit, and selects a second speech recognition result based on the acquired relevance level; The phoneme sequence included in the recognition result is collated with the phoneme sequence included in the recognition candidate for the word to be corrected extracted by the second candidate selecting means, and the word to be corrected is selected from the first speech. a corrected portion identifying means for identifying corresponding parts, be corrected in a portion of the portion corresponding to the word to be the modified identified, including a word to be the modification of the recognition result of the second speech Characterized by comprising a correction means, a.
The present invention also provides a voice recognition method and a voice recognition program capable of executing the above-described apparatus.
According to the present invention, when correcting an error in a speech recognition result, speech recognition of a corrected utterance can be performed with reference to semantic constraint information added to a character string to be corrected. For this reason, there is an effect that the accuracy of voice recognition is improved and the error correction burden at the time of erroneous recognition can be reduced.
Exemplary embodiments of a speech recognition apparatus, a speech recognition method, and a speech recognition program according to the present invention will be explained below in detail with reference to the accompanying drawings.
The speech recognition apparatus according to the first embodiment is highly accurate with reference to semantic constraint information added to a character string to be corrected by the user, with the speech corrected by the user corrected for erroneous recognition of speech recognition. It is for voice recognition.
FIG. 1 is an explanatory diagram showing an external configuration of the speech recognition apparatus 100 according to the first embodiment. As shown in the figure, the speech recognition apparatus 100 has a main hardware configuration in which an error is detected in the speech input button 101a that the user presses when inputting speech and the character string of the speech recognition result. In addition, a corrected voice input button 101b pressed by the user to input a voice for correction, a microphone 102 that captures the voice uttered by the user as an electric signal, and a word string of a recognition result for the voice input by the user And a display unit 103 that displays a corresponding character string.
FIG. 2 is a block diagram illustrating a configuration of the speech recognition apparatus 100 according to the first embodiment. As shown in the figure, the speech recognition apparatus 100 includes a phoneme dictionary storage unit 121 in addition to the above-described speech input button 101a, modified speech input button 101b, microphone 102, and display unit 103 as main hardware configurations. A word dictionary storage unit 122, a history storage unit 123, a semantic relationship storage unit 124, and a language model storage unit 125.
In addition, the voice recognition apparatus 100 includes, as main software configurations, a button input reception unit 111, a voice input reception unit 112, a feature amount extraction unit 113, a candidate generation unit 114, a first candidate selection unit 115a, 2 candidate selection part 115b, the correction location specific | specification part 116, the correction part 117, and the output control part 118 are provided.
The phoneme dictionary storage unit 121 stores a phoneme dictionary storing a standard pattern of feature data of each phoneme held in advance. The phoneme dictionary is the same as the dictionary used in HMM (Hidden Markov Model) speech recognition processing that has been generally used conventionally, and is equivalent to feature amount time-series data output by a feature amount extraction unit 113 described later. The feature amount time series data that can be collated in the format is registered in association with each phoneme label as a standard pattern.
FIG. 3 is an explanatory diagram showing an example of the data structure of the phoneme dictionary stored in the phoneme dictionary storage unit 121. As shown in the figure, the phoneme dictionary expresses feature amount time-series data with a finite automaton composed of nodes and directed links.
The node represents a collation state. For example, the values i1, i2, and i3 of each node corresponding to the phoneme i represent different states. In addition, a feature quantity (not shown) that is a phoneme subelement is stored in association with the effective link.
The word dictionary storage unit 122 stores a word dictionary that stores word information to be collated with the input voice. The word dictionary is the same as the dictionary used in the speech recognition processing of the HMM method, and is used to obtain the corresponding word from the phoneme string obtained by collation based on the phoneme dictionary in which the phoneme string corresponding to each word is registered in advance. It is done.
FIG. 4 is an explanatory diagram showing an example of the data structure of the word dictionary stored in the word dictionary storage unit 122. As shown in the figure, the word dictionary stores a word, a phoneme string constituting the word, and a word appearance probability in association with each other.
The word appearance probability is used when the second candidate selection unit 115b described later specifies a recognition result for the utterance that has been corrected and input, and stores a value calculated in advance using a large amount of speech data or a text corpus. To do.
The history storage unit 123 stores various intermediate data output in the speech recognition process. As the intermediate data, there are a phoneme string candidate group representing a phoneme string candidate obtained by collation with the phoneme dictionary and a word string candidate group representing a word string candidate obtained by collation with the word dictionary.
FIG. 5 is an explanatory diagram showing an example of the data format of the phoneme string candidate group stored in the history storage unit 123. This figure shows a phoneme string candidate group expressed in a lattice structure. In the figure, H represents the leading node of the lattice structure, E represents the final node, and there is no corresponding phoneme or word.
In the figure, for example, for the first part of the utterance, a phoneme string pronounced as “ichiji” meaning 1 o'clock in Japanese and a phoneme pronounced as “shichiji” meaning 7 o'clock in Japanese. It is shown that the column is output as a candidate.
FIG. 6 is an explanatory diagram showing an example of the data format of the word string candidate group stored in the history storage unit 123. Similar to the phoneme string candidate group, the word string candidate group is represented by a lattice structure, H represents the leading node of the lattice structure, and E represents the final node.
In the figure, for example, for the first part of an utterance, a word that means 1 o'clock in Japanese and pronounced “ichiji”, and a word that means “one” in Japanese and pronounced “ichiji” in the same way It is shown that a word and a word pronounced “shichiji” meaning 7 o'clock in Japanese are output as candidates.
Although not shown in the phoneme string candidate group and the word string candidate group shown in FIGS. 5 and 6, the nodes corresponding to each phoneme and the nodes corresponding to each word are connected to the corresponding portion of the input speech. Are stored in association with each other. That is, each node is associated with a similarity that is a likelihood indicating the degree of likelihood of each node with respect to the input speech.
The semantic relationship storage unit 124 stores the semantic relationship between words in association with the degree of association representing the degree of association of the semantic relationship. The semantic relationship storage unit 124 uses a thesaurus that represents the conceptual relationship between words in a hierarchical structure. Can be expressed.
FIG. 7 is an explanatory diagram showing an example of a semantic relationship between words in a hierarchical structure. The figure shows an example in which the word “library director” is associated with “library”, “museum”, and the like as related words. Also, in the figure, an example is shown in which “position”, “master” and “captain” are in a semantic relationship of upper and lower concepts.
As shown in the figure, the degree of association (rel) is associated with each semantic relationship. In the present embodiment, rel takes a value between 0 and 1 and gives a large value when the degree of association is large.
The semantic relationship between words is not limited to this, and any relationship can be used as long as it is a semantic relationship between words conventionally expressed as a thesaurus such as synonyms and synonyms. In practice, the semantic relationship storage unit 124 stores the hierarchical structure of the semantic relationship in a tabular format.
FIG. 8 is an explanatory diagram showing another example of the semantic relationship between words in a hierarchical structure. In the figure, an example is shown in which “time”, “daytime”, “evening”, and “night” have a semantic relationship of upper and lower concepts. Further, in the figure, an example is shown in which “evening”, “4 o'clock”, “5 o'clock”, “6 o'clock”, “7 o'clock”, and the like are in a semantic relationship of upper and lower concepts.
The language model storage unit 125 stores a language model in which connection relations between words are associated with connection relation degrees indicating the degree of connection relations. The language model is the same as the model used in the HMM speech recognition process, and is referred to in order to obtain the most probable word string from the word string obtained as intermediate data.
FIG. 9 is an explanatory diagram showing an example of the data structure of the language model stored in the language model storage unit 125. In the figure, an example is shown in which a language model is represented by a bi-gram for a connection of two words, and the probability of two words appearing in succession is defined as the connection relevance.
As shown in the figure, the language model has a format in which two words (word 1 and word 2) are associated with an appearance probability. The appearance probability is created in advance by analyzing a large amount of text corpus. The language model is not limited to a bi-gram targeting two word concatenations, and a tri-gram targeting three word concatenations may be used as the language model.
The phoneme dictionary storage unit 121, the word dictionary storage unit 122, the history storage unit 123, the semantic relationship storage unit 124, and the language model storage unit 125 are an HDD (Hard Disk Drive), an optical disk, a memory card, and a RAM (Random Access Memory). ) Etc., and can be constituted by any commonly used storage medium.
The button input receiving unit 111 receives an operation event (an event such as pressing or releasing) of the two buttons of the voice input button 101a or the modified voice input button 101b, and thereby, among the voices received by the voice input receiving unit 112, a voice It accepts designation of the start position and end position of the speech to be recognized. Specifically, the button input receiving unit 111 receives a period during which the voice input button 101a and the modified voice input button 101b are pressed for a predetermined time or more as a target section for voice recognition. As a result, a so-called push talk type speech recognition process can be executed.
The voice input reception unit 112 receives voice input by the user through the microphone 102, converts the received voice into an electrical signal, and outputs the electrical signal to the feature amount extraction unit 113. Specifically, after taking in sound and converting it into an electrical signal, A / D (analog-digital) conversion is performed, and digital data converted in a PCM (pulse code modulation) format or the like is output. These processes can be realized by a method similar to the conventional digitization process for audio signals.
Hereinafter, the voice received by the voice input receiving unit 112 while the voice input button 101a is being pressed is referred to as a first voice. In addition, a voice that is input to correct the first voice and that is received by the voice input reception unit 112 while the corrected voice input button 101b is pressed is referred to as a second voice.
The feature amount extraction unit 113 receives the digital data output from the voice input reception unit 112 as an input, and uses acoustic techniques for discriminating phonemes constituting the voice by a technique such as frequency spectrum analysis based on FFT (Fast Fourier Transform). A feature amount representing a unique feature is extracted.
In this analysis method, a short time interval of a continuous speech waveform is cut out, a feature amount in the time interval targeted for analysis is extracted, and the time interval of analysis is shifted in order, thereby Time series data can be acquired. Note that the feature quantity extraction unit 113 can be realized by any method conventionally used in speech recognition technology, such as linear prediction analysis and cepstrum analysis, in addition to the above-described frequency spectrum analysis based on FFT.
The candidate generation unit 114 generates a phoneme string candidate group and a word string candidate group that are likely to be generated for the first voice or the second voice by using a phoneme dictionary or a word dictionary. Candidate generation processing by the candidate generation unit 114 can be realized by a method similar to the conventionally used HMM method voice recognition processing.
Specifically, the candidate generation unit 114 compares the feature amount time-series data extracted by the feature amount extraction unit 113 with the standard pattern stored in the phoneme dictionary, and is expressed in a node according to the corresponding directional link. To obtain phoneme candidates with high similarity.
Since the standard pattern registered in the phoneme dictionary and the speech input by the user are generally different, it is difficult to obtain a single phoneme, and it is generally determined in advance that the candidates are narrowed down in later processing. A phoneme having a higher degree of similarity is generated as a candidate within the determined number range.
In addition, as shown in Patent Document 2, the candidate generation unit 114 generates a candidate by deleting a word or character string at a location specified by the first voice from the recognition result of the second voice. You may comprise.
The first candidate selection unit 115a selects the most probable word sequence for the first speech from the word sequence candidate group output by the candidate generation unit 114 for the first speech. This processing can also be applied to the processing of HMM speech recognition technology that has been used conventionally. In the HMM method, the language model stored in the language model storage unit 125 is used to obtain the most probable word string.
As described above, two words (word 1 and word 2) are associated with the language model and the appearance probability, which is the probability of the two words appearing together. Therefore, the first candidate selection unit 115a extracts two words from the word string candidate group output by the candidate generation unit 114 for the first sound, and the word having the highest appearance probability associated with the two words. Can be selected as the most probable word.
The second candidate selection unit 115b selects the most probable word string for the input second voice from the word string candidate group output by the candidate generation unit 114 for the second voice. The word string selection process in the second candidate selection unit 115b can be a simple process for examining only the relation of adjacent phrases using a thesaurus. This is because a simple sentence is input in the sound for correction, and it is not necessary to assume a complicated dependency sentence. This process can be realized by adopting a Viterbi algorithm which is a kind of dynamic programming.
Specifically, the second candidate selection unit 115b acquires the semantic relationship between words included in the corrected utterance with reference to the semantic relationship storage unit 124, and selects the word set having the highest degree of relevance of the semantic relationship as Select as a probable word string. At this time, the second candidate selection unit 115b also considers the probability value of the language model stored in the language model storage unit 125, the similarity to the second speech, and the appearance probability of the word stored in the word dictionary storage unit 122. And select the most probable word string.
The correction location specifying unit 116 refers to the word sequence selected by the second candidate selection unit 115b and the first voice and the second voice stored in the history storage unit 123, and corrects the first voice. This is to identify the place to be. Specifically, the correction location specifying unit 116 first acquires a word existing in the gaze area among word string candidates for the second sound. The gaze area refers to the part where the word to be modified is present. For example, in Japanese, a compound word composed of the final word and multiple nouns is often the word to be modified. . Also, for example, in English, modifiers often follow prefixes with prepositions such as `` of '' and `` at '', so the part where the leading word or compound word exists is the gaze area. To do.
Then, the correction location specifying unit 116 acquires the second speech phoneme string candidate group corresponding to the gaze area from the history storage unit 123 and collates it with the first speech phoneme string candidate group, thereby Identify the parts of the audio that should be corrected.
The correction unit 117 corrects the partial word string of the correction part specified by the correction part specification unit 116. Specifically, the correcting unit 117 corrects the first sound by replacing a portion corresponding to the correction portion of the first sound with a character string corresponding to the gaze area of the second sound.
The correcting unit 117 may be configured to replace a portion corresponding to the corrected portion of the first voice with a character string corresponding to the entire second voice.
The output control unit 118 controls processing for displaying a character string, which is a recognition result of the first voice output by the first candidate selection unit 115a, on the display unit 103. Further, the output control unit 118 displays the character string resulting from the correction by the correction unit 117 on the display unit 103. Note that the output method of the output control unit 118 is not limited to the character string display on the display unit 103, and is conventionally used, such as outputting a voice synthesized voice of a character string to a speaker (not shown). Any method that can be applied.
Next, the speech recognition process by the speech recognition apparatus 100 according to the first embodiment configured as described above will be described. FIG. 10 is a flowchart showing the overall flow of the speech recognition processing in the first embodiment.
First, the button input receiving unit 111 receives an event of pressing the voice input button 101a or the corrected voice input button 101b (step S1001).
Next, the voice input receiving unit 112 receives a first voice input (step S1002). Subsequently, the feature amount extraction unit 113 extracts the feature amount of the first voice received by the voice input reception unit 112 (step S1003). At this time, the feature amount extraction unit 113 extracts the feature amount of the voice by a method such as frequency spectrum analysis as described above.
Next, the candidate generation unit 114 refers to the phoneme dictionary stored in the phoneme dictionary storage unit 121 and the word dictionary stored in the word dictionary storage unit 122, and the feature amount and dictionary standard extracted by the feature amount extraction unit 113. By collating with the pattern, a word string candidate for the first voice is generated (step S1004).
Next, the voice input receiving unit 112 determines whether or not the voice is input while the voice input button 101a is being pressed (step S1005). That is, the voice input reception unit 112 determines whether the input voice is the first voice or the second voice obtained by correcting the first voice.
When the voice is input while the voice input button 101a is being pressed (step S1005: YES), the first candidate selecting unit 115a refers to the language model and the most probable word string is recognized as the first voice recognition result. (Step S1006). Specifically, the first candidate selection unit 115a extracts two words from the word string candidate group, and a set of words having the highest appearance probability associated with the two words is stored in the language model storage unit 125. The language model is obtained by referring to the language model, and the obtained word set is selected as the most probable word.
Next, the output control unit 118 displays the selected word string on the display unit 103 (step S1007). The user checks the character string displayed on the display unit 103, and inputs the second voice while pressing the corrected voice input button 101b in order to correct the first voice if correction is necessary. The input second voice is received by the voice input receiving unit 112, and word string candidates are generated (steps S1001 to S1004).
In this case, since it is determined in step S1005 that the voice is not input while the voice input button 101a is pressed (step S1005: NO), the second candidate selection unit 115b generates a word string generated by the candidate generation unit 114. A correction candidate selection process for selecting the most probable word string from the candidates is executed (step S1008). Details of the correction candidate selection process will be described later.
Next, the correction location specifying unit 116 executes a correction location specifying process for specifying a portion to be corrected with the second voice in the first voice (step S1009). Details of the correction location specifying process will be described later.
Next, the correcting unit 117 executes correction of the correction part specified by the correction part specifying process (step S1010). Subsequently, the output control unit 118 displays the corrected word string on the display unit 103 (step S1011), and ends the voice recognition process.
Next, details of the correction candidate selection process in step S1008 will be described. FIG. 11 is a flowchart showing the overall flow of the correction candidate selection process. This figure is a diagram showing a flow of processing for selecting word string candidates using the Viterbi algorithm as described above.
First, the second candidate selection unit 115b initializes a word position pointer and an integration priority (hereinafter referred to as IP) (step S1101).
The word position pointer is information representing the node position of the lattice structure as shown in FIG. 6, and here, the pointer position is initialized to the first node. The integration priority is an integration value of the priority calculated for selecting the most probable word string. Here, the integration priority is initialized to 1.
Next, the second candidate selection unit 115b acquires the word immediately before the pointer position (step S1102). When the number of word candidates at the pointer position is j, the acquired words are represented as We1, We2,... Wej (j is an integer).
Next, the second candidate selection unit 115b acquires the word at the pointer position (step S1103). If the number of word candidates at the pointer position is i, the acquired words are represented as Ws1, Ws2,..., Wsi (i is an integer).
Next, the second candidate selection unit 115b selects one set of Wej and Wsi (step S1104), and repeats the processing from step S1105 to step S1108.
First, the second candidate selection unit 115b calculates a semantic relation connection likelihood (hereinafter referred to as Sim (Wsi, Wej)) between Wej and Wsi (step S1105). Here, the semantic relational concatenation likelihood is a value representing the degree of association between the nearest independent word before Wej (hereinafter referred to as pre k (Wej)) and Wsi, and the following equation (1) Is calculated by
Sim (Wsi, Wej) = argmax k (rel (Wsi, pre k (Wej))) (1)
Here, argmax () means a function for obtaining the maximum value in the parentheses, and rel (X, Y) represents the degree of association of the semantic relationship between the word X and the word Y. Whether a word is an independent word is determined by applying a morphological analysis technique that has been used in the past and referring to an analysis dictionary (not shown).
Next, the second candidate selection unit 115b calculates the connection priority (hereinafter referred to as CP) between Wej and Wsi (step S1106). Here, the connection priority refers to a weighted geometric mean between the probability value of the language model of Wej and Wsi (hereinafter referred to as P (Wsi | Wej)) and the semantic relation connection likelihood Sim. Calculated by equation (2).
CP = P (Wsi | Wej) λ × Sim (Wsi, Wej) λ −1 (λ is 0 or more and 1 or less) (2)
Next, the second candidate selection unit 115b calculates the word priority of Wsi (hereinafter referred to as WP) (step S1107). Here, word priority refers to a weighted geometric mean of similarity to speech (hereinafter referred to as SS (Wsi)) and appearance probability of Wsi (hereinafter referred to as AP (Wsi)). It is calculated by equation (3).
WP = SS (Wsi) μ × AP (Wsi) μ −1 (μ is 0 or more and 1 or less) (3)
Next, the second candidate selection unit 115b calculates a product (hereinafter referred to as TPji) of the respective priorities (IP, AP, WP) as shown in the following equation (4) (step S1108).
TPji = IP × AP × WP (4)
Next, the second candidate selection unit 115b determines whether or not all the sets have been processed (step S1109). If all the sets have not been processed (step S1109: NO), another set is selected. Then, the process is repeated (step S1104).
When all the sets have been processed (step S1109: YES), the second candidate selection unit 115b substitutes the maximum value among the calculated products TPji for the integration priority IP, and selects the corresponding link between Wej and Wsi. (Step S1110).
If the nearest independent word exists before Wej, the link to the independent word whose relevance rel (Wsi, pre k (Wej) with Wsi is the largest is selected.
Next, the second candidate selection unit 115b advances the pointer position to the next word (step S1111), and determines whether the pointer position has reached the end of the sentence (step S1112).
If the end of the sentence has not been reached (step S1112: NO), the second candidate selection unit 115b repeats the process at the pointer position (step S1102).
When the end of the sentence has been reached (step S1112: YES), the second candidate selection unit 115b selects a word string on the path that follows the selected link as the most likely correction word string (step S1113), and correction candidate selection processing Exit.
Next, details of the correction location specifying process in step S1009 will be described. FIG. 12 is a flowchart illustrating an overall flow of the correction location specifying process according to the first embodiment.
First, the correction location specifying unit 116 acquires a phoneme string of the second speech corresponding to the gaze area from the phoneme string candidates (step S1201). A set of acquired phoneme strings is defined as {Si}.
Next, the correction location specifying unit 116 acquires the first phoneme string from the history storage unit 123 (step S1202). Subsequently, the correction location specifying unit 116 detects a location most similar to the phoneme sequence belonging to the phoneme sequence set {Si} from the acquired phoneme sequence of the first speech, and specifies the location as the correction location (step S1203). ).
Next, a specific example of speech recognition processing in the present embodiment will be described. FIG. 13 is an explanatory diagram illustrating an example of a first speech recognition result. FIG. 14 is an explanatory diagram showing an example of a phoneme string candidate group for the second speech, and FIG. 15 is an explanatory diagram showing an example of a word sequence candidate group for the second speech.
In FIG. 13, the user speaks the first voice in Japanese meaning “Please make a reservation at 7 o'clock”, and the recognition result meaning “Please make a reservation at 1 o'clock” is selected by mistake. An example is shown.
On the other hand, it is assumed that the user utters a Japanese voice meaning “7 o'clock in the evening” as the second voice for correction. In this case, phoneme string candidates and word string candidate groups as shown in FIGS. 14 and 15 are obtained.
Here, when tri-gram can be adopted as a language model, it means Japanese meaning “7 o'clock in the evening” and includes three words: a word 1501 (evening), a word 1504 (no), and a word 1507 (7 o'clock). It can be expected that a high appearance probability is associated with Japanese words connected with words. A word 1502 meaning “yukata” or a word 1503 meaning “Yukatan” of the place name is a word 1505 meaning “1 o'clock”, a word 1506 meaning “one letter”, or a word meaning “7 o'clock” This is because the probability of being used together with 1507 is considered to be low.
Therefore, when tri-gram can be adopted as the language model, an appropriate word string candidate can be selected using the probability value of the language model as in the past.
However, the tri-gram has a large number of combinations, and there is a problem that a large amount of text data is required for constructing a language model, and a problem that the data size of the language model increases. For this reason, a bi-gram that is a concatenation of two words may be employed as a language model. In this case, an appropriate word string cannot be narrowed down from the word string candidate group shown in FIG.
On the other hand, in the method of the present embodiment, as described above, the upper-lower relationship, the partial overall relationship, the synonym relationship, the related word relationship between the independent word that appears before the arbitrary word and the arbitrary word. An appropriate word string can be selected using a thesaurus that expresses a semantic relationship existing between a plurality of words.
FIG. 16 is an explanatory diagram illustrating an example of a recognition result of the second voice selected by the second candidate selection unit 115b through such processing.
As shown in the figure, after selecting the recognition result of the second voice, the correction location specifying process by the correction location specifying unit 116 is executed (step S1009).
FIG. 17 is an explanatory diagram schematically showing an outline of the correction location specifying process. The upper part of the figure represents a word string and a phoneme string corresponding to the first voice, and the lower part of the figure represents a modified word string and a phoneme string candidate corresponding to the second voice. In this figure, the link information in the word string is omitted for easy understanding, but the word string and the modified word string have the same structure as the contents shown in FIGS. The phoneme string and the phoneme string candidate group have the same structure as that shown in FIG.
In FIG. 17, “shichiji” and “ichiji” are acquired as phoneme string candidates for the second speech corresponding to the gaze area (step S1201). By comparing the acquired phoneme sequence candidate with the phoneme sequence “ichiji-de-yoyaku-wo-onegai-shi-masu” corresponding to the first speech, it can be detected that the phoneme sequence candidate matches the location of “ichiji”. . Thereby, it can be specified that the corresponding word 1701 (1 o'clock) is a portion to be corrected (step S1203).
Thereafter, correction processing by the correction unit 117 is executed (step S1010). For the first voice, Japanese meaning “Please make a reservation at 1 o'clock” was mistakenly selected as the recognition result (FIG. 13). On the other hand, as shown in FIG. 17, the word meaning “1 o'clock” of the correction location specified by the correction location specifying unit 116 exists in the gaze area of the correction word string meaning “7 o'clock in the evening”. By replacing with a word meaning “7 o'clock”, a correct word string meaning “Please make a reservation at 7 o'clock” can be obtained.
In this example, only the gaze area is replaced. However, the corrected portion specified by the corrected portion specifying unit 116 may be replaced with the entire corrected word string. That is, in this case, the word meaning “1 o'clock” in the correction place is replaced with a correction word string meaning “7 o'clock in the evening”, and a word string meaning “please make a reservation at 7 o'clock in the evening” Can be obtained.
Next, another specific example of the speech recognition process in the present embodiment will be described. 18 and 19 are explanatory diagrams showing examples of input data, intermediate data, and output data handled in the speech recognition processing.
FIG. 18 shows an example in which the user inputs Japanese 1801 meaning “I want to meet the director” and the recognition result 1802 is output. In this example, it is shown that the word 1811 meaning “master” is mistakenly recognized as the word 1812 meaning “captain”.
On the other hand, when the user inputs Japanese 1803 meaning “the director of this museum”, the word of the misrecognized portion is correctly corrected, and a correction result 1804 is output.
FIG. 19 shows an example in which the user inputs English 1901 meaning “The brake was broken” and the recognition result 1902 is output. In this example, it is shown that the word 1911 meaning “brake” is erroneously recognized as the word 1912 meaning “break”.
On the other hand, when the user inputs English 1903 meaning “This car's brake”, the word of the misrecognized portion is correctly corrected, and a correction result 1904 is output.
Next, a modification of the present embodiment will be described. In the above description, an example has been described in which an upper / lower relationship, a partial overall relationship, a synonym relationship, or a related word relationship is used as the semantic relationship. In addition, you may comprise so that the information (co-occurrence information) of the co-occurrence relationship between words may be utilized. The co-occurrence information is information obtained by quantifying the degree of possibility (hereinafter referred to as co-occurrence probability) of a set of words that are likely to be used together.
For example, a word meaning “delicious” and a word meaning “coffee”, or a word meaning “hot” and a word meaning “coffee” are often used together. Is expensive. On the other hand, the word meaning “hot” and the word meaning “coffee” are considered to be rarely used together, and therefore the co-occurrence probability is low.
FIG. 20 is an explanatory diagram showing an example of a semantic relationship between words using co-occurrence information. The figure shows an example in which the co-occurrence probability between the word 1 meaning “delicious” and the word 2 meaning “coffee” is 0.7, which is larger than the co-occurrence probability between other words.
The co-occurrence information as shown in the figure is acquired by analyzing a large amount of text data in advance and stored in the semantic relationship storage unit 124. The co-occurrence information obtained in this way can be used instead of the relevance rel when the second candidate selection unit 115b selects a candidate for the second speech.
As described above, the speech recognition apparatus according to the first embodiment refers to semantic constraint information in which speech corrected by the user for speech recognition misrecognition is added to a character string to be corrected by the user. Voice recognition. For this reason, even when a word having a large number of homonyms or words having similar reading is corrected and input, the word can be correctly identified with reference to the semantic information, so that the accuracy of voice recognition is improved. . Thereby, it is possible to reduce an error correction burden at the time of erroneous recognition.
The speech recognition apparatus according to the second embodiment specifies a location to be corrected using a pointing device such as a pen, and performs correction processing when an erroneous recognition occurs.
FIG. 21 is an explanatory diagram showing an external configuration of the speech recognition apparatus 2100 according to the second embodiment. As shown in the figure, the speech recognition apparatus 2100 includes, as main hardware configurations, a pointing device 2204 and a display unit 2203 that displays a character string corresponding to a word string of a recognition result for speech input by the user. I have.
The pointing device 2204 is a device for pointing a character string or the like displayed on the display unit 2203. The microphone 102 captures a voice uttered by the user as an electric signal, and a voice input button that the user presses when inputting the voice. 101a.
The display portion 2203 further has a function of receiving an operation input of the pointing device 2204 by a touch panel method. In addition, markings such as an underline 2110 are displayed in the portion designated as the error location as shown in FIG.
The second embodiment is different from the first embodiment in that the modified voice input button 101b is not provided. In the second embodiment, since it is possible to determine that the voice immediately after the erroneous part is instructed by the pointing device 2204 is the second voice, it is sufficient to provide only one button for instructing voice input. That's why.
Note that voice data input from the microphone 102 provided in the pointing device 2204 is transmitted to the voice recognition apparatus 2100 using a wireless communication function or the like (not shown).
FIG. 22 is a block diagram illustrating a configuration of a speech recognition apparatus 2100 according to the second embodiment. As shown in the figure, the speech recognition apparatus 2100 includes a speech input button 101a, a microphone 102, a display unit 2203, a pointing device 2204, a phoneme dictionary storage unit 121, and a word dictionary as main hardware configurations. A storage unit 122, a history storage unit 123, a semantic relationship storage unit 124, and a language model storage unit 125 are provided.
The voice recognition device 2100 includes, as main software configurations, a button input reception unit 111, a voice input reception unit 112, a feature amount extraction unit 113, a candidate generation unit 114, a first candidate selection unit 115a, 2 candidate selection part 115b, the correction location specific | specification part 2216, the correction part 117, the output control part 118, and the panel input reception part 2219 are provided.
In the software configuration of the second embodiment, the addition of the panel input receiving unit 2219 and the function of the correction location specifying unit 2216 are different from those of the first embodiment. Other configurations and functions are the same as those in FIG. 2, which is a block diagram illustrating the configuration of the speech recognition apparatus 100 according to the first embodiment, and thus are denoted by the same reference numerals and description thereof is omitted here.
The panel input accepting unit 2219 accepts designation of an error location designated by the pointing device 2204 on the display unit 2203.
The correction location specifying unit 2216 specifies a location to be corrected in the first voice from a character string in the vicinity of a portion (correction instruction location) specified by the user with the pointing device 2204. Here, the vicinity of the correction instruction location means a predetermined range of at least one before or after the correction instruction location.
In the second embodiment, the correction location specifying unit 116 in the first embodiment collates with the second voice for all parts of the first voice and specifies the correction location. Then, referring to the designation by the pointing device 2204, the correction location is specified within the minimum necessary range. Therefore, the processing speed and search accuracy can be improved.
Next, speech recognition processing by the speech recognition apparatus 2100 according to the second embodiment configured as described above will be described. FIG. 23 is a flowchart showing an overall flow of the speech recognition processing in the second embodiment.
First, the panel input receiving unit 2219 receives an input for specifying a correction location by the pointing device 2204 (step S2301). Only when the second sound for correction is input, the panel input receiving unit 2219 receives an input for specifying the correction portion.
Next, the button input receiving unit 111 receives an event of pressing the voice input button 101a (step S2302).
The first voice reception / recognition process and the recognition result output process from step S2303 to step S2305 are the same as the process from step S1002 to step S1004 in the voice recognition apparatus 100 according to the first embodiment. Omitted.
In step S2305, after the candidate generation unit 114 generates a word string candidate, the voice input reception unit 112 determines whether or not the input is after specifying the correction location (step S2306). Thereby, the voice input reception unit 112 determines whether the voice is the first voice or the second voice. That is, the voice input reception unit 112 determines that the voice is input by pressing the voice input button 101a after the correction portion is specified by the pointing device 2204, and is determined to be the second voice. Otherwise, the first voice is used. Judge that there is.
The first candidate selection process, the output control process, and the second candidate selection process from step S2307 to step S2309 are the same as the processes from step S1006 to step S1008 in the speech recognition apparatus 100 according to the first embodiment. The description is omitted.
In step S2309, after selecting the recognition result of the second voice, the corrected part specifying unit 2216 executes a corrected part specifying process (step S2310). Details of the correction location specifying process will be described later.
The correction process and the recognition result output process from step S2311 to step S2312 are the same as the process from step S1010 to step S1011 in the speech recognition apparatus 100 according to the first embodiment, and thus description thereof is omitted.
Next, details of the correction location specifying process in step S2310 will be described. FIG. 24 is a flowchart illustrating an overall flow of the correction location specifying process according to the second embodiment.
The phoneme string acquisition process in step S2401 is the same process as step S1201 in the speech recognition apparatus 100 according to the first embodiment, and thus the description thereof is omitted.
After acquiring the second phoneme sequence corresponding to the gaze area from the phoneme sequence candidates in step S2401, the correction location specifying unit 2216 reads from the history storage unit 123 the correction instruction location and the phonetic sequence of the first speech. A phoneme string corresponding to the vicinity is acquired (step S2402).
In the example illustrated in FIG. 21, a phoneme string corresponding to the word 2111 that is a word existing at the correction instruction location indicated by the underline 2110 and that means “1 o'clock” is acquired. Also, a phoneme string corresponding to the word 2112 existing in the vicinity of the correction instruction location is acquired.
Since the similar part detection process of step S2403 is the same process as step S1203 in the speech recognition apparatus 100 according to the first embodiment, the description thereof is omitted.
As described above, in the speech recognition apparatus according to the second embodiment, it is possible to specify a part to be corrected by using a pointing device such as a pen, and specify the correction part from within the vicinity of the part. The correction process at the time of occurrence of erroneous recognition can be performed with respect to the portion that has been performed. For this reason, correct | amendment of speech misrecognition can be performed reliably, without increasing a user's burden.
FIG. 25 is an explanatory diagram of a hardware configuration of the speech recognition apparatus according to the first and second embodiments.
The speech recognition apparatuses according to the first and second embodiments communicate with a control device such as a CPU (Central Processing Unit) 51 and a storage device such as a ROM (Read Only Memory) 52 and a RAM 53 connected to a network. A communication I / F 54 for performing the above and a bus 61 for connecting each part.
The speech recognition program executed by the speech recognition apparatus according to the first and second embodiments is provided by being incorporated in advance in the ROM 52 or the like.
A speech recognition program executed by the speech recognition apparatus according to the first and second embodiments is an installable format or executable format file, which is a CD-ROM (Compact Disk Read Only Memory), a flexible disk (FD). ), A CD-R (Compact Disk Recordable), a DVD (Digital Versatile Disk), or other computer-readable recording media.
Further, the speech recognition program executed by the speech recognition apparatus according to the first and second embodiments is provided by being stored on a computer connected to a network such as the Internet and downloaded via the network. It may be configured. The voice recognition program executed by the voice recognition apparatus according to the first and second embodiments may be provided or distributed via a network such as the Internet.
The speech recognition program executed by the speech recognition apparatus according to the first and second embodiments includes the above-described units (panel input reception unit, button input reception unit, voice input reception unit, feature amount extraction unit, candidate generation unit). , A first candidate selection unit, a second candidate selection unit, a correction location specifying unit, a correction unit, and an output control unit), and the CPU 51 reads the voice recognition program from the ROM 52 as actual hardware. As a result, the above-described units are loaded on the main storage device, and the respective units are generated on the main storage device.
As described above, the speech recognition apparatus, speech recognition method, and speech recognition program according to the present invention are suitable for speech translation systems, car navigation systems, home appliance control systems, and the like that operate according to the results of speech recognition of input speech. ing.
It is explanatory drawing which shows the external appearance structure of the speech recognition apparatus concerning 1st Embodiment. It is a block diagram which shows the structure of the speech recognition apparatus concerning 1st Embodiment. It is explanatory drawing which shows an example of the data structure of the phoneme dictionary memorize | stored in the phoneme dictionary memory | storage part. It is explanatory drawing which shows an example of the data structure of the word dictionary memorize | stored in the word dictionary memory | storage part. It is explanatory drawing which shows an example of the data format of the phoneme string candidate group memorize | stored in the log | history memory | storage part. It is explanatory drawing which shows an example of the data format of the word string candidate group memorize | stored in the log | history memory | storage part. It is explanatory drawing showing an example of the semantic relationship between words by the hierarchical structure. It is explanatory drawing which represented another example of the semantic relationship between words by hierarchical structure. It is explanatory drawing which shows an example of the data structure of the language model memorize | stored in the language model memory | storage part. It is a flowchart which shows the whole flow of the speech recognition process in 1st Embodiment. It is a flowchart which shows the whole flow of a correction candidate selection process. It is a flowchart which shows the whole flow of the correction location specific process in 1st Embodiment. It is explanatory drawing which shows the example of the recognition result of the 1st audio | voice. It is explanatory drawing which showed an example of the phoneme string candidate group with respect to a 2nd audio | voice. It is explanatory drawing which showed an example of the word sequence candidate group with respect to a 2nd audio | voice. It is explanatory drawing which shows the example of the recognition result of a 2nd audio | voice. It is explanatory drawing which showed the outline | summary of the correction location specific process typically. It is explanatory drawing which showed an example of the input data handled by speech recognition processing, intermediate data, and output data. It is explanatory drawing which showed an example of the input data handled by speech recognition processing, intermediate data, and output data. It is explanatory drawing which showed an example of the semantic relationship between the words using co-occurrence information. It is explanatory drawing which shows the external appearance structure of the speech recognition apparatus concerning 2nd Embodiment. It is a block diagram which shows the structure of the speech recognition apparatus concerning 2nd Embodiment. It is a flowchart which shows the flow of the whole voice recognition process in 2nd Embodiment. It is a flowchart which shows the whole flow of the correction location specific process in 2nd Embodiment. It is explanatory drawing which shows the hardware constitutions of the speech recognition apparatus concerning 1st and 2nd embodiment.
61 Bus 100 Voice recognition device 101a Voice input button 101b Modified voice input button 102 Microphone 103 Display unit 111 Button input reception unit 112 Voice input reception unit 113 Feature amount extraction unit 114 Candidate generation unit 115a First candidate selection unit 115b Second candidate selection Unit 116 correction part specifying unit 117 correction unit 118 output control unit 121 phoneme dictionary storage unit 122 word dictionary storage unit 123 history storage unit 124 semantic relation storage unit 125 language model storage units 1501, 1502, 1503, 1504, 1505, 1506, 1507 Word 1701 Word 1801 Japanese 1802 Recognition result 1803 Japanese 1804 Correction result 1811, 1812 Word 1901 English 1902 Recognition result 1903 English 1904 Correction result 1911, 1912 Word 2100 Voice recognition device 2110 Underline 2111, 1122 Word 2203 Display unit 2204 Pointing device 2216 Correction location specifying unit 2219 Panel input receiving unit
Semantic relationship storage means for storing the semantic relationship between words and the degree of association representing the degree of semantic relationship in association with each other;
Input receiving means for receiving voice input;
A candidate generating unit that recognizes the speech received by the input receiving unit and generates a recognition candidate including a phoneme string candidate and a word candidate; and a likelihood indicating the likelihood of the recognition candidate;
First candidate selection means for selecting a recognition result of the first speech based on the likelihood of the first recognition candidate from the first recognition candidates generated by the candidate generation means for the first speech; ,
From the second recognition candidate generated by the candidate generation means for the second sound including the word to be corrected included in the recognition result of the first sound and the clue word that is a word serving as a clue to the correction. Extracting a word recognition candidate for the word to be corrected and a word recognition candidate for the clue word, and extracting a word recognition candidate for the extracted word to be corrected and a word recognition candidate for the extracted clue word Second candidate selection means for acquiring the relevance level associated with the semantic relation between the second relation selection means from the semantic relation storage means and selecting the second speech recognition result based on the acquired relevance level;
The phoneme sequence included in the recognition result of the first speech is collated with the phoneme sequence included in the recognition candidate for the word to be corrected extracted by the second candidate selection means, Correction location specifying means for specifying a portion corresponding to the word to be corrected;
Correction means for correcting a portion corresponding to the identified word to be corrected with a portion including the word to be corrected among the recognition results of the second speech ;
The second candidate selecting means selects the second speech recognition result including a word recognition candidate for the word to be corrected and a word recognition candidate for the clue word having the maximum obtained degree of association. The speech recognition apparatus according to claim 1.
Language model storage means for storing a language model in which connection relations between words and connection relation degrees indicating the degree of connection relations are associated;
The second candidate selecting means further stores the connection relevance associated with the connection relationship between the word recognition candidate for the extracted word to be corrected and the word recognition candidate for the clue word in the language model storage. The speech recognition apparatus according to claim 1, wherein the second speech recognition result is acquired based on the acquired connection relevance and the relevance, and the second speech recognition result is selected.
The second candidate selection unit obtains the recognition result of the second speech based on the likelihood of the second recognition candidate generated by the candidate generation unit with respect to the second speech and the relevance. The speech recognition apparatus according to claim 1, wherein the voice recognition apparatus is selected.
A word dictionary storage means that associates the word with the appearance probability of the word,
The second candidate selecting means further acquires the appearance probability associated with the extracted word recognition candidate for the extracted word to be corrected from the word dictionary storage means, and obtains the appearance probability and the relevance degree. The speech recognition apparatus according to claim 1, wherein a recognition result of the second speech is selected based on the result.
The semantic relationship storage means stores a hierarchical relationship of semantic content between words and the association degree in association with each other,
The second candidate selecting means calculates the relevance level associated with the hierarchical relationship of meaning contents between the extracted word recognition candidate for the extracted word to be corrected and the extracted word recognition candidate for the clue word. The speech recognition apparatus according to claim 1, wherein the second speech recognition result is acquired from the semantic relationship storage unit and the recognition result of the second speech is selected based on the acquired degree of association.
The speech recognition apparatus according to claim 1, wherein the semantic relationship storage unit stores at least one of a synonym relationship between words and a synonym relationship in association with the degree of association as the semantic relationship.
The semantic relationship storage means stores a co-occurrence relationship representing a relationship in which a plurality of words appear together with a co-occurrence probability representing a probability that the co-occurrence relationship appears,
The second candidate selecting means determines the co-occurrence probability associated with the co-occurrence relationship between the extracted word recognition candidate for the extracted word to be corrected and the word recognition candidate for the clue word as the semantic relationship. The speech recognition apparatus according to claim 1, wherein the second speech recognition result is acquired based on the acquired co-occurrence probability acquired from a storage unit.
The correction means corrects a portion corresponding to the specified word to be corrected with the word selected by the second candidate selection means with respect to the recognition candidate of the word to be corrected. The speech recognition apparatus described in 1.
2. The voice according to claim 1, wherein the correcting unit corrects a portion corresponding to the identified word to be corrected with a recognition result of the second voice selected by the second candidate selecting unit. Recognition device.
Display means for displaying the recognition result of the first voice;
Correction part designating means for designating a part to be corrected in the recognition result of the first voice displayed on the display means,
The correction location specifying means is a portion corresponding to the word to be corrected in the first speech from a predetermined range in front of or behind the portion to be corrected specified by the correction location specification means. The voice recognition apparatus according to claim 1, wherein:
12. The voice recognition apparatus according to claim 11, wherein the input receiving unit receives a voice input after the part to be corrected is specified by the correction part specifying unit as the second voice. .
An input reception step for receiving voice input;
A candidate generation step of performing speech recognition on the speech received by the input reception step and generating a recognition candidate including a phoneme string candidate and a word candidate and a likelihood indicating the likelihood of the recognition candidate;
A first candidate selection step of selecting a recognition result of the first speech based on a likelihood of the first recognition candidate from the first recognition candidates generated by the candidate generation step for the first speech; ,
From the second recognition candidate generated by the candidate generation step with respect to the second voice including the word to be corrected included in the recognition result of the first voice and the clue word that is a word serving as a clue to the correction. Extracting a word recognition candidate for the word to be corrected and a word recognition candidate for the clue word, and extracting a word recognition candidate for the extracted word to be corrected and a word recognition candidate for the extracted clue word The degree of association associated with the semantic relation between words is acquired from the semantic relation storage means for storing the relation between the semantic relation between words and the degree of association representing the degree of semantic relation, and the obtained degree of association is obtained. A second candidate selection step for selecting a recognition result of the second speech based on the second speech;
The phoneme sequence included in the recognition result of the first speech is collated with the phoneme sequence included in the recognition candidate for the word to be corrected extracted by the second candidate selection means, A correction location specifying step for specifying a portion corresponding to the word to be corrected;
A correction step of correcting a portion corresponding to the identified word to be corrected with a portion including the word to be corrected in the recognition result of the second speech ;
Input acceptance procedure to accept voice input,
A candidate generation procedure for recognizing the speech received by the input reception procedure and generating a recognition candidate including a phoneme string candidate and a word candidate and a likelihood indicating the likelihood of the recognition candidate;
A first candidate selection procedure for selecting a recognition result of the first speech based on the likelihood of the first recognition candidate from the first recognition candidates generated by the candidate generation procedure for the first speech; ,
From the second recognition candidate generated by the candidate generation procedure for the second voice including the word to be corrected included in the recognition result of the first voice and the clue word that is a word serving as a key for correction. Extracting a word recognition candidate for the word to be corrected and a word recognition candidate for the clue word, and extracting a word recognition candidate for the extracted word to be corrected and a word recognition candidate for the extracted clue word The degree of association associated with the semantic relation between words is acquired from the semantic relation storage means for storing the relation between the semantic relation between words and the degree of association representing the degree of semantic relation, and the obtained degree of association is obtained. A second candidate selection procedure for selecting a recognition result of the second speech based on the second candidate selection procedure;
The phoneme sequence included in the recognition result of the first speech is collated with the phoneme sequence included in the recognition candidate for the word to be corrected extracted by the second candidate selection means, A correction location specifying procedure for specifying a portion corresponding to the word to be corrected;
A correction procedure for correcting a part corresponding to the identified word to be corrected with a part including the word to be corrected among the recognition results of the second speech ;
A speech recognition program that causes a computer to execute.
JP2006083762A 2006-03-24 2006-03-24 Speech recognition apparatus, speech recognition method, and speech recognition program Active JP4734155B2 (en)
JP2006083762A JP4734155B2 (en) 2006-03-24 2006-03-24 Speech recognition apparatus, speech recognition method, and speech recognition program
CN 200710084368 CN101042867A (en) 2006-03-24 2007-02-28 Apparatus, method and computer program product for recognizing speech
US11/712,412 US7974844B2 (en) 2006-03-24 2007-03-01 Apparatus, method and computer program product for recognizing speech
JP2007256836A JP2007256836A (en) 2007-10-04
JP4734155B2 true JP4734155B2 (en) 2011-07-27
ID=38534641
JP2006083762A Active JP4734155B2 (en) 2006-03-24 2006-03-24 Speech recognition apparatus, speech recognition method, and speech recognition program
US (1) US7974844B2 (en)
JP (1) JP4734155B2 (en)
CN (1) CN101042867A (en)
JP5633042B2 (en) 2010-01-28 2014-12-03 本田技研工業株式会社 Speech recognition apparatus, speech recognition method, and speech recognition robot
JP5325176B2 (en) * 2010-07-20 2013-10-23 日本電信電話株式会社 2-channel speech recognition method, apparatus and program thereof
JP5688279B2 (en) * 2010-12-08 2015-03-25 ニュアンス コミュニケーションズ，インコーポレイテッド Information processing apparatus, method, and program for filtering confidential information
JP5772585B2 (en) * 2011-12-28 2015-09-02 トヨタ自動車株式会社 Speech recognition apparatus, method, and program
JP5682578B2 (en) * 2012-01-27 2015-03-11 日本電気株式会社 Speech recognition result correction support system, speech recognition result correction support method, and speech recognition result correction support program
DE102015213720A1 (en) * 2015-07-21 2017-01-26 Volkswagen Aktiengesellschaft A method of detecting an input by a speech recognition system and speech recognition system
CN106128462A (en) * 2016-06-21 2016-11-16 东莞酷派软件技术有限公司 Audio recognition method and system
JPH0728489A (en) * 1993-07-07 1995-01-31 Sharp Corp Recognition candidate selecting device
AU9455498A (en) * 1997-09-24 1999-04-12 Scansoft, Inc. Apparatus and method for distinguishing similar-sounding utterances in speech recognition
JP2001034287A (en) * 1999-07-15 2001-02-09 Matsushita Electric Ind Co Ltd Class determining method for language model, voice recognition device, and program recording medium
JP4270770B2 (en) * 2001-04-20 2009-06-03 三菱電機株式会社 Speech recognition apparatus, speech recognition method, and speech recognition program
JP3762327B2 (en) 2002-04-24 2006-04-05 株式会社東芝 Speech recognition method, speech recognition apparatus, and speech recognition program
JP3682922B2 (en) * 2002-04-24 2005-08-17 日本放送協会 Real-time character correction device and real-time character modification program
JP2005221752A (en) * 2004-02-05 2005-08-18 Toyota Central Res & Dev Lab Inc Device and method for speech recognition, and program
2006-03-24 JP JP2006083762A patent/JP4734155B2/en active Active
2007-02-28 CN CN 200710084368 patent/CN101042867A/en not_active Application Discontinuation
2007-03-01 US US11/712,412 patent/US7974844B2/en active Active
US7974844B2 (en) 2011-07-05
JP2007256836A (en) 2007-10-04
CN101042867A (en) 2007-09-26
US20070225980A1 (en) 2007-09-27