Speech recogniser using a hierarchically structured dictionary

Abstract: In a voice recognizing method, scores are added to voice recognition objective words by using parameters which are calculated in advance for an unknown input voice signal, thereby extracting and recognizing a corresponding voice recognition objective word. The voice recognition objective words are structured into a hierarchical structure by using correlation values between the voice recognition objective words, and score calculation is performed on the unknown input voice signal by using a dictionary of the voice recognition objective words structured in the hierarchical structure.

Description: This invention relates to voice recognition, information forming, and recording media. In the field of voice recognition for extracting language information from an input voice signal, a word corresponding to the input must be frequently selected from a given dictionary. For example, in voice recognition for a place name, standard patterns are formed for place names serving as objective candidate words, and matching between a feature amount pattern obtained by analyzing an input voice signal and all the standard patterns is set, i.e., distance calculation is performed, to select a pattern which is most similar to the place name. This operation is performed in the same manner as described above when a probability model serving as a hidden Markov model (HMM). An HMM is formed for each place name, and a model whose generation probability is highest with respect to an input voice signal must be selected. In general voice recognition, distance calculation is performed to set matching between objective words and an input voice signal, or a generation probability is calculated by using the probability model of each word, thereby adding scores to all the words, respectively. On the basis of the scores, a word having the highest score is selected. For example, in the HMM (Hidden Markov Model), probability models are formed for recognition objective words in advance, and a generation probability is calculated by a feature amount obtained by analyzing an unknown input voice signal. On the basis of the generation probability, scores are added to all the words. A word having the highest score is selected as a recognition result. In this case, a high score corresponds to a short distance when a distance is used as a parameter, and a high score corresponds to a high probability when a generation probability is used as a parameter. In this manner, scores are used as expressions corresponding to evaluation values. In a recognition system having a small vocabulary, when scores of all the objective candidates are calculated as described above, the processing amount of the score calculation does not pose a problem. However, in recognition of intermediate vocabulary or large vocabulary, score calculation for all the words in an objective recognition dictionary, i.e., entire searching, causes an increase in arithmetic operation amount. As a result, a problem that a response time is delayed may be caused. In order to solve this problem, the following method is used. That is, before score calculation for all the words is performed, preliminary selection using a simple evaluation scheme is performed, the number of words to be accurately subjected to score calculation is reduced on the basis of the result of the preliminary selection. This method of reducing the number of objective words is disclosed in, e.g., Japanese Patent Publication No. 03-69120 [1991.10.30]. This application has the following object. That is, standards patterns are divided in the order of increasing effectiveness, and matching is performed by each determination criteria, so that the number of times of matching is decreased without decreasing a recognition rate. More specifically, of a large number of standard patterns classified into categories formed in a memory in advance, a predetermined number of standard patterns selected by a predetermined method at a high frequency are stored in primary and secondary determination areas. The primary determination area is designated to perform matching between an input voice pattern and the standard patterns, and the obtained result is stored. A predetermined number of upper categories are determined as recognition candidates on the basis of the determination result. The standard patterns of the recognition candidate categories of the secondary determination area, and matching between the input voice pattern and the recognition candidate categories is performed. The obtained result is stored. The primary and secondary matching results are integrated with each other, and a category having the shortest distance is determined as the recognition result of the input voice. With the above arrangement, the number of times of matching is reduced. In general present voice recognition, even if accurate score calculation, e.g., matching or probability calculation, is performed, voice recognition is not easily performed. As in the former method, when preliminary selection is performed by simple evaluation, words which must be left are removed when the number of words is reduced, and a recognition rate may be decreased. In addition, even if a simple evaluation scheme is use, when the evaluation scheme is performed to all words, an arithmetic operation amount of the evaluation scheme is considerably large disadvantageously. In contrast to this, in a general searching problem, the following method called binary tree searching is popularly used. That is, objective candidates are structured into a binary tree, searching is performed by following the binary tree. This binary tree searching method is disclosed in Japanese Unexamined Patent Publication No. 04-248722 [1992.9.4]. This application has the following object. That is, in data coding method using vector quantization, input data is coded at a high speed. More specifically, code vectors included in a code book are divided into categories of M types, the code vectors belonging to the categories of M types are classified into categories of M(2) types. Similarly, a code vector is divided to the Nth stage in the same manner as described above. The feature vectors of the categories are center-of-gravity vectors of the code vectors belonging to the categories. In the coding, searching is performed by calculating the distances of an input vector and feature vectors of the categories according to a tree structure, thereby obtaining an optimum code vector. With the above arrangement, the speed of the input data is increased. The method of this application is a method of binary tree searching related to vector quantization, and it must be noted that this application is not related to voice recognition which is an object of the present invention. However, in the method using such structuring, a searching range is limited on the basis of a predetermined search tree, i.e., local searching is performed. For this reason, how to structure and how to search by using this structure are important. It is required that an arithmetic operation amount is reduced without increasing distortion as much as possible in comparison with entire searching, i.e., without decreasing a recognition rate as much as possible. For this mean, the binary tree searching easily poses a problem in which, although an arithmetic operation amount can be considerably reduced, distortion increases. In particular, in voice recognition, a recognition rate decreases to pose a serious problem. In the voice recognition using the HMM, probability model are formed for recognition objective words in advance, a generation probability is calculated by a feature amount obtained by analyzing an unknown input voice signal. On the basis of the generation probability, scores are added to all the words. A word having the highest score is selected as a recognition result. In the voice recognition using the HMM, a beam searching method of reducing an arithmetic operation amount is used. In the beam searching method, branches are cut by using halfway results to reduce the arithmetic operation amount. However, in this method, since the number of words are reduced by the halfway results of the scores, words which must be left are removed. Therefore, distortion increases, and a recognition rate decreases. In document Bahl et al.: "A Fast Approximate Acoustic Match for Large Vocabulary Speech Recognition", Proceedings of Eurospeech '89, Paris, Sep. 1989, p. 156-158 a voice recognition method is disclosed which employs a lexical tree search scheme on a feneme level. In not only voice recognition but such a searching problem, the size of a memory capacity in which a search tree required for increasing a searching speed is occupied is an important problem. According to a first aspect of the invention as claimed in claims 1-13 there is provided a voice recognizing method in which a plurality of voice recognition objective words are given, and scores are added to the voice recognition objective words by using parameters which are calculated in advance for an unknown input voice signal, thereby extracting and recognizing a corresponding voice recognition objective word, wherein the voice recognition objective words are structured into a hierarchical structure by using correlation values between the voice recognition objective words, and score calculation is performed to the unknown input voice signal by using a dictionary of the voice recognition objective words structured in the hierarchical structure. In a preferred form of implementation of the first aspect of the invention, probability models for the plurality of voice recognition objective words are prepared, generation probabilities of the probability models are calculated with respect to the unknown input voice signal, a corresponding voice recognition objective word is extracted and recognized according to the generation probabilities, a state transition sequence is determined on the basis of state transition probabilities of probability models corresponding to the voice recognition objective words, a symbol sequence is determined on the basis of an output symbol probability corresponding to the state transition, a generation probability of the obtained symbol sequence is calculated for models corresponding to the voice recognition objective words is calculated, and the voice recognition objective words are preferably structured into a hierarchical structure by using correlation values between the voice recognition objective words based on the generation probability. According to a second aspect of the invention there is provided an information forming method of forming information of pattern recognition objects used in a pattern recognizing method in which a plurality of pattern recognition objects are given, and scores are added to the pattern recognition objects by using parameters which are calculated in advance for an unknown input signal, thereby extracting and recognizing a corresponding pattern recognition objective word, comprising the step of grouping, on the basis of correlation values between the pattern recognition objects, the pattern recognition objects whose correlation values decrease, selecting pattern recognition objects serving as typical objects of groups, and performing grouping to form groups each having a relationship between a typical pattern recognition object and a set of pattern recognition objects belonging to the typical pattern recognition, the step of causing pattern recognition objects which are not selected as typical objects of the groups, with respect to a pattern recognition object having a small correlation value and serving as a typical object of any group, to belong to the group of the typical pattern recognition object, and the step of newly performing grouping and adding to a group to the typical pattern recognition objects obtained by performing the grouping and adding to the groups described above, wherein these steps are repeated a predetermined number of times to structure the words into a hierarchical structure. In addition, information of pattern recognition objects such as voice recognition objective words structured into the hierarchical structure may be recorded on a recording medium in advance. The present invention can be applied, not only to pattern recognition objects which are voice recognition objective words, but also to pattern recognition objects in image information as in graphic recognition or character recognition. In this manner, according to a preferred form of implementation, the voice recognition objective words (generally referred to hereinafter as pattern recognition objects) can be structured into a hierarchical structure or a tree structure, which allows overlapping, in advance, and searching can be performed according to this structure to limit the number of voice recognition objective words and to reduce an arithmetic operation amount. In addition, when correlation values between new words are defined, and a method of structuring the recognition words on the basis of the correlation values is performed, words whose scores are expected to be high are included in a searching range even if local searching is performed. Finally, distortion is rarely increased, and a decrease in recognition rate can be prevented. When the correlation values between words are calculated on the basis of parameters of a probability model such as an HMM (Hidden Markov Model), a large amount of actual voice data corresponding to a recognition dictionary can be prevented from being used. Preferred embodiments of the invention described hereinbelow provide: a voice recognizing method and apparatus in which one word and a plurality of words are selected from a given dictionary with respect to an input voice signal, and an information forming method for forming a dictionary and a recording medium on which a dictionary for voice recognition is recorded; a voice recognizing method, an information forming method, a voice recognizing apparatus, and a recording medium which prevent a recognition rate from being decreased while reducing an arithmetic operation amount; a voice recognizing method, an information forming method, a voice recognizing apparatus, and a recording medium in which the number of voice recognition objective words whose scores are calculated is limited to reduce an arithmetic operation amount and to increase the speed of voice recognition, an increase in required memory capacity is small, and an increase in distortion and a decrease in recognition rate are not caused by searching; and the possibility that a correlation value used for hierarchically structuring to limit the number of voice recognition objective words whose scores are calculated can be calculated without using voice data. The invention will now be further described, by way of illustrative and nonlimiting example, with reference to the accompanying drawings, in which: Fig. 1 is a block diagram schematically showing the arrangement of a general voice recognition system; Fig. 2 is a view showing a word distribution for explaining the concept of recognition using structuring; Fig. 3 is a view showing the relationship between a typical word and words belonging to the typical word; Fig. 4 is a flow chart for explaining a method of structuring recognition objective words in a hierarchical structure; Fig. 5 is a view for explaining the concept of a process of structuring words into a hierarchical structure; Fig. 6 is a view showing a hierarchical structure and search tree which are obtained by structuring in accordance with a preferred form of the invention; Fig. 7 is a flow chart for explaining a basic method related to grouping; Fig. 8 is a flow chart for explaining a method obtained by improving the grouping method in Fig. 7; Fig. 9 is a view showing the relationship between words which are strongly correlated to each other; Fig. 10 is a block diagram showing an arrangement of a voice recognition system to which an embodiment of the invention is applied; Fig. 11 is a flow chart for explaining a recognizing method using a search tree which is obtained by hierarchical structuring in the embodiment of the invention; Fig. 12 is a view showing a general state transition model of a hidden Markov model (HMM); Fig. 13 is a view showing a left-to-right model of the HMM; and Fig. 14 is a flow chart for explaining a process of calculating a correlation value between words. Preferred embodiments of the invention will be described below with reference to the accompanying drawings. Although the embodiments of the present invention exemplify voice recognition, the present invention can be easily applied to recognition of various patterns such as a video, image, or a character. A. First Embodiment In the first embodiment of the present invention, voice recognition is briefly described first, and definition of a correlation value between voice recognition objective words (to be referred to as words hereinafter), a method of structuring a word using the correlation value, and a recognizing method using this structure will be described as a method for increasing the speed of the voice recognition. After a memory capacity and an arithmetic operation amount are simulated, the simulation result will be described, and then the efficiency of the simulation result will be described. <Voice Recognition> An apparatus used in voice recognition, as shown in Fig. 1, is generally constituted by an input section 11, an acoustic analyzing section 12, a recognizing section 13, a parameter storing section 14, and an output section 15 in many cases. The input section 11 is constituted by a unit such as a microphone receiving a voice signal, an amplifier for amplifying the input signal, and an AD converter for converting the signal into a digital signal. After the input signal is sampled at 12 kHz, the sampled signal is transmitted to the acoustic analyzing section 12. In the acoustic analyzing section 12, a feature amount required for recognition is extracted from the input voice signal. For example, the energy, zero cross number, pitch, and the like of a simple signal are extracted, or frequency analysis is performed by linear predictive coding (LPC), fast Fourier transform (FFT), band-pass filter (BPF), Wavlet transform, or the like. A feature amount is extracted as a vector time series having, as an element, energy whose band is divided. As an amount of change in feature amount, for example, differential data may be extracted as one of feature amounts simultaneously with the other feature amounts. The feature amounts obtained described above may be subjected to proper mapping such as Karhunen-Loeve (KL) transform or neutral network to further convert a feature amount having a high degree of separation. A feature amount vector may be compressed by vector quantization or the like to convert the feature amount vector into a quantized feature amount. In this manner, in the acoustic analyzing section 12, the time series of feature amounts required for recognition is extracted from an input voice signal and transmitted to the recognizing section 13. In the recognizing section 13, a recognizing process for unknown voice data is performed by using a parameter of the parameter storing section 14 which is formed on the basis of feature amounts obtained by acoustically analyzing voice data for learning in advance. In this case, recognition means that a word corresponding an input voice signal is selected from a given recognition dictionary. As this recognizing method, a method using DP matching, neutral network, an HMM (Hidden Markov Model), or the like is mainly used. The DP matching is the following scheme. That is, reference patterns called templates are obtained as parameters in advance on the basis of feature amounts obtained by analyzing voice signals, the parameters are compared with the feature amount of an unknown voice signal, and a parameter which is determined to be closest to the feature amount of the unknown voice signal is found. In order to absorb a variation in elocutionary speed, the following method is frequently used. That is, a time axis is expanded by a method called dynamic time warping such that distortion between the voice signal and the template is minimized. The neutral network is to perform recognition by a network model which imitates the structure of a human brain. In the neutral network, the weight coefficient of a path is determined as a parameter in advance by a learning process, the distance between the parameter and each word in a dictionary is calculated on the basis of an output obtained by inputting the feature amount of an unknown voice signal to the network, thereby determining a recognition word. The HMM is to perform recognition by a probability model. In the HMM, a transition probability and an output symbol probability are determined for a state transition model in advance on the basis of learning data, and a recognition word is to be determined on the basis of a probability of generating each model for the feature amount of an unknown voice signal. The HMM will be described later as the second embodiment of the present invention. As described above, in a general recognizing process, a parameter, i.e., a template, determined on the basis of learning data, the weight coefficient of a network model, the statistic parameter of a probability model, and the like are calculated as a learning process, and the parameters are stored in the parameter storing section 14. In a recognizing process, after an input unknown voice signal is acoustically analyzed, scores such as distances or generation probabilities according to the recognizing method are added to words in a given dictionary, and a word having a high score or a plurality of words having higher scores are selected as recognition results. The obtained recognition results are transmitted to the output section 15. In the output section 15, the transmitted recognition results are displayed on a screen or output as sound. The output section 15 outputs commands for operating other units by using the recognition results. <Inter-Word Correlation Value> In the voice recognizing process described above, score calculation of the recognizing section 13 is performed between an input unknown voice signal and all the words in a given dictionary, i.e., the set of voice recognition objective words. In recognition of a small vocabulary, a processing amount rarely poses a problem. However, in recognition of an intermediate vocabulary or a large vocabulary, a processing amount poses a serious problem. Therefore, an object of the present technique is as follows. That is, the recognition objective words are structured in a hierarchical structure or a tree structure which allows overlapping, the number of words whose scores are calculated can be reduced by using the structure. This is briefly shown in Fig. 2. More specifically, referring to Fig. 2, in a distribution space 20 of all voice recognition objective words, when the distribution structure is obtained by using the relationships between words W, with respect to an input 21, a set 22 of words (i.e., words whose scores are competitive at an upper level) whose scores must be calculated and unnecessary words, i.e., words whose scores are not to be high, can be determined. The words whose scores need not be calculated are deleted, i.e., are out of words whose scores must be calculated, thereby reducing the processing amount or arithmetic operation amount of the recognizing unit. In order to determine a word distribution structure suitable for such an object, a distance scale for knowing the relationship between words is required. In general voice recognition, models corresponding words, i.e., templates, network models, and probability models, are formed, the parameters of these models are determined in a learning process, and score calculation using the models, i.e., distance calculation or probability calculation, is performed in a recognizing process. For this reason, the distance scale between an actual voice signal and the words may be defined by scores calculated on the basis of feature amounts obtained by acoustically analyzing the actual voice signal and the models corresponding to the words. Scores used in voice recognition tend to largely vary depending on a speaker, an elocutionary speed, a change in environment, or the like. For example, when the scores of two voice signals generated in similar manners are calculated by the same model, the scores are often different from each other. When the scores of two voice signals generated in similar manners are calculated by different models, the following phenomenon is frequently observed. That is, one voice signal has a high score with respect to one model, and the other voice signal has a high score with respect to the other model (the order is reversed). In order to absorb this variation, it is considered that a correlation value between words is defined by expected values of scores used in each recognizing method. Recognition objective words are represented by W i (1 < i < N), and a set of actual voice signals corresponding to the respective words W i are represented by X i = {X i 1 , X i 2 , X i 3 ,...}. In this case, N represents the number of recognition objective words, i.e., the number of words included in a dictionary. A score calculated between feature amounts obtained by acoustically analyzing a certain voice signal X j k and a model corresponding to a word W i whose parameter is determined by learning, e.g., the distance between the voice signal and a template in DP matching or a generation probability in an HMM, is described as S(X j k ,W i ). It is assumed that the score is normalized as in numeral expression (1) In expression (1), S org (X j k ,W i ) is a score before normalization, S(X j k ,W i ) is a normalized score. When a certain voice signal X 1 1 is used, a score S(X 1 1 ,W i ) can be calculated for each word. Similarly, a score S(X 1 2 ,W i ) is calculated by using a voice signal X 1 2 . Subsequently, scores can be calculated by using a set of voice signals X 1 = {X 1 1 , X 1 2 , X 1 3 ,...} corresponding to W 1 . Therefore, when it is assumed that the expected values, e.g., average values, of the scores calculated for words with respect to the set X 1 of the voice signal are expressed as Se(X 1 ,W i ), the average values can be calculated by expression (2): In this case, K is the number of data of the voice signal corresponding to W 1 , and it is assumed that the number is sufficiently large. Similarly, between a set of voice signals X j = {X j 1 , X j 2 , X j 3 ,...} corresponding to words W j and words, the expected values of scores can be calculated by expression (3): If a voice recognizing scheme whose recognizing performance is guaranteed to some extent is used, it is expected that, with respect to the set X 1 of voice signals corresponding to the words W 1 , Se(X 1 ,W 1 ) is highest in the expected values of scores calculated by expression (3). Similarly, it is expected that, with respect to a set X j of voice signals corresponding to the words W j , Se(X j ,W j ) is highest in the expected values of scores calculated by expression (3). It is expected that the words W i having expected values Se(X j ,W i ) of scores which are high with respect to X j has a score S(X j k ,W i ) which is high with respect to an unknown voice signal X j k . In contrast to this, it is expected that the words W i having expected values Se(X j ,W i ) of scores which are low with respect to X j has a score S(X j k ,W i ) which is low with respect to the unknown voice signal X j k . The expected values Se(X j ,W i ) of the scores calculated by expression (3) are recognized as distance scales D(W j ,W i ) of the words W i with respect to the words W j . When the distances between words and templates are used as the scores S(X j k ,W i ) are used, a small distance scale D(W j ,W i ) expressed by expression (4) means that the word W j is close to the word W i . When a generation probability in an HMM or the like is used, a large distance scale D(W j ,W i ) means that the word W i is close to the word W j . At this time, on the basis of the distance scale D(W i ,W i ), the words W i (i = 1, 2,..., N) can be sequentially arranged from a word which is close to the word W 1 . Similarly, the words W i (i = 1, 2,..., N) can be sequentially arranged from a word which is close to the word W 2 , W 3 ,..., W N . The places of the words W i , i.e., the places of the words W i arranged from a word close to the words W j , are defined as a correlation value R(W j ,W i ) of the words W i to the words W j . For example, a word W i which is closest to the words W j is defined as 1, a word W i which is secondly close to the words W j is defined as 2. Similarly, a word W i which is farthest from the words W j is defined as N. When there are words having distance scales D(W j ,W i ) expressed by expression (4) which are equal to each other and having the same place, these words are not forcibly ordered, and equal correlation values are set for the words. For example, when there are two words having the third place, 3 is set for these words. The correlation values R(W j ,W i ) defined as described above are set to be integer values falling within the range of 1 to N, and are in inverse proportion to correlation. More specifically, high correlation or a small correlation value R(W j ,W i ) means that the scores S(X j k ,W i ) calculated by the models of the words W i are expected to be high with respect to the unknown voice signal X j k corresponding to the word W j . Low correlation or a large correlation value R(W j ,W i ) means that the scores S(X j k ,W i ) calculated by the models of the words W i with respect to the unknown voice signal X j k corresponding to the word W j is expected to be low. In this case, as is apparent from the definition of the correlation values correlation values R(W j ,W i ) and R(W i ,W j ), it must be noted that these correlation values are not necessarily equal to each other. A method of structuring target voice recognition objective words on the basis of the correlation values described above will be described below. <Structuring of Recognition Objective Word> Before a method of structuring voice recognition objective words is described, how to structure the voice recognition objective words is briefly described. Basically, the voice recognition objective words are separated into typical words and words belonging to the typical words. When recognition is to be actually performed, with respect to an input voice signal, a recognizing process is performed in the typical words first. This process means that a position at which the voice signal is input is examined in a distribution space 20 of all the recognition objective words in FIG. 2. Words to be further subjected to a recognizing process are limited according to the result of the recognizing process. Finally, only a recognizing process to typical words and some words, i.e., only local searching, is performed to obtain a recognition result. For example, when the relationship shown in Fig. 3, i.e., subordination between five words W 1 , W 5 , W 7 , and W 10 and six words W 2 , W 3 , W 4 , W 6 , W 8 , and W 9 serving as words 32, is obtained, a recognizing process is performed in only the typical words. By using the recognition result, on the basis of a certain determination criteria, words to be subjected to a recognizing process are selected. For example, when words belonging to the typical word W 7 are selected, five words W 1 , W 5 , W 7 , and W 10 serving as typical words 31 and the words W 4 , W 6 , and W 8 belonging to the word W 7 are subjected to the recognizing process. As a result, a word having the highest score is selected from these words. Therefore, a correct solution can be obtained in the entire searching. More specifically, if a ward corresponding to an input voice signal has the highest score, a correct solution can be necessarily obtained with respect to an input voice signal corresponding to a typical word. In contrast to this, with respect to an input voice signal corresponding to a word other than typical words, when a recognizing process is performed in only the typical words, a correct solution must not be obtained as a matter of course. However, when scores are added to the typical words, typical words having high scores, i.e., typical words having high correlation, can be extracted. It is assumed that words having high correlation, i.e., small correlation values, for the word serving as a correct solution are included in the typical words, and that the word serving as the correct solution is included in the words belonging to the typical words. In this case, words having high scores are selected from the typical words, words belonging to the selected words are extracted, and the extracted words are further subjected to a recognition process. As a result, it is expected that the correct solution can be obtained. On the basis of the above consideration, a method of structuring recognition objective words will be described below with reference to Fig. 4. Procedure 1. Grouping (step S41) When both the words W i and W j have the small correlation values R(W j ,W i ) and R(W i ,W j ) (high correlation), it is expected that the scores S(X,W i ) and S(X,W j ) increase for input voice signals X corresponding to the respective words. For this reason, the two words are grouped. In this case, one of the words is defined as a typical word, and the other is defined as a word belonging to this typical word. Words which are not grouped are defined as typical words to be used as single groups, respectively. Procedure 2. Adding to Group (step S42) Words W j which belong to any groups and are not defined as typical words are caused to belong to the groups of the words W i selected as typical words in the words W i having small correlation values R(W j ,W i ). This process is a process which is performed to increase the number of groups, to which the words W i selected as typical words belong and which have the typical words W i having high correlation for the words W j , as large as possible. Procedure 3. Forming Hierarchy Grouping is performed such that the above grouping and adding to a group are performed as a single step, similarly, the typical words of the groups are newly grouped, and the typical words are grouped. The above operation is repeated to form a search tree having a hierarchical structure. More specifically, when the grouping and adding to the groups are performed, words which are correlated to each other are grouped at a certain hierarchy, and one typical word for each group is selected. The typical words serve as constituent elements of the hierarchy. In the flow chart in Fig. 4, the grouping is performed in step S41, the adding to the groups is performed in step S42, and the typical words are selected in step S43. The selected typical words are subjected to the grouping in step S1 and the adding to the groups in step S2. The operation is repeated to hierarchically structure the words. Fig. 5 shows an example of such grouping. Voice recognition objective words W i (i = 1, 2,..., 10) given as indicated by A in Fig. 5 is subjected to grouping in steps S41 and S42 as indicated by B in Fig. 5, and typical words W 1 , W 5 , W 7 , and W 10 are selected in step S43. Similarly, the typical words are subjected to the processes in steps S41 and S42 and subjected to the grouping indicated by C in Fig. 5, and the typical words W 1 and W 10 are selected in step S43. Finally, a search tree is obtained. An example of the structuring will be described below. 〈 Grouping 〉 Procedure 1. A group G i corresponding to each word W i is formed, the number of elements of the group is represented by n(G i ). An initial state is defined by: Gi = { Wi }, n ( Gi ) = 1 and the typical word of each group G i is represented by W i . Procedure 2. A correlation value R(W j ,W i ) (i = 1, 2,..., N) is calculated for each word W j . Procedure 3. i = 1 Procedure 4. j = i + 1 Procedure 5. When R(W j ,W i ) ≤ r and R(W i ,W j ) ≤ r, the following processes are performed to this (i,j), otherwise, go to the next procedure 6. (1) When n(G i ) ≥ 1 and n(G j ) ≤ 1, the following procedure (I) is executed. (2) When n(G i ) ≤ 1 and n(G j ) ≥ 1, the following procedure (II) is executed. (3) When n(G i ) > 1 and n(G j ) < 1, if elements other than W i included in the group G j are the same as elements other than W j included in the group G j , the following procedure (I) (or procedure (II)) is executed. Procedure (I): There is nothing to do when the word W j belongs to the group G i in advance. When the word W j belongs to the group G i , the word W j is added to the group G i , n(G i ) is incremented by 1, and n(G j ) = 0 is set. Procedure (II): There is nothing to do when the word W i belongs to the group G j in advance. When the word W i belongs to the group G j , the word W i is added to the group G j , n(G i ) is incremented by 1, and n(G j ) = 0 is set. Procedure 6. j is incremented by 1. When j ≤ N, return to the procedure 5.; when j > N, go to the next procedure 7. Procedure 7. i is incremented by 1. When i ≤ N - 1, return to the procedure 4.; when i > N - 1, the operation is ended. The method of grouping will be briefly described below with reference to a flow chart in Fig. 7. Groups are initialized in step S71, correlation values are calculated in step S72, and processes corresponding to the procedures 3. to procedures 7., i.e., grouping for different words W i and W j on the basis of the correlation values, are preformed. As determination criteria, the following conditions in the process of the procedure 5. are used: R ( W j ,W i ) ≦ r and R ( W i ,W j ) ≦ r In this case, as r, an integer (e.g., about 2 to 10) larger than 1 and smaller (sufficiently) than a recognition objective word number N. More specifically, the words W i and W j whose correlation values R(W j ,W i ) and R(W i ,W j ) decrease are grouped. When such words W i and W j are found, basically, as in (1) and (2) shown in the procedure 5., a word which is not a typical word is caused to belong to the group of the typical word. More specifically, the process (I) or the process (II) is performed. For example, when G 1 = {W i , W 2 } and G 3 = {W 3 }, the above expression (6) is established between W 1 and W 3 . In this case, G 1 = {W 1 , W 2, W 3 } is preferably set, G 3 is preferably set to be an empty set. When both the groups have elements which belong to words other than the typical word, i.e., in (3) in the procedure 5., and only when the elements other than the typical word are equal to each other, the process (I) (or process (II)) is executed. For example, when G 5 = {W 1 , W 5 } and G 7 = {W 2 , W 7 }, even if expression (6) is established with respect to W 5 and W 7 , grouping is not performed. However, when G 5 = {W 1 , W 2 , W 5 } and G 7 {W 1 , W 2 , W 7 }, and expression (6) is established with respect to W 5 and W 7 , G 5 is changed into G 5 = {W 1 , W 2 , W 5 , W 7 }, and G 7 is set to be an empty set. In contrast to this, G 5 may be set to be an empty set, and G 7 may be changed into G 7 = {W 1 , W 2 , W 5 , W 7 }. When n(G i ) = 1 and n(G j ) = 1 are established, and expression (6) is established with respect to W i and W j , either of the procedures (I) or the procedure (II) may be executed. As r in expression (6) of the determination condition decreases, a condition for grouping becomes severe. For this mean, r = 2 is set, the processes of the procedures 1. to the procedure 7. are performed, and r = 3 is set, and the processes of the procedure 3. to the procedure 7 are performed. Similarly, while r is increased one by one, until r ≤ r a is satisfied, the processes of the procedure 3. to the procedure 7. are repeated. In this manner, words which are correlated with each other sequentially grouped such that words which are mostly correlated with each other are grouped first, words which are secondly correlated with each other are grouped, and words which are thirdly correlated with each other are grouped. With respect to words which are selected as typical words, effective structuring can be performed because words which are strongly correlated to the above words serve as typical words on the initial stage. In this case, as ra, an integer (e.g., about 3 to 10) which is larger than 2 and sufficiently smaller than the recognition objective word number N is set. The above operation is shown in Fig. 8. Steps S81, S82, and S83 in Fig. 8 correspond to steps S71, S72, and S73, respectively. However, in step S83 corresponding to the processes of the procedure 3. to the procedure 7., until r ≤ r a is satisfied while r is increased one by one, these processes are repeated. In addition, in place of expression (6) of the determination condition, r j is set for W j as in expression (7): R ( W j ,W i ) ≦ rj and R ( W i ,W j ) ≦ ri For example, r j may be changed depending on n(G j ) as in expression (8): rj = n ( Gj ) +r -1 ( j= 1,2,···, N ) In this case, r = 2, i.e., r j = 2, is set first, and the processes of the procedure 1. to the procedure 7. are performed. According to the number of elements of each obtained group, r = is set, and r j is reset by expression (8), and the processes of the procedure 3. to the procedure 7. Similarly, r is incremented one by one, and the processes of the procedure 3. to the procedure 7. are repeated until r ≤ r a is satisfied while r j is reset by expression (8) according to the number of elements of each group. In this manner, a state wherein the words W i and W j which are originally, strongly correlated with each other are not grouped can be moderated. In particular, the following state can be moderated. That is, the correlation values R(W j ,W i ) is slightly increased because there are a large number of words W k correlated to the words W j , and the words W i and W j are not grouped. For example, even if R(W 5 , W 1 ) = 2 is satisfied with respect to W 5 , R(W 1 ,W 3 ) = 2, R(W 1 ,W 8 ) = 3, and R(W 1 ,W 5 ) = 4 are satisfied with respect to W 1 . In this case, if the determination of expression (6) is not performed while r ≥ 4, the words W 1 and W 5 are not grouped. However, if, after grouping is performed such that G 1 = {W 1 , W 3 , W 8 } is satisfied, the determination of expression (7) is performed while r = 2, the words W 1 and W 5 are grouped. This is because r 1 = 5 and r 5 = 3 are satisfied by expression (8). Therefore, structuring can be more efficiently performed. In this case, as in the above case, an integer (e.g., about 3 to 10) which is larger than 2 and sufficiently smaller than the recognition objective word number N is set as r a . 〈 Adding to Group 〉 Procedure 1. j = 1 Procedure 2. When the words W j are not typical words, i.e., when n(G j ) = 0 is satisfied, the following processes are performed; otherwise, go to the next procedure 3. (a) i = 1 (b) When the words W i are typical words, i.g., when n(G i ) > 0 is satisfied, the following processes are performed; otherwise, go to (c). When R(W j ,W i ) ≤ r b is satisfied, the following process (III) is executed. (c) i is incremented by 1. When i ≤ N is satisfied, return to (b); when i > N, go to the next procedure 3. The process (III) is the following process. Process (III): There is nothing to do when the words W j belong to the group G i in advance. When the words W j do not belong to the group G i , the words W j are added to the group G i , and n(G i ) is incremented by 1. Procedure 3. j is incremented by 1. When j ≤ N, return to the procedure 2.; when j > N, the operation is ended. The adding to the group will be additionally described below. Words are separated into typical words and word belonging thereto by the above grouping. In the recognizing process, only the typical words are subjected to a recognizing process. On the basis of the result of the recognition process, words which must be subjected to the recognizing process are selected. More specifically, with respect to the words which are selected as typical words, the following is important. That is, words which are strongly correlated with each other are included in the typical words as possible, and belong to the groups of the typical words. Therefore, the processes of the procedure 1., the procedure 2., and the procedure 3. are performed, and attention is given to the words W j which are not selected as typical words. Words which are strongly correlated to each other in the words W i selected as typical words, i.e., the words W i which satisfy expression (9): R ( Wj,Wi ) ≦ rb are found. When the words W j have not belonged to the corresponding groups G i , the words W j are added as elements of the groups. Note that an integer (e.g., about 3 to 20) which is larger than 2 and smaller than the recognition objective word number N is set as r b in expression (9). In order to prevent degradation of recognition performance, r in expression (6) and r i and r j in expression (7) in the grouping must not be set to be excessively large values, i.e., a severe determination condition is preferably set. In contrast to this, r b in expression (9) is preferably set to be a value which is large as much as possible. This is because words which are selected as typical words may be included in words to be subjected to a recognizing process (score calculation) in the recognizing process. For this mean, in grouping, words which are not strongly correlated to each other are not desirably grouped, i.e., the process in which one of the words is set to be a typical word and the other word is set to be a word belonging to the typical word is not desirably performed. Therefore, r in expression (6) and r i and r j in expression (7) must not be set to be excessively large values. In contrast to this, after grouping is temporarily performed, when the words which are selected as typical words belong to groups whose number is large as much as possible, a probability that the words are included in the words to be subjected to the recognizing process (score calculation) in the recognizing process increases. For this mean, rb in expression (9) is preferably set to be large as much as possible. In particular, when the words are included in the groups using, as typical words, words which are strongly correlated to the above words, a better effect can be expected. When r b in expression (9) is increased, a search range in the recognizing process is expanded, i.e., the number of words whose scores are calculated is increased. For this reason, as an original object, in order to decrease the processing amount (arithmetic operation amount) of the recognizing process an original object, r b must not be excessively large. Therefore, r b is preferably se to be slightly larger than r in expression (6) or r i or r j in expression (7). 〈 Forming Hierarchy 〉 Procedure 1. With respect to all the recognition objective words {W i : i = 1, 2, ..., N}, W i is represented by W i 0 or the like. It is assumed that N 0 = N is satisfied. Procedure 2. m = 1 Procedure 3. Grouping having, one step, the process of grouping and the process of adding to groups is performed to words {W i m-1 : i = 1, 2,..., N m-1 }. It is assumed that the obtained typical words are represented by {W i m-1 : i = 1, 2,..., N m-1 }. Note that N m is the number of typical words. Procedure 4. m is incremented by 1, when m ≤ M is satisfied, returns to the procedure 3; when m > M is satisfied, the operation is ended. The forming hierarchy will be briefly described below with reference to Fig. 4. The process of the procedure 3. when m = 1 means that the grouping in step S41 and adding to the groups in step S42 are performed. When the grouping in step S41 performed first is performed, words which are strongly correlated to each other are grouped, and subordination between these words is determined. Next, m = 2 is set, and typical words obtained when m = 1 are grouped. However, in the first grouping, the words which are strongly correlated to each other are grouped, and subordination between the words is determined. Subsequently, similarly, until m > M is satisfied, grouping is performed in the same manner as described above. A search tree having a hierarchical structure shown in Fig. 6 can be obtained. In consideration of the forming process, it is expected that words in a certain hierarchy are connected to each other through paths because words which are strongly correlated to each other are present on the upper hierarchy as typical words. More specifically, it is expected that, for words in the lowest hierarchy (i.e., set of all recognition objective words), paths to the words which are strongly correlated to each other are connected to an upper hierarchy. For example, as shown in Fig. 9, the relationship such as expression (6) or expression (7) is established between the words W 1 and W 5 , and it is assumed that W 1 becomes a typical word, and W 5 becomes a word belonging to the typical word. In addition, after both the words W 1 and W 9 are selected as typical words, grouping is performed again. As a result, the relationship such as expression (6) or expression (7) is established between the words W 1 and W 9 , and it is assumed that W 9 becomes a typical word, and W 1 becomes a word belonging to the typical word. In this case, it can be expected that the words W 5 and W 9 are strongly correlated to each other. However, the strength of correlation between words on the lowest hierarchy and words obtained by following the paths to upper hierarchies is expected to be lowered toward an upper hierarchy. Therefore, if words to be subjected to a recognizing process are limited on the basis of the obtained search tree, words are limited from words in an excessive upper hierarchy to the lowest words. It is undesirably expected that the limiting increases distortion, i.e., degrades a recognition ratio. For this mean, the highest hierarchy M of the search tree obtained by the forming hierarchy is preferably prevented from being excessively high. Note that it is assumed that W i m is called a word of the mth hierarchy. For example, a set of recognition objective words is words in the 0th hierarchy, and it is assumed that a set of typical words selected from the words in the 0th hierarchy is called words in the first hierarchy. <Recognizing Method> A recognizing method using the search tree obtained by hierarchically structuring the recognition objective words as described above will be described below. In this voice recognition, in place of the arrangement shown in Fig. 1, an arrangement shown in Fig. 10 is used. In this case, the operations of an input section 101, an acoustic analyzing section 102, a parameter storing section 104, and an output section 105 are the same as those of the sections 11, 12, 13, 14, and 15 shown in Fig. 1. More specifically, an input signal input to the input section 101 is analyzed by the acoustic analyzing section 102, and an obtained feature amount is transmitted to a recognizing section 103. In the learning process, a parameter used in the recognizing process is determined on the basis of voice data for learning, and the parameter is stored in the parameter storing section 104. The recognition objective words described above are newly structured by using actual voice data. An obtained search tree is stored in a search tree storing section 106. More specifically, score calculation in the recognizing section 103 is performed to actual voice data corresponding to each recognition objective word, and a search tree is formed on the basis of the structuring method and stored in the search tree storing section 106. In the recognizing process, an unknown voice signal input from the input section 101 is acoustically analyzed in the acoustic analyzing section 102, and an obtained feature amount is transmitted to the recognizing section 103. The following recognizing process is performed. Procedure 1. Score calculation is performed to words in the Mth hierarchy, p upper words having higher scores are selected. Procedure 2. m = M Procedure 3. On the basis of the search tree in the search tree storing section 106, from the p upper words having higher scores and selected on the mth hierarchy, words on the (m-1)th hierarchy to which the p words belongs are extracted. Score calculation is performed to these words again, and p upper words having higher scores are selected. Procedure 4. m is decremented by 1. When m > 0, return to 3. When m = 0, go to the procedure 5. Procedure 5. Words having higher scores or a plurality of upper words are selected from the words extracted on the 0th hierarchy. The words having higher scores and selected in the procedure 5. or a plurality of upper words are transmitted to the output section 105. In the output section 105, the transmitted recognition results are displayed on a screen or output as sound. The 105 outputs commands for operating other units by using the recognition results. The process of the procedure 1. is called initial searching, and the processes of the procedure 2 to the procedure 4. are called structure searching. Fig. 11 is a flow chart for explaining the outline of the above recognizing process. In the first step S111 in Fig. 11, searching for the Mth hierarchy is performed as initial searching. Thereafter, structural searching from searching for the (M-1)th hierarchy to searching for the 0th hierarchy is performed. In step S113, words on the mth hierarchy are extracted. It is checked in step S114 whether score calculation has been performed to the extracted words. If NO in step S114, the flow is shifted to step S115 to perform score calculation, and the flow is shifted to step S116. If YES in step S114, the flow is directly shifted to step S116. In step S116, p upper words having calculated higher scores are selected. The initial searching means score calculation which is performed to the typical words of the uppermost hierarchy first in the recognizing process, and the structural searching means a process of performing score calculation to words belonging to the p typical words selected in searching for a hierarchy which is higher then the above hierarchy by one on the basis of the search tree. In the above structural searching, words whose scores are calculated as typical words, or words which are repetitively included in two or more extracted groups are used. For this reason, the scores of the words whose scores have been temporarily are stored, the scores of the words are prevented from being repetitively calculated. <Estimation of Memory Capacity> In the recognizing process using the search tree described above, a memory capacity required for the search tree is estimated. A total word number is represented by N. It is assumed that words on a certain hierarchy are degenerated into groups whose number is 1/2 the word number, and that the average number of elements of each group is 10, the number of words on a hierarchy m is given by: (1/2) m N An average number (10) of paths of the search tree must be stored as subordination from given words to words on a hierarchy lower than the hierarchy of the given words. With respect to all the words on the first hierarchy to the Mth hierarchy, paths whose number is given by the following expression: must be stored. In this case, the Mth hierarchy is the uppermost hierarchy of the search tree. Therefore, even if M is set to be sufficiently high, as a memory capacity, only path information represented by the following expression: may be stored. Note that this value considerably depends on a set of words to be recognized and largely varies depending on r b in expression (9). For this reason, the value is used as one criteria. <Estimation of Arithmetic Operation Amount> An arithmetic operation amount in the recognizing process using the search tree is estimated in advance. It is assumed that a search tree supposed in the estimation of memory capacity . described above is obtained. More specifically, it is assumed that the number of all words is represented by N, that the words are degenerated into groups whose number is 1/2 the number of words in each hierarchy, and that the average number of elements of each group is set to be 10. In this case, the number of words in initial searching in the recognizing process is given by: (1/2) M N and the number of words in structural searching is given by: where M is a hierarchy in which initial searching is performed in the recognizing process, and p is the number of words extracted on the mth hierarchy and having higher scores. As a reference, in recognition of 1,000 words and 4,000 words, values obtained by estimating the number of words whose scores must be calculated when p = 10, i.e., the number of words in initial searching and the number of words in structural searching are shown in Table 1 and Table 2: M Initial Searching Structural Searching Total 0 1000 0 1000 1 500 100 600 2 250 200 450 M Initial Searching Structural Searching Total 0 4000 0 4000 1 2000 100 2100 2 1000 200 1200 3 500 300 800 4 250 400 650 In each table, the number of words in initial searching for the Mth hierarchy in initial searching, the numbers of words in structural searching, and the total numbers of words, i.e., the numbers of words whose scores are finally calculated. In this case, M = 0 corresponding to all searching. As a reduction of an arithmetic operation amount by structuring, in recognition of 1,000 words shown in Table 1, when it is assumed that the sixth hierarchy is used as a hierarchy for initial searching, the scores of 250 words are calculated in initial searching, and the scores of 200 words are calculated in structural searching. As a result, the scores of a total of 450 words are calculated, and it is supposed that the number of words whose scores must be calculated is decreased by about 60%. In 400 words shown in Table 2, when the fourth hierarchy is considered as a hierarchy for initial searching, the scores of 250 words are calculated in initial searching, and the scores of 400 words are calculated in structural searching. As a result, the scores of a total of 650 words are calculated, and it is supposed that the number of words whose scores must be calculated is decreased by about 80%. In addition, the scores of the words can be prevented from being repetitively calculated such that the scores of typical words whose scores have been calculated can be prevented from being calculated, or the scores of words which are repetitively included in two or more extracted groups can be prevented from being calculated. For this reason, it is expected that the arithmetic operation amount can be further reduced. When a recognizing process using such a search tree is to be performed, in addition to score calculation, a process of extracting words whose scores are calculated in structural searching must be calculated is performed. Since it is supposed that the arithmetic operation amount in this process is smaller than the arithmetic operation amount in score calculation, the process is not considered. <Simulation Result> A result obtained by actually comparing entire searching with searching using structuring embodying the invention in recognition of 938 words will be described below. As a method of structuring, expression (7) was used to perform grouping. Grouping was performed while r was increased from 2 to 8 and while r j was varied by expression (8) described above. In order to perform adding to groups, r b = 20 was used in expression (9) described above. The Mth (M = 2) hierarchy was structured. As a result, a search tree, having two hierarchies having 150 words in initial searching, in which the average number of paths connected from a certain word of a given hierarchy to words of a hierarchy which was under the given hierarchy was set to be 12 could be obtained. In recognition by entire searching, a recognition rate was 98.7%, and the number of words whose scores were calculated was 938. In contrast to this, a recognition process using structuring for extracting p (p = 8) words having higher scores on each hierarchy was performed. As a result, a recognition rate slightly decreased, i.e., 96.6%, and the number of words whose scores were calculated was a total of 285 words (average), i.e., 150 words in initial searching and 135 words in structural searching. More specifically, it was understood that a calculation amount in searching by a technique embodying the invention could be reduced by about 70%. As described above, according to the first embodiment of the present invention, words to be recognized are structured in a tree structure in advance, and searching is performed according to this structure. For this reason, the number of words to be recognized can be limited, and an arithmetic operation amount can be considerably reduced. In addition, when a correlation value R(W j ,W i ) between new words is defined, and a method of structuring the recognition words on the basis of the correlation value is used, words whose scores are expected to be high are included in a searching range even if local searching is performed. Finally, distortion is rarely increased. More specifically, a recognition rate is rarely decreased. In addition, only path information whose amount is about 10 times the number of words is prepared as a memory capacity which is excessively required, and the memory capacity is relatively small. B. Second Embodiment As the second embodiment of the present invention, a case wherein the present invention is applied to voice recognition using an HMM (Hidden Markov Model) will be described below. In the first embodiment described above, a drawback that voice data must be used to calculate correlation values is removed, and the correlation values are directly calculated on the basis of the parameter of the HMM without using voice data. As a matter of course, as in the above embodiment, an arithmetic operation amount can be considerably reduced without a decrease in recognition rate caused by an increase in distortion. In addition, a memory capacity which is excessively required is relatively small. The voice recognition using the HMM will be briefly described below. As a scheme for making the speed of voice recognition high, definition of correlation values between words, a method of structuring recognition words using the correlation values, and a recognizing method using this structure will be described below. <Voice Recognition using HMM> Words to be recognized are represented by W 1 , W 2 ,..., W p . When the feature parameter of an observed voice signal is Y, a probability of setting Y to be a word W i is given by P(W i |Y). Therefore, it is preferably determined that W i which gives the maximum probability in P(W i |Y) (i = 1, 2,..., p) is a word to which Y belongs, i.e., that the word W i is generated. In this case, according to Bayes theorem, P ( Wi | Y )= P ( Wi ) P ( Y | Wi / P ( Y ) is established, and P(Y) of the denominator is independent of W i . For this reason, it is understood that only W i which maximizes P(W i )P(Y|W i ) (i = 1, 2,..., p) of the numerator need be calculated. P(W i ) represents a prior probability of generating the word W i , and P(Y|W i ) represents a probability of obtaining the feature parameter Y when the word W i is generated. The HMM method is a method of estimating W i which maximizes expression (1) by a probability model (HMM). The HMM (Hidden Markov Model) is defined as an automaton in a non-determination finite state, and, as shown in Fig. 12, is constituted by some states S 1 , S 2 ,..., S N (state number N) and paths representing transition between these states. The transition process in each state is defined as a Markov process, and it is assumed that one output symbol is generated when a state is transits. In voice recognition, a left-to-right model having an initial state and a final state which allow only self transition and transition to a next state shown in Fig. 13 is often used. Of HMM methods, in a discrete type HMM method, a probability (posterior probability) of generating a symbol sequence Y y 1 ·Y 2 ···y T (T: length of observed sequence) obtained by vector-quantizing, e.g., a voice feature vector in each model is calculated. The model having the highest probability is used as a recognition result. <Formulation of HMM> In this case, a discrete type HMM corresponding to a word W is formulated as follows: S: Finite set of states (N: state number) S = { S 1 , S 2 ,···, S N } V: Set of output symbols (M: output symbol number) V = { v 1 , v 2 ,···, v M } A: Set of state transition probability (a ij : transition probability from state S i to state S j ) B: Set of output probabilities in state transition (b ij ( vk ): probability of outputting symbol vk in transition from state S i to state S j ) π: Set of initial state probabilities (π i : probability of setting initial state S i ) On the basis of HMM defined as described above, the symbol sequence Y = y 1 ·Y 2 ···y T is generated as follows. Procedure 1. An initial state x0 = S i is selected according to the initial state probability π. Procedure 2. t = 0 is set. Procedure 3. Transition from a state xt = S i to a state xt+1 = S j is selected according to a state transition probability a ij . Procedure 4. A symbol yt = vk output in transition from the state S; to the state S j is selected according to the output symbol probability b ji ( vk ). Procedure 5: When t < T, t = t + 1 is set, and return to the procedure 3.; otherwise, the operation is ended. It is assumed that time in state transition is set to be t = 0, 1, 2,..., and that a transition state at time t is represented by xt . As described above, in order to define the HMM, designation of N and M, a set of output symbols, and probabilities A, B, and π are required. In order to easily express these values, the following expression is defined: λ = { A , B , π) More specifically, a model is determined for each word. <Probability Calculation of HMM> In voice recognition, as described above, a left-to-right model in which one initial state and one finial state are defined is often used. In the following description, a model in which initial and final states are limited to S i and S N is considered. It is assumed that a model λ outputs a symbol sequence y 1 ·Y 2 ···y T , and that a forward predicted probability that the state S i is set at time t is represented by αi (t). In this case, according to definition of the symbol outputs of the above model, the probability αi (t) can be calculated by the following recurrence formula: When t = 0, When t = 1, 2,..., T, In this case, it is assumed that summation with respect to j in the above formula is performed only when a given model is allowed to perform transition from the state S j to the state S i . On the basis of the above conditions, a probability P(Y|λ) of outputting the symbol sequence Y = y 1 ·Y 2 ···y T from the symbol λ is calculated by: P ( Y | λ) = α N ( T ) In the voice recognition using the HMM method, with respect to the symbol sequence Y = y 1 ·Y 2 ···y T generated by voice, the model λ which maximizes the probability P(Y|λ) calculated by the above expression is obtained as a recognition result. As another method of calculating the probability P(Y|λ), a calculating method using Viterbi algorithm is used. This calculating method will be briefly described below. A probability - αi (t) that the state S i is set at time t is calculated by the following expression in place of expression (23): In this case, it is assumed that the maximum value of {} related to j in expression (25) is considered with respect to only a model which is allowed to perform transition from the state S j to the state S i . On the basis of the probability - αi (t), the following calculation is performed: P ( Y |λ) = α N ( T ) In this case, as a state transition sequence determined by expression (25), a state transition sequence having a final state S N is uniquely determined, and is called an optimum path. This optimum path can be obtained by the following manner. That is, in calculation of expression (25) of the Viterbi algorithm, when a prior state obtained by transition at this time is stored, and calculation for the final state is completed, the prior state is followed from the final state. When logP(Y|λ) is calculated, multiplication can be replaced with adding, calculation efficiency can be improved. <Parameter Estimation of HMM> A method of estimating a transition probability A = { αij } and an output probability B = {b ij ( vk )} as parameters of a model which maximizes the probability P(Y|λ) with respect to the symbol sequence Y = y 1 ·Y 2 ···y T will be described below. Note that predetermined initial values are used as a transition probability A = { αij } and an output probability B = {b ij ( vk )} in the first estimation. In learning of a model, the forward predicted probability αi (t) is calculated on the basis of a symbol sequence, and a backward predicted probability βi (t) that the state S i is set at time t, and, subsequently, a symbol sequence yt+1 · yt+2 ··· yT is output is calculated by the following expressions: Procedure 1. When t = T, β i ( T ) = 0 ( i =1,2,···, N -1) β N ( T ) = 1 Procedure 2. When t = T - 1, T - 2,..., 0, In this case, it is assumed that summation related to expression (28) is performed only when a given model is allowed to perform transition from the state S i to the state S j . At this time, when a probability that the transition from the state S i to the state S j occurs at time t with respect to the symbol sequence Y = y 1 ·Y 2 ···y T is represented by γij (t), γij (t) is given by: γ ij ( t ) = α i (t-1) a ij b ij ( y t )β j ( t ) α N ( T ) According to the following expressions, the transition probability a ij and the output probability b ij ( vk ) serving as parameters of the model are updated, i.e., learned. In the above expressions, a ij having ^ and b ij ( vk ) mean a transition probability and an output probability which are updated, i.e., re-estimated, respectively. Summation related to h in the above expression is performed only when the model is allowed to perform the transition from the state S i to the state S j . Summation related to t : yt = vk is performed only when the symbol yt = vk is generated at time t. According to the above expressions, the transition probability a ij and the output probability b ij ( vk ) are updated, i.e., re-estimated, and are locally converged into optimum values, respectively. The method of updating, i.e., re-estimating, the transition probability a ij and the output probability b ij ( vk ) as described above is called a Baum-Welch re-estimating method. In this case, the transition probability a ij and the output probability b ij ( vk ) calculated by expressions (30) and (31) for only one learning symbol sequence. The model which performs learning by using these values outputs one certain symbol sequence at a high probability. However, voice varies depending articulation coupling or speakers. A model which outputs only a single symbol sequence at a high probability cannot cope with this variation. Therefore, learning of a model λ must be performed such that some symbol sequences are output at a high probability. For example, when the qth symbol sequence of Q types of symbol sequences is represented by Y q = y1 q · y2 q ··· yt q , leaning of the model λ is performed such that the product of probabilities P(Y q |λ) that the symbol sequences Y q (q = 1, 2,..., Q) is maximum. When the above Baum-Welch re-estimating method is multi-sequentially expanded, the probabilities (Y q |λ) can be recursively calculated. More specifically, when αi (t), βi (t), and γij (t) by Y q are represented by αi q (t), βi q (t), and γij q (t), respectively, these values are calculated by the following expressions: γ q ij ( t ) = α i (t-1) a ij b ij ( y q t )β j ( t ) α N ( T ) The transition probability a ij and the output probability b ij ( vk ) calculated by expressions (33) and (34) mean that learning is performed to respective models. In past, the HMM method is frequently applied to word recognition. Therefore, it is satisfied that learning of models corresponding to words is performed to respective models. However, in recent years, recognition of effective voice (e.g., word or sentence) has been generally performed using a phoneme to which a corresponding model is connected. For this reason, connection learning of models must be performed. In the connection learning of models, on the basis of words registered in a predetermined word dictionary, phonemes or phoneme models are connected to each other. When the resultant models are considered as word models, learning to a symbol sequence Y q prepared as a symbol sequence for leaning words is performed. More specifically, when learning is performed for each of W phonemes and phoneme models, the parameters of the wth model (e.g., model w), i.e., a transition probability and an output probability, are represented by a ij w and b ij w ( vk ), and the states of models (i.e., connection models) obtained by connecting the phonemes or phoneme model to the model w is represented by S m or S n . When the state of the connection model is changed from S m to S n , it is represented by (m - n) ε w that the state S m belongs the model w. In this case, the transition probability a ij and output probability b ij ( vk ) are updated, i.e., re-estimated, according to the following expressions obtained by modifying expressions (33) and (34): In this case, when a connection model is constituted by a plurality of models w, i.e., when the connection model is constituted by using the model w constituted by three states S 1 , S 2 , and S 3 twice, the connection model has six states S 1 , S 2 , S 3 , S 1 , S 2 , and S 3 . Therefore, in this case, in the states S 1 , S 2 , and S 3 of the model w, for example, the first state S 1 is the same as the first and fourth states of the states S 1 , S 2 , S 3 , S 1 , S 2 , and S 3 of the connection model. In this manner, a plurality of states m of the connection model may be the same as one state S i of the model w. In expressions (359 and (36), summation (total sum) related to m ≡ i and n ≡ j is performed when the states S m and S n of the connection model are the same as the states S i and S j of the model w. In addition, summation related to m ≡ i is performed when the state S m of the connection model is the same as the state S i of the model w. Summation related to h : (m - n) ε w is performed only when the state S m of the connection model belongs to the model w when the connection model is allowed to perform transition from the state S m to the state S h . In expressions (35) and (36), when a model is connected to the back of the model w, and a state S m of the connection model becomes the final state (S m = S N ) of the model w, the state S n which is the transition destination of the state S m serves as the initial state of the model immediately connected to the back of the model w. When voice recognition is performed by using the discrete type HMM method described above, by using a learning sequence Y prepared for learning, learning of models, i.e., connection learning, is performed according to expressions (33) and (34) or (35) and (36). As a result, the transition probability a ij and output probability b ij ( vk ) of the model λ are calculated. In the following description, a ij w and b ij w ( vk ) in expressions (35) and (36) are represented by a ij and b ij ( vk ), respectively, as in expressions (33) and (34). When a symbol sequence Y is observed from voice in recognition, the probability P(Y|λ) that the model λ outputs, i.e., generates its symbol sequence is calculated according to expression (23). The above processes are also performed to models, and, as described above, the model having the highest probability P(Y|λ) is obtained as a recognition result. In the discrete type HMM, as described above, a symbol obtained by performing a vector quantizing process or the like to the feature vector of voice is used in learning or recognition. Therefore, the symbol includes a quantization error. As a result, the recognition rate of the voice is disadvantageously degraded. A mixed continuous HMM method in which output probabilities b ij ( vk ) which are related to a symbol vk and which are a discrete probability distribution, are changed into a continuous probability distribution is used. In the mixed continuous HMM method, an HMM has a continuous probability density distribution, i.e., a continuous distribution, and the output probabilities b ij ( vk ) in the discrete HMM method is approximated by a mixture of L continuous distributions. More specifically, the output probability b ij ( vk ) that the model λ generates a feature vector y of voice is calculated by the following expression: where c ijl is a branch probability which represents the lth (l = 1, 2,..., L) appearance probability; b ijl (y) is a branch density which represents the lth probability density distribution. These values satisfy the following conditions: ∫ b ijl ( y ) dy =1 Note that a Gaussian distribution (normal distribution) is generally assumed as the probability density distribution b ijl (y). For this reason, when it is assumed that the probability density distribution b ijl (y) follows an n-dimensional normal distribution having the covariance matrix Σ ijl of the output probability b ijl (y) and an average value µ ijl as parameters, the lth probability density distribution b ijl (y) is given by the following expression: In expression (40), T and -1 represent transposing and an inverse matrix, respectively. |Σ ijl | represents the determinant of the covariance matrix Σ ijl . In this case, according to the Baum-Welch re-estimating method, the covariance Σ ijl and average value µ ijl of the an appearance probability c ijl and the probability density distribution b ijl (y) can be calculated, i.e., re-estimated by the following expression. Note that a transition probability a ij can be calculated by expression (35) or (33) described above. In the above expressions, c ijl , Σ ijl , and µ ijl each having ^ represents an updated appearance probability, a covariance matrix, and an average value, respectively. P(Y, ht = l|λ) represents a probability that the model λ outputs a feature vector yt at time t from the first distribution when a sequence Y = y 1 ·y 2 ···y T of a feature vector y of voice. Note that ht = 1 denotes a probability variable representing that the feature vector is output first. When voice is to be recognized by using a model learned on the basis of the mixed continuous HMM method in which the output probability b ij (y) is approximated by a mixture of L continuous distributions, as in the case wherein the discrete type HMM method is used, the probability P(Y|λ) that the model λ outputs or generates a feature vector sequence observed (extracted) from voice is calculated by expressions (23) and (24) or expressions (25) and (26) described above. The probability P is also calculated for models other than the model λ, and, as described above, a model having the highest probability P is obtained as a recognition result. In place of the estimating method described above, the following method may be used. An optimum state transition sequence is calculated by a Viterbi algorithm for each of training sample sets {y q } to calculate output vector sets {y ij } in transition from the state S 1 to S j . The output vector set {y ij } is classified into L classes by a clustering method, vector sets in each class is considered as a sampling group to estimate a Gaussian distribution. A branch probability is calculated by a ratio of the number of vectors in the class to the total number of vectors. This operation is repeated until parameters are converged. A correlation value between words when the HMM method will be described below. <Voice Recognition> The arrangement a voice recognizing apparatus using the HMM method described above is shown in Fig. 1 described above or Fig. 10, the arrangement and the function of the apparatus in Fig. 1 are the same as those of the apparatus in Fig. 10. However, a feature amount required for recognition is extracted from a voice signal input by the acoustic analyzing section 12 in Fig. 1, and proper mapping such as KL conversion or neural network is performed to the obtained feature amount to convert the feature amount into a feature amount having a high depress of separation. The feature amount is transmitted to the recognizing section 13. When the discrete type HMM method is used, the feature amount is transmitted to the recognizing section 13 after vector quantization is performed. In the recognizing section 13, by using the parameters of a model estimated on the basis of the feature amount which is obtained by acoustically analyzing voice data for learning in advance, a recognizing process is performed to unknown voice data. More specifically, as a learning process, the transition probability a ij and output probability b ij ( vk ) (b ij (y) when a continuous HMM is used) of an HMM determined on the basis of learning data in advance, and these values are stored in the parameter storing section 14. In the recognizing process, generation probabilities of models corresponding to words in a given dictionary are calculated for a feature amount obtained by acoustically analyzing an input unknown voice signal, and a word having the highest probability (score) or a plurality of words having upper probabilities are selected as recognition results. The obtained recognition results are transmitted to the output section 15. In the output section 15, the transmitted recognition results are displayed on a screen or output as sound. The output section 15 outputs commands for operating other units by using the recognition results. In the voice recognizing process described above, score calculation in the recognizing section 13 is performed among all the words in a given dictionary to an input unknown voice signal, i.e., in the set of recognition objective words . In recognition of small vocabulary, the process amount of the score calculation poses no problem. However, in recognition of intermediate or large vocabulary, the process amount of the score calculation poses serious problem. In order to solve this problem, recognition objective words are structured in advance as described above, and the number of words whose scores are calculated is reduced by using this structure. This is an object of the embodiment of the present invention, and is simply shown in Fig. 2. As described above, words whose scores need not be calculated are removed to reduce the process amount, i.e., arithmetic operation amount, of the recognizing unit. In order to determine the distribution structure of words suitable for the object, a distance scale to known the relationship among words is required. In the first embodiment of the present invention, the correlation value between words is defined by the expected value of a generation probability (score) of each model calculated by an actual voice signal. On the basis of the defined correlation value between words, recognition objective words are structured. However, when this scheme is used, actual voice data corresponding to the recognition objective words are required to calculate the distance scale between the words by expression (4). The actual voice data pose a serious problem in formation of a recognizing system having intermediate or large vocabulary. In the second embodiment of the present invention, a new distance scale between words is introduced in place of expression (4). <Correlation Value Between Words Using Parameters of HMM Model> As described in the formulation of the HMM, when a model λ = {A, B, π} is given, a symbol sequence Y = y 1 ·y 2 ···y T can be generated according to the parameters of this model. For example, when a discrete HMM is used, the symbol sequence can be generated as follows: Procedure 1. An initial state x0 = S i is selected according to the initial state probability π. Procedure 2. t = is set. Procedure 3. Transition from the state xt = S i to the state xt+1 = S j is selected according to the state transition probability a ij . Procedure 4. A symbol yt = vk output in transition from the state S i to the state S j is selected according to the output symbol probability b ij ( vk ). Procedure 5. When t < T, t = t + 1 is set, and return to the procedure 3; otherwise, the operation is ended. When the continuous HMM is used, in place of the procedure 4., the symbol yt is preferably determined according to the probability density distribution b ijl (y) given by expression (37) described above. Time at which state transition is performed is set to be t = 0, 1, 2,..., and the state obtained by transition at time t is represented by xt . In particular, when a left-to-right model shown in Fig. 13 is used, the initial and final states are limited to S 1 and S N , respectively. When the expected value of the number of times of self-transition in each state is calculated according to the transition probability a ij , one state transition sequence X '= x0 , x1 ,..., xT is determined. In this case, since a probability of occurrence of transition to the state S i after self transition is performed n times in the state S i is given by: a ii n a ij=a ii n (1- a ii ) the expected value of n is calculated by calculating: When the expression is calculated, the following expression can be obtained: E [n]= a ii /(1- a ii ) This expression will be proved. First, is set. This expression (47) is multiplied by a ii , and the following expression: is subtracted from expression (47), thereby obtaining the following expression: Therefore, according to expression (47), the following expression: E [n]= a ii /(1- a ii ) i.e., expression (46) is obtained. Therefore, for example, when a i1 = 0.5, E[n] = 1 is obtained; when a ii = 0.8, E[n] = 4 is obtained. In this case, since expression (46) sharply increases when a ii is close to 1, the following upper and lower limits are set to E[n]: 0≤ E [ n ]≤3 for example, approximation described in the following expression: may be performed. On the above calculation, the expected values of the number of times of self-transition is determined. When the expected values are connected to each other, one state transition sequence is determined. When a symbol vk having the highest output probability b ij ( vk ) is output, a corresponding symbol sequence can be obtained. For example, when the following transition probabilities: a 11 =0.5, a 12 =0.5, a 22 =0.8, a 23 =0.2, a 33 =0.3, ··· are given, if expression (52) is used, the state transition sequence determined as described above is as follows: S 1 , S 1 , S 2 , S 2 , S 2 , S 2 , S 3 , ··· More specifically, the first S 1 represents an initial state, and the next S 1 represents a state obtained such that self-transition determined by a 11 = 0.5 is performed once. Transition from the state S 1 to the state S 2 occurs, and self-transition is performed three times in the state S 2 according to a 22 = 0.8. Thereafter, transition from the state S 2 to the state S 3 occurs. In this manner, the state transition sequence is determined. According to the state transition sequence according to expression (54), a sequence of symbols vk which maximize the following expression: b 11 ( vk ), b 11 ( vk ), b 12 ( vk ), b 22 ( vk ), b 22 ( vk ), b 22 ( vk ), b 22 ( vk ), b 23 ( vk ),··· If the continuous HMM is used, by using the output probability obtained by expression (37) in place of b ij ( vk ) in expression (55), a sequence of symbols y which maximize the following expression: b 11 ( y ), b 11 ( y ), b 12 ( y ) b 22 ( y ), b 22 ( y ), b 22 ( y ), b 22 ( y ), b 23 ( y ),··· is preferably obtained. In particular, when the branch density b ijl (y) follows the normal distribution represented by expression (40), the symbol y which calculate the average value µ ijl of the branch density b ijl (y) with respect to 1 having the highest branch probability c ijl may be set. As described above, one symbol sequence Zi is obtained by a model λ j = {A j ,B j ,π j } corresponding to a certain word W j . At this time, a generation probability P(Z j |λ i ) of Z j with respect to a model λ i is calculated by expressions (23) and (24) or (25) or (26). In consideration of a method of generating Z j , the generation probability P(Z j |λ j ) with respect to the model λ j is expected to be very high. In this case, it is assumed that a preferable model λ i corresponding to each word, i.e., a model in which the generation probability of a symbol sequence obtained by acoustically analyzing a corresponding voice signal can be obtained. In this case, when a symbol sequence is generated by the model according to the above method, it is expected that the symbol sequence has characteristics similar to the symbol sequence obtained by acoustically analyzing a voice signal obtained by vocalizing the corresponding word. More specifically, when the model corresponding to a recognition objective word W j is represented by i j (l < j < p), the symbol sequence is expected to have the following characteristics: Characteristic 1. The model 1 i having the highest generation probability P(Z j |λ i ) with respect to the symbol sequence Z j generated by the model λ j of is the model λ j . Characteristic 2. When the generation probability P(Z j |λ i ) of the symbol sequence Z j generated by the model λ j according to the above method by using the model λ i whose generation probability P(Y j |λ i ) increases with respect to a symbol sequence Y j obtained by acoustically analyzing an actual voice signal corresponding to the word W j is calculated, the generation probability P(Z j |λ i ) similarly increases. Characteristic 3. When the generation probability P(Z j |λ i ) of the symbol sequence Z j generated by the model λ j according to the above method by using the model λ i whose generation probability P(Y j |λ i ) decreases with respect to a symbol sequence Y j obtained by acoustically analyzing an actual voice signal corresponding to the word W j is calculated, the generation probability P(Z j |λ i ) similarly decreases. When the symbol sequence obtained as described above, the correlation value between words can be defined as that of the first embodiment. A model corresponding to each recognition objective word W j (1 < j < p) is represented by λj. A symbol sequence generated by the model according to the above method is represented by Z j . At this time, the generation probability of Z j calculated by the model λ i is defined as a distance scale D(W j ,W i ) of the word W i with respect to the word W j . D ( W j ,W i )≡ P ( Z j |λ i ) ( i =1,2,···, p ) The generation probability P(Z j |λ i ) is normalized as follows: The correlation value between words is defined on the basis of the distance scale D(W j ,W i ) as in the first embodiment. More specifically, words W i (i = 1, 2,..., p) are sequentially arranged from a word which is close to the word W 1 , i.e., arranged in the order of increasing distance scale D(W 1 ,W i ). Similarly, the words W i (i = 1, 2,..., p) are sequentially arranged from a word which is close to the words W 2 , W 3 ,..., W p . The places of the words W i , i.e., the places of the words W i arranged from a word close to the words W j , are defined as a correlation value R(W j ,W i ) of the words W i to the words W j . More specifically, for example, a word W i which is closest to the words W j is defined as 1, a word W i which is secondly close to the words W j is defined as 2. Similarly, a word W i which is farthest from the words W j is defined as p. As a result, the correlation value is set to be an integer number from 1 to p, and it can be considered that the correlation value is inverse proportion to correlation. In this case, high correlation or a small correlation value R(W j ,W i ) means that the generation probability P(Y j k |λ i ) obtained by the model λ 1 of the words W i are expected to be high with respect to a feature amount Y j k calculated by acoustically analyzing an unknown voice signal X j k corresponding to the word W j . Low correlation or a large correlation value R(W j ,W i ) means that the generation probability P(Y j k |λ i ) obtained by the model λ i are expected to be low with respect to the feature amount Y j k . The above processes are integrated to obtain Fig. 14. The processes in Fig. 14 will be briefly described below. In step S141, a state transition sequence X j is determined in the transition probabilities of the models λ j corresponding to the words W j . According to this, in step S142, the symbol sequence Z j is determined on an output probability. In step S143, a distance scale D(W j ,W i ) is calculated by the generation probabilities of the models λ i corresponding to Z j . In step S144, on the basis of the distance scale D(W j ,W i ), the words W i are ordered from a word close to the words W j . On the basis of this order, correlation values R(W j ,W i ) are calculated in step S145. In this case, in the ordering in step S144, if there are words having the same place, the same correlation value is set for these words. As described above, the following method may also be used. That is, a state transition sequence is determined by using expression (46) or expression (52) described above in step S141. In step S142, a symbol sequence having the highest output probability is not calculated, but random numbers are generated, and, according to a transition probability and an output probability, a symbol sequence is generated with state transition. In this case, since any number of symbol sequences can be generated by the model λ j , these sequences are represented by Z j 1 , Z j 2 , Z j 3 ,..., and, by using the following expression: in place of expression (59) described above, the distance scale D(W j ,W i ) of the words W i with respect to the words W j is defined. When the correlation value between words is defined as described above, the correlation value can be calculated by only a model corresponding to a recognition objective word, and data of an actual voice signal corresponding to the recognition objective word is not necessarily required. In particular, when a model corresponding to each recognition objective word is constituted by connecting phoneme models, and actual voice signal data corresponding to the recognition objective word is not used to learn each phoneme model, the above effect can be effected. <Structuring of Recognition Objective Word> A method of structuring recognition objective words on the basis of the correlation value obtained by the above method is the same as that in the first embodiment described above, and a description thereof will be omitted. The score S(X,W i ) described above means a generation probability P(Y|λ i ) of a feature amount Y obtained by acoustically analyzing a voice signal X with respect to the model λ i . A recognizing method, estimation of a memory capacity, and estimation of an arithmetic operation amount are the same as those in the first embodiment described above, and a description thereof will be omitted. <Simulation Result> A result obtained by actually comparing recognition of 3,265 words performed by entire searching with recognition of 3,265 words performed by searching using structuring embodying the invention will be described below. As a method of structuring, a correlation value was calculated by using expression (57) as a distance scale between words, and the method of structuring used when the structuring of the recognition objective words was described was used. As a result, a search tree having four hierarchies in which the number of words in initial searching was set to be 231 was obtained, and the search tree had 11 (average number) paths which are connected from a certain word on a given hierarchy to words on the hierarchy under the given hierarchy. By using this search tree, a recognizing process was performed such that the number of words extracted on a certain hierarchy and having high scores. In a recognizing process by entire searching, a recognition rate was 9.02%, and the number of words whose scores were calculated was 3,265. In contrast to this, in a recognizing process using the above search tree, a recognition rate slightly decreased, i.e., 89.9%, and the number of words whose scores were calculated was a total of 508 words (average), i.e., 231 words in initial searching and 276 words in structural searching. More specifically, it was understood that a calculation amount in searching by a technique embodying the invention could be reduced by about 80% in comparison with entire searching. According to the second embodiment of the present invention, as in the first embodiment of the present invention described above, an arithmetic operation amount can be considerably reduced by limiting the number of recognition words, words whose scores are expected to be high are included in a searching range even if local searching is performed. Finally, distortion is rarely increased, and a decrease in recognition rate can be prevented. According to the second embodiment of the present invention, an HMM (Hidden Markov Model) serving as a probability model with respect to voice recognition objective words is prepared, and the correlation values R(W j ,W i ) between words can be calculated by the transition probability a ij and the output probability b ij ( vk ) (b ij (y) in continuous HMM) serving as parameters of the model. For this reason, a large amount of actual voice data corresponding to a recognition dictionary is not required, and a search tree can be efficiently obtained. The present invention is not limited to the embodiments described above. For example, the present invention is applied to a voice recognizing method or apparatus, and the present invention can also be easily applied to a method of forming a dictionary for voice recognition, a recording medium on which a dictionary for voice recognition, or the like. The present invention can be applied to graphic recognition or character recognition other than voice recognition. According to the above disclosure, voice recognition objective words are structured into a hierarchical structure or a tree structure which allows overlapping in advance, and the number of recognition words can be limited by searching for words according to the structure, so that an arithmetic operation amount can be considerably reduced. In addition, when a correlation value between new words is defined, and a method of structuring the recognition words on the basis of the correlation value is used, words whose scores are expected to be high are included in a searching range even if local searching is performed. Finally, distortion is rarely increased. More specifically, a recognition rate is rarely decreased. In addition, only path information whose amount is about 10 times the number of words is prepared as a memory capacity which is excessively required, and the memory capacity is relatively small. The present invention described above can be applied to graphic recognition, character recognition, or the like other than voice recognition. In this case, pattern recognition objects are generally used in place of voice recognition objective words, and these pattern recognition objects are hierarchically arranged into a hierarchical structure or a tree structure which allows overlapping. An HMM (Hidden Markov Model) serving as a probability model with respect to voice recognition objective words or pattern recognition objects is prepared, and the correlation values between words can be calculated by the parameters of this model. For this reason, a large amount of actual data such as actual voice data corresponding to a recognition dictionary is not required, and a search tree can be efficiently obtained.

Claims: A voice recognizing method in which a plurality of voice recognition objective words are given, and scores are added to the voice recognition objective words by using parameters which are calculated in advance for an unknown input voice signal, thereby extracting and recognizing a corresponding voice recognition objective word, characterized in that : the voice recognition objective words are structured into a hierarchical structure by using correlation values between the voice recognition objective words, and score calculation is performed on the unknown input voice signal by using a dictionary of the voice recognition objective words structured in the hierarchical structure; when a recognizing process is performed on an unknown voice signal by using the dictionary of the voice recognition objective words structured in the hierarchical structure, there are performed score calculation for voice recognition objective words of a hierarchy M in the hierarchical structure, score calculation for words of a hierarchy M-1 to which words determined on the basis of the previous score calculation and having high scores belong, score calculation for words of a hierarchy M-2 to which words determined on the basis of the previous score calculation belong, word extraction and score calculation being similarly performed as far as the lowest hierarchy, at least a word having the highest score being selected from the words whose scores have been calculated; and the scores of words whose scores have been temporarily calculated are stored, and, when score calculation is to be performed, the stored scores are used to prevent repetitive score calculation from being performed. A voice recognizing method according to claim 1, wherein, there are used, as correlation values between the voice recognition objective words, places obtained such that all the recognition objective words arranged in the order of increasing scores on the basis of values based on expected values of scores calculated by voice date corresponding to the recognition objective words. A voice recognizing method according to claim 1, wherein probability models for the plurality of voice recognition objective words are prepared, generation probabilities of the probability models are calculated with respect to the unknown input voice signal, a corresponding voice recognition objective word is extracted and recognized according to the generation probabilities, and a state transition sequence is determined on the basis of state transition probabilities of probability models corresponding to the voice recognition objective words, a symbol sequence is determined on the basis of an output symbol probability corresponding to the state transition, a generation probability of the obtained symbol sequence is calculated for models corresponding to the voice recognition objective words, and the voice recognition objective words are structured into a hierarchical structure by using correlation values between the voice recognition objective words based on the generation probability. A voice recognizing method according to claim 3, wherein a plurality of state transition sequences are determined on the basis of the probabilities of the probability models corresponding to the recognition objective words, a symbol sequence is determined from each state transition sequence on the basis of an output symbol probability corresponding to the state transition, generation probabilities of the plurality of obtained symbol sequences are calculated for the models corresponding to the words, these generation probabilities are calculated for the model corresponding to the words, all the voice recognition objective words are arranged in the order of increasing expected values of the generation probabilities, and places of the voice recognition objective words are used as the correlation values between the words. A method of forming information of pattern recognition objects used in a pattern recognizing method in which a plurality of pattern recognition objects are given, and scores are added to the pattern recognition objects by using parameters which are calculated in advance for an unknown input signal, thereby extracting and recognizing a corresponding pattern recognition objective word, characterized by : the step of grouping, on the basis of correlation values between the pattern recognition objects, the pattern recognition objects whose correlation values decrease, selecting pattern recognition objects serving as typical objects of groups, and performing grouping to form groups each having a relationship between a typical pattern recognition object and a set of pattern recognition objects belonging to the typical pattern recognition group; the step of causing pattern recognition objects which are not selected as typical objects of the groups, with respect to a pattern recognition object having a small correlation value and serving as a typical object of any group, to belong to the group of the typical pattern recognition object; and the step of newly performing grouping and adding to a group the typical pattern recognition objects obtained by performing the grouping step and adding to the groups described above, wherein these steps are repeated a predetermined number of times to structure the words into a hierarchical structure. A method according to claim 5, wherein, when pattern recognition objects whose correlation values decrease are grouped, grouping is performed from pattern recognition objects whose correlation values are minimum. A method according to claim 5, wherein a condition for determining whether the correlation value is small is moderated or made strict for each pattern recognition object in accordance with a state of the grouping. A method according to claim 5, wherein the pattern recognition is voice recognition, and the pattern recognition object is a voice recognition objective word. A voice recognizing apparatus in which a plurality of voice recognition objective words are given, and scores are added to the voice recognition objective words by using parameters which are calculated in advance for an unknown input voice signal, thereby extracting and recognizing a corresponding voice recognition objective word, characterized in that : the voice recognition objective words are structured into a hierarchical structure by using correlation values between the voice recognition objective words, and score calculation is performed on the unknown input voice signal by using a dictionary of the voice recognition objective words structured in the hierarchical structure; when a recognizing process is performed on an unknown voice signal by using the dictionary of the voice recognition objective words structured in the hierarchical structure, there are performed score calculation for voice recognition objective words of a hierarchy M in the hierarchical structure, score calculation for words of a hierarchy M-1 to which words determined on the basis of the previous score calculation and having high scores belong, score calculation for words of a hierarchy M-2 to which words determined on the basis of the previous score calculation belong, word extraction and score calculation being similarly performed as far as the lowest hierarchy, at least a word having the highest score being selected from the words whose scores have been calculated; and the scores of words whose scores have been temporarily calculated are stored, and, when score calculation is to be performed, the stored scores are used to prevent repetitive score calculation from being performed. A voice recognizing apparatus according to claim 9, wherein, there are used, as correlation values between the voice recognition objective words, places obtained such that all the recognition objective words arranged in the order of increasing scores on the basis of values based on expected values of scores calculated by voice date corresponding to the recognition objective words. A voice recognizing apparatus according to claim 9, wherein probability models for the plurality of voice recognition objective words are prepared, generation probabilities of the probability models are calculated with respect to the unknown input voice signal, a corresponding voice recognition objective word is extracted and recognized according to the generation probabilities, and a state transition sequence is determined on the basis of state transition probabilities of probability models corresponding to the voice recognition objective words, a symbol sequence is determined on the basis of an output symbol probability corresponding to the state transition, a generation probability of the obtained symbol sequence is calculated for models corresponding to the voice recognition objective words, and the voice recognition objective words are structured into a hierarchical structure by using correlation values between the voice recognition objective words based on the generation probability. A voice recognizing apparatus according to claim 11, wherein a plurality of state transition sequences are determined on the basis of the probabilities of the probability models corresponding to the recognition objective words, a symbol sequence is determined from each state transition sequence on the basis of an output symbol probability corresponding to the state transition, generation probabilities of the plurality of obtained symbol sequences are calculated for the models corresponding to the words, these generation probabilities are calculated for the model corresponding to the words, all the voice recognition objective words are arranged in the order of increasing expected values of the generation probabilities, and places of the voice recognition objective words are used as the correlation values between the words. A recording medium on which information of pattern recognition objects used in a pattern recognizing method is formed in accordance with any one of claims 5 to 8.

Inventors: MINAMINO KATSUKI, MINAMINO, KATSUKI, Minamino, Katsuki, Sony Corp., Intel. Prop. Dep.
Applicants: SONY CORP, SONY CORPORATION
Application year: 1996
Main classification: G10L15
IPC codes: G10L15