Pattern adaptation system using tree scheme

Abstract: Pattern matching means (3) matches categories of a reference pattern stored in reference pattern memory means (2) and input samples of an input pattern produced by input pattern generating means (1). Data statistics estimating means (6) calculates the numbers of input samples in individual nodes of a tree scheme reference pattern stored in the tree scheme reference pattern memory means (4). Node selecting means (76) selects nodes used for adaptation according to the input sample numbers calculated by the data statistics estimating means (5). Adaptation parameter generating means (7) calculates an adaptation parameter in the Nodes selected by the node selecting means (6). Reference pattern generating means (8) produces an adapted reference pattern using the calculated adaptation parameter.

Description: BACKGROUND OF THE INVENTION The present invention relates to a pattern recognition system and, more particularly, to a pattern adaptation system for adapting "a reference pattern" constituted by a plurality of different categories by using "an input pattern" as an aggregate of input samples". The best field of utilization of the present invention is the speaker adaptation system in a speech recognition system based on an HMM (Hidden Marcov model) of mixed continuous distribution model type or the like in which the reference pattern output probability distribution is a mixed Gaussian distribution. Recently, researches and investigations concerning mechanical recognition of speech patterns have been made, and various methods (speech recognition methods) have been proposed. A typical one of these methods which is extensively applied is based on a method called DP (dynamic programming) matching or HMM. Particularly, in the field of speech recognition system using HMM, speaker-independent speech recognition systems which is capable of recognition of the speech of any person, has recently been extensively studied and developed. The speaker-independent recognition system has an advantage over the speaker-dependent recognition system, which is used by a definite user, in that the user need not register any speech in advance. However, the following problems in the speaker-independent recognition system are pointed out. A first problem is that the system is inferior in the speaker-dependent recognition system for almost all speakers. A second problem is that the recognition performance is greatly deteriorated for particular speakers (unique speakers). In order to solve these problems, researches and investigations have recently been started, which concern application of the speaker adaptation techniques used mainly in speaker-dependent recognition systems to speaker-independent recognition systems as well. The speaker adaptation techniques have a concept of adapting a speech recognition system to new users (i.e., unknown speakers) by using less amounts of adaptation data than used for the training. The speaker adaptation techniques are detailed in Sadaoki Furui, "Speaker Adaptation Techniques in Speech Recognition", Television Study Association, Vol. 43, No. 9, 1989, pp. 929-934. The speaker adaptation can be classified into two methods. One is "supervised speaker adaptation", and the other is "unsupervised speaker adaptation". The supervised signal means a vocal sound expression series representing speech contents of an input speech. The "supervised speaker adaptation" thus refers to an adaptation method in case where the vocal sound expression series for the input speech is unknown, and requires preliminary instruction of speech vocabularies to the unknown speaker for adaptation. The "unsupervised adaptation", on the other hand, is an adaptation method used when the vocal sound expression series for the input speech is known, and requires no limit on the speech contents of input speech to the unknown speaker; no speech vocabulary has to be instructed to the unknown speaker. Actually, adaptation using input speech as the subject of speech recognition is permitted without the unknown speaker sensing that the adaptation is being done. Generally, the recognition rate based on "unsupervised adaptation" after the adaptation is low compared to that based on the "supervised adaptation". For this reason, the "supervised adaptation" is presently used frequently. The document Kosaka et al., "Tree-stuctured speaker clustering for speaker-independent continuous speech recognition", Proceedings of International Conference on Spoken Language Processing (ICLSP '94), vol. 3, 18-22 September 1994, Yokohama, JP, pages 1375-1378, XP002049795, discloses an unsupervised speaker adaptation method for speaker-independent speech recognition based on tree-structured speaker clustering. From the above viewpoint, the need for the speaker adaptation system in the speech recognition system is increasing. The "adaptation" techniques as described are important not only in speech recognition systems but also in pattern recognition systems, the concept of which involves the speech recognition system. The "speaker adaptation system" in the speech recognition system can be generalized as the "pattern adaptation system" in the pattern recognition system. In the prior art pattern adaptation systems of the type as described, adaptation is executed in the same mode irrespective of whether the number of input samples for adaptation is large or small. Therefore, when the input samples are less in number, insufficient data amount may deteriorate the accuracy of parameter estimation for the pattern adaptation. The process of the speech recognition system, which are most extensive applications of the present invention, will now be described by taking a speech recognition system using HMM as an example, and speaker adaptation techniques in such speech recognition system will also be mentioned with reference to Fig. 4. Speaker's speech (i.e., input speech) is supplied to an input pattern generating means 42 for conversion to a feature vector time series for each unit called a frame having a certain time length through such processes as analog-to-digital conversion and speech analysis. The "feature vector time series" is referred to as an input pattern. The time length of the frame is usually 10 to 100 ms. The feature vectors are obtained by extracting the feature quantity of speech spectrum at corresponding instants, usually 10- to 100-dimensional. HMM is stored as a reference pattern in a reference pattern memory means 41. The HMM is one of speech (sound) information source models, and its parameters may be trained by using input speech. The HMM will be mentioned in the description of a recognition means 43 given hereinunder. The HMM is usually prepared for each recognition unit. Here, a case where the recognition unit is a sound element is taken as an example. In the speaker-independent recognition system, stored in the recognition pattern memory means 41 is HMM previously obtained for unknowm speaker through training of speeches of many speakers. A case is now assumed, where 1,000 words are subjects of recognition, that is, a case where a right answer of one word is obtained among recognition candidates of 1,000 words. For word recognition, HMMs of individual sound elements are coupled together to produce an HMM of a recognition candidate word (word HMM). When 1,000 words are recognized, word HMMs for 1,000 words are produced. The recognition means 43 recognizes the input pattern using the word HMMs. The "pattern recognition" will now be described. In the HMM, a statistical concept is introduced into the description of the reference pattern to cope with various sways of the speech pattern. The HMM is detailed in Seiichi Nakagawa, "Speech Recognition with Probability Models", the Electronic Information Communication Engineer's Association, 1987 (hereinafter referred to as Literature 1), pp. 40-44, 55-60 and 69-74. Each sound element HMM usually comprises 1 to 10 states and inter-state transitions. Usually, the start and last states are defined, and a symbol is taken out from each state for every unit time for inter-state transition. The speech of each sound element is expressed as a time series of symbols produced from individual states during the inter-state transition interval from the start state to the last state. For each state the symbol appearance probability (output probability) is defined, and for each inter-state transition the transition probability is defined. The HMM thus has an output probability parameter and a transition probability parameter. The output probability parameter represents a sound color sway of the speech pattern. The transition probability parameter represents a time-wise sway of the speech pattern. The generation probability of speech from the model (i.e., HMM) thereof, can be obtained by setting the start state probability to a certain value and multiplying the value by the output probability and also by the transition probability for each inter-state transition. Conversely, when a speech is observed, its generation probability can be calculated by assuming that it is generated from a certain HMM. In the HMM speech recognition, an HMM is prepared for each recognition candidate, and upon input of speech the generation probability thereof is obtained in each HMM. The maximum generation probability HMM is determined to be a source of generation, and the recognition candidate corresponding to that HMM is made to be the result of recognition. The output probability parameter is expressed by a discrete probability distribution expression and a continuous probability distribution expression. Here, a case where the continuous probability distribution expression is adopted, is taken as an example. The continuous probability distribution expression uses a mixed continuous distribution, i.e., a distribution obtained by adding together a plurality of Gaussian distributions with weighting. The output probability parameter, the transition probability parameter and such parameters as the weighting of a plurality of Gaussian distribution, are preliminarily given a training speech with respect to model and trained with an algorithm called Baum-Welch algorithm. The Baum-Welch algorithm is detailed in Literature 1. The process of the word recognition of the input pattern will now be described mathematically. Input pattern X which is expressed as a time series of feature vectors is given as X = x 1 , x 2 , ···, x t , ···, x T wherein T represents a total number of input patterns x. Recognition candidate words are denoted by W 1 , W 2 , ..., W N . The number of recognition candidate words is denoted by N. Matching between the word HMM of each word W n and the input pattern X is made as follows. Subscripts are omitted unless they are needed. In the word HMM, the transition probability from state j to state i is denoted by α ji , the mixture weight of the output probability distribution by λ im , each element Gaussian distribution mean vector in the output probability distribution by µ im , and the covariance matrix of the output probability distribution by Σ im . t denotes the instant of input, i and j denote the states of HMM, and m denotes the mixed element serial number. The following recurrence formula calculation concerning forward probability α(i, t) is expressed. α(i, 0) = π i i = 1, ···, I α(i, t) = Σα(j, t-1) a ji b i (x t ) i = 1, ···, I; t = 1, ···, T wherein π i represents a probability with initial state i, and b i (x t ) and N(x t ; µ im , Σ im ) are represented bt the following formurae. b i (x t ) = Σ m λ im N(x t ; µ im , Σ im ) N(x t ; µ im , Σ im ) = (2π) -n/z |Σ im | -1/2 exp(-(µ im -x t ) Σ im -1 (µ im -x t )/2) Likelihood P n (X) for the input pattern W n is obtainable as: P n (X) = α (I, T) wherein I represents a final state. Through execution of this processing for the word HMM of each word, recognized word W n is given as: n = argmax n P n (X) Such recognition result words are suppleid from the recognition means 43 to the recognition result output means 44. A recognition result output means 44 executes such processes as outputting recognition result words to a display and sending control commands corresponding to recognition result words to different systems or apparatuses. In the speaker adaptation by a speaker adaptation means 45 (see broken line arrow in Fig. 4), the reference pattern in the reference pattern memory means 41 is corrected to provide improvement of the performance with respect to unknown speakers. Specifically, the training using speaker's speech when the speech recognition system is used is allowed for the adaptation of the reference pattern to the speaker, thus providing high recognition rate. In this case, the adaptation process is not changed in dependence on whether the data amount of the input speech (i.e., number of input samples) are great or less, and a certain number of input samples is necessary for adequate speaker adaptation. In the prior art pattern adaptation system described above, with less input samples the accuracy of the parameter estimation for the pattern adaptation is deteriorated due to the insufficient data amount, resulting in insufficient effect of the reference pattern adaptation. For example, in the speaker adaptation system in the speech recognition system, in case of very small input speech data amount the parameter estimation accuracy is deteriorated due to the insufficient data amount, so that an adequate effect of the speaker adaptation of the reference pattern can not be obtained, that is, the recognition performance is not improved. SUMMARY OF THE INVENTION In the light of the above circumstances, it is an object of the present invention to provide a pattern adaptation system with a tree scheme, in which the concept of the reference pattern tree scheme is introduced to determine a tree scheme hierarchical layer as the subject of adaptation according to the data amount (i.e., number of input samples), thus preventing the parameter estimation accuracy deterioration in case of insufficient data amount and permitting fine reference pattern updating (production of an adapted reference pattern) according to the data amount. In the pattern adaptation system with a tree scheme according to the present invention, for adapting a reference pattern constituted by a plurality of different categories by using an input pattern as an aggregate of input samples, the input pattern generating means produces the input pattern. The reference pattern memory means stores the reference pattern. The pattern matching means matches the caterogies of the reference pattern stored in the reference pattern memory means and input samples of the input pattern produced by the input pattern generating means. The tree scheme reference pattern memory means previously stores the tree scheme reference pattern which is a reference pattern expressed in a tree scheme. The data amount estimating means calculates the number of input samples in each node of the tree scheme reference pattern in the tree scheme reference pattern memory means. The node selecting means selects the node used for the adaptation according to the number of input samples calculated by the data amount estimating means. The adaptation parameter generating means calculates (i.e., produces) an adaptation parameter in the node selected by the node selecting means. The reference pattern generating means produces an adapted reference pattern by using the adaptation parameter produced by the adaptation parameter generating means and updates the reference pattern. The invention further provides a pattern adaptation method according to claim 10. Other objects and features will be clarified from the following description with reference to attached drawings. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a block diagram showing an embodiment of the present invention applied to a pattern adaptation system using a tree scheme; Fig. 2 is a flow chart illustrating the process of the embodiment of the pattern adaptation system using the tree scheme; Fig. 3 is a view showing an example of a tree scheme reference pattern used in the embodiment of the pattern adaptation system using the tree scheme; and Fig. 4 is a block diagram of a pattern adaptation system using a tree scheme. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will now be described in detail in conjunction with an embodiment thereof with reference to the drawings. Fig. 1 is a block diagram showing an embodiment of the present invention applied to a pattern adaptation system using a tree scheme. This embodiment of the pattern adaptation system using a tree scheme corresponds to the "speaker adaptation system" in the speech recognition system. The speaker adaptation system using the tree scheme embodying the present invention, comprises an input pattern generating means 1, a reference pattern memory means 2, a pattern matching means 3, a tree scheme reference pattern memory means 4, a data amount estimating means 5, a node selecting means 6, an adaptation parameter generating means, and a reference pattern generating means 8. Fig. 2 is a flow chart illustrating the process of the embodiment of the pattern adaptation system using the tree scheme (i.e., the process in adaptation). The process comprises an input pattern generation step 201, a pattern matching step 202, a buffer value accumulation step 203, a difference vector calculation step 204, a node selection step 205, an adaptation vector calculation step 206, and a reference pattern updating step 207. Fig. 3 is a view showing an example of a tree scheme reference pattern used in the embodiment of the pattern adaptation system using the tree scheme (i.e., a reference pattern expressed as a tree scheme in the tree scheme reference pattern memory means 4). The operation of the pattern adaptation system using the tree scheme will now be described. In this embodiment, and generally according to the present invention, the words or sentences to be spoken for the speaker adaptation are preliminarily instructed to the user, and HMM parameters are updated (adapted) by using word expression and input speech. This adaptation belongs to the category of "supervised adaptation" noted above in the sense that correct words of speech are known beforehand. The data amount (i.e., number of input samples) should be made as small as possible in order to alleviate the speaker's burden. However, the number of HMM parameters is generally large, and if all the parameters are to be adapted with a small amount of input speech for adaptation, the data amount may be insufficient, deteriorating the accuracy of parameter estimation and recognition performance. In this embodiment, among the HMM parameters the mean vectors of output probability distribution are selected as a parameter to be adopted. The mean vectors are selected as the adaptation subject parameter in that they are thought to have the greatest influence among the HMM parameters on the recognition performance. The operation of the embodiment of the pattern adaptation system using the tree scheme will now be described. The operation will be described in succession as (1) preamble operation to the adaptation, and (2) adaptation operation. (1) Preamble operation to the adaptation: Firstly, a reference pattern that is stored in the reference pattern memory means 2 will be described. As the reference pattern, an initial HMM is prepared. The initial HMM may, for instance, be an indefinite speaker's speech element HMM which has been prepared in advance from speeches of many speakers. Such initial HMM is stored in the reference pattern memory means 2. Secondly, a tree scheme reference pattern that is stored in the tree scheme pattern memory means 4 will be described. A tree scheme of reference pattern (tree scheme reference pattern) is produced in advance from the reference pattern stored in the reference pattern memory means 2. Here, the aggregate of all the states of the mean vectors in the initial HMM are considered, and an N-layer tree scheme of the mean vector group is produced. Specifically, the distance between mean vectors is defined, and the mean vectors corresponding to the individual states are clustered according to the definition. In this operation, nodes representing the mean vectors corresponding to the individual states (corresponding to leaf nodes) and upper layer nodes based on the clustering are produced. A tree scheme having these nodes is thus produced (see Fig. 3). A method of producing a tree scheme concerning Gaussian distribution is detailed in Japanese Patent Laid-Open Publication No. Heisei 6-348292 entitled "Speech Recognition System" (hereinafter referred to as Literature 2). Fig. 3 shows an example of such tree scheme reference pattern. In this tree scheme reference pattern, the total number of distributed subjects is 1,500, and N is 5. The mean vectors shown by the nodes (leaf nodes) in the lowermost layer (i.e., N-th, here 5-th, layer) individually correspond to the respective states of the HMM, and they are referred to as leaf vectors. The vectors shown by the notes in the intermediate (i.e., 1-st to (N-1)th, here 1-st to 4-th, tree scheme layers are referred to as node vectors. Such tree scheme reference pattern is stored in the tree scheme reference pattern memory means 4. Thirdly, buffers which are prepared for the process in the data statistics estimating means 4 (i.e., buffers used for estimating the data amount of the number of input samples) will be described. A buffer A(n, m) with the dimensions of feature vectors and a uni-dimensional buffer B(n, m) for adding the feature vectors are prepared. Here, n represents the hierarchical layer order number (i.e., n-th order) in the tree scheme, and m represents the order number of node in the n-th layer. The buffers A and B accumulate data necessary for the updating mean vector for every input sound (i.e., every sound of input speech). These buffers A and B are controlled by the data amount estimating means 5. As will be described later, the contents in the buffers A and B are updated for every input speech. When a series of input speeches (i.e., input samples) for adaptation have been inputted, the reference pattern stored in the reference pattern memory means 2 is updated (i.e., adapted) by using the contents in the buffers A and B. (2) Adaptation operation: In the adaptation of the reference pattern parameter (i.e., HMM state mean vectors in this embodiment), the following process is executed for every input sound (see Fig. 2). Firstly, like recognition process for which a description in connection to Fig. 4 is to be referred to, the input pattern generating means 1 generates an input pattern from the input speeches of each input speech (step 201). Secondly, the pattern matching means 3 executes pattern matching (i.e., derivation of the correspondence relation between the categories of the reference pattern and the input samples of the input pattern) through the following processes (1) to (3), thus obtaining leaf vectors corresponding to feature vectors at each instant (step 202). (1) Using correct word expressions, word HMMs corresponding to the input pattern are produced by coupling together initial HMMs of the individual sound elements. Then, pattern matching between the input pattern and the word HMMs is executed. In this operation, the leaf vectors in the tree scheme reference pattern are used as the individual state mean vectors. In this pattern matching, recurrence formulae based on the following Equations 8 to 11 are used in lieu of Equations 2, 3 and 6 in the recurrence formulae of Equations 2 to 7 noted before. Φ(i, 0) = πi i = 1, ···, I Φ(i, t) = max j Φ (j, t-1)a ji b i (x t ) i = 1, ···, I; t = 1, ···, T bi(x t ) = max m λ im b im (x t ) i = 1, ···, I; t = 1, ···, T; m = 1, ···, M P n (X) = Φ(I, T) The method using these formulae is called Vitarbi algorithm. Here, M is the number of distributed subjects in each state, and b im (x t ) is the appearance probability N(x t ; µ im , Σ im ) of distribution corresponding to the m-th leaf vector in state i. The distribution order numbers are provided such that they do not overlap in all the states. (2) Concurrently with the calculation on Equation 9 to derive Φ(i, t) noted above, calculation on Ψ 1 (i, t) = argmax j Φ(j, t-1) a ji b i (x t ) i = 1, ···, I; t = 1, ···, T Ψ 2 (i, t) = argmax m λ im b im (x t ) i = 1, ···, I; t = 1, ···, T is executed, and the states at instant preceding each instant are stored in an array Ψ 1 , while storing the distribution order numbers giving the maximum appearance probabilities in an array Ψ 2 . (3) After completion of the calculation on Equation 11 noted above for the last frame T has been ended, the mean vectors corresponding to the individual frames are obtained successively from the last to the first frame by using the arrays Ψ 1 and Ψ 2 Specifically, state number S(t) corresponding to frame t and leaf vector number R(t) are obtained from the following Equations S(T) = I S(t) = Ψ 1 (S(t+1), t+1) t = 1, ···, T-1 R(t) = Ψ 2 (R(t), t) t = 1, ···, T-1 This process is referred to as back-tracking. Through this process, the leaf vectors corresponding to feature vectors at individual instants are obtained. Thirdly, the data amount estimating means 5 estimates (i.e., calculates) the number of input samples (i.e., data amount of input speech) by accumulating the contents in the buffers A and B corresponding to the individual nodes (step 204). Specifically, the means 5 executes a process of obtaining A(N, R(t)) = A (N, R(t)) + (x t -µ m N ) B(N, R(t)) = B (N, R(t)) +1 for each feature vector x t at each instant, and adds together the contents in the buffers A and B corresponding to the leaf nodes. In Equation 17, µ m n represents the mean vector of the m-th node in the n-th layer. Likewise, for the nodes which have the leaf vectors R(t) as sub-nodes, the contents in the buffers A and B are added together as A(n, m) = A(n, m) + δ(m, j n (R(t))(x t -µ m n ) n = 1, ···, N-1 B(n, m) = B(n, m) + δ(m, j n (R(t))1 n = 1, ···, N-1 where j n (m) represents the serial numbers of the n-th layer nodes having leaf node m (i.e., m-th leaf node) as sub-nodes, and δ (i,j) is given as δ(i,j) = 1 if i=j = 0 if i≠j This process is executed repeatedly a number of times corresponding to the number of speech words to be adapted. In this way, the number of input samples (i.e., data amount of input speech) is calculated. In a fourth process after the process on the input speeches to be adapted, the adaptation parameter generating means 7 obtains difference vectors D for all the tree scheme reference pattern nodes as (step 204) D(n, m) = A(n, m)/B(n, m) When the data amount of the input speech (i.e., the number of input samples) are small, the number of input frames corresponding to the individual leaf nodes is very small. In such a case, the parameter estimation with a small number of input samples may rather deteriorate the recognition performance. Accordingly, it is suitable to provide a threshold value T for the content in the buffer B representing the number of input samples and adopt adaptation vectors Δ(m) corresponding to n'-th node given by the following equation in lieu of the adaptation vectors Δ(m) of the leaf vector in the lead node m. In other words, as adaptation vector Δ(m) is used the difference vector in the n'-th node, in which a relation B(n', m) > TB is met for the first time as during the operation executed for the successive nodes from lower to higher layer ones. n'= argmax n B(n, (j n (m)) (B(n, (j(m) < TB) n=1, ···, N Δ(m)= D(n', j n ' (m)) In a fifth process, the node selecting means 6 calculates n' in Equation 24 and selects node (n'-th layer node) to be adapted (i.e., used for the adaptation). In a sixth process, the adaptation parameter generating means 7 obtains adaptation vectors Δ(m) using Equation 25 according to the node selection by the node selecting means 6 (step 206). Through the above fifth and sixth processes, it is possible to estimate the adaptation vectors in a less data distribution situation from certain data amount. The upper layer node difference vector is obtained by averaging the lower layer node difference vectors and are thought to represent broader view changes in the vector space. Thus, in a less data situation or in a distribution situation without corresponding data, difference vectors representing broader view changes are used for adequate adaptation. Data amount increase of the input speech increases the data amount in each node. In this case, lower layer node difference vectors are used to obtain broader view, finer adaptation in the vector space. As the method of adaptation vector production, in addition to the above method of "selecting a node and making the difference vector of that node to be an adaptation vector", the following methods (1) and (2) are conceivable. (1) Method in which adaptation vectors of a plurality of upper and lower layer nodes are weighted for use. In this method, the adaptation vector Δ(m) is given as follows. Δ(m) = Σ n=1 N w(n) D(n, j n (m)) where W(n) is an adequate weight for the n-th layer nodes. It is possible to let information of data statistics of the individual layers on adaptation vectors as follows. Δ(m)= Σ n=1 N B(n, (j n (m))w(n)D(n, j n (m)) Σ n=1 N w(n) B (n, j n (m)) (2) Method in which the hierarchical layer with the adaptation vectors to be used is selected according to the input data amount for all the mean vectors In this method, the adaptation vector Δ (m) is obtained as follows. n'= argmax n Σ j B(n, j) (ΣB(n, j) > TB') n=1, ···, N Δ(m) = D(n', j n (m)) where TB represents a threshold value of data amount for all the nodes in the same layer. In a seventh process, the reference pattern generating means 8 calculates the leaf node mean vectors (leaf vectors) as follows using adaptation vectors produced in the above way, and updates the reference pattern stored in the reference pattern memory means 2 by using the leaf vectors thus obtained (i.e., produces an adapted reference pattern which is stored in the reference pattern memory means 2) (step 207). µ m = µ m + Δ(m) Lastly, modifications of the embodiment of the pattern adaptation system using the tree scheme will be described. The present invention can be realized by modifying the construction and operation of the embodiment as shown in below. The pattern matching means 3 in the embodiment uses a Vitarbi algorithm as a method of pattern matching. Instead, it is possible to use a method called a forward-backward algorithm. In this case, the numbers of data pieces are probability-based values, and real numbers are stored in the buffer B. Again in this case, adaptation by a method like that described above is possible. Again in this case, the pattern matching means 3 executes probability-based matching, and the data amount estimating means 5 calculates an expected input sample number which is used in lieu of the input sample. In another modification, Gaussian distribution mean vector difference vectors (i.e., adapted vectors based on the difference vectors) are used as the adaptation parameter. It is further possible adaptation in a system like that described above using other adaptation parameters, such as Gaussian distribution mean vectors, coefficients of weighting in the distributed state, differentials of these parameters, etc. Yet further, it is possible to obtain adaptation of the above parameters simultaneously in combination. In a further modification, the method described in Literature 2 is used to organize the tree scheme concerning the tree scheme reference pattern. This tree scheme organization method, however, is by no means limitative. For example, it is possible to use vocal sound similarities in the vocal sound theory. Furthermore, it is possible to use a probability-based tree scheme, in which the degrees to which sub-nodes belong to parent nodes are shown by real numbers of 0 to 1 and the sum of degrees to which a sub-node belongs to a plurality of parent nodes is 1. Literature 2 describes recognition using tree scheme. When using the method shown in Literature 2 as recognizing means, it is possible to obtain improvement of the recognition performance using tree scheme by making the tree scheme that is used to be the same as tree scheme used for the adaptation. A still further modification uses a method, in which the reference pattern updating is made after operation concerning all the input speeches (i.e., input of the input speech) has been ended. However, it is readily possible to update reference pattern by executing the process described above for every sound, i.e., every input of input speech (progressive adaptation). As has been described in the foregoing, according to the present invention the hierarchical layer in the reference pattern tree scheme for the adaptation parameter (such as adaptation vectors) is determined according to the data amount ((i.e., input sample number), thus preventing the parameter estimation accuracy deterioration in case of less data amount and also permitting fine reference pattern updating (adapted reference pattern production) corresponding to the data amount. For example, when the present invention is applied to a speaker adaptation system in a speech recognition system, the accuracy of parameter estimation in HMM or the like is not deteriorated in case of less speaker's speech amount (input speech data statistics), and it is possible to obtain adequate speaker adaptation effects. Changes in construction will occur to those skilled in the art and various apparently different modifications and embodiments may be made without departing from the scope of the invention as defined by the appended claims. The matter set forth in the foregoing description and accompanying drawings is offered by way of illustration only. It is therefore intended that the foregoing description be regarded as illustrative rather than limiting.

Claims: A pattern adaptation system using a tree scheme for adapting a reference pattern constituted by a plurality of different categories based on an input pattern as an aggregate of input samples comprising: input pattern generating means (1) for generating the input pattern; reference pattern memory means (2) for storing the reference pattern; pattern matching means (3) for matching the categories of the reference pattern stored in the reference pattern memory means and input samples of the input pattern generated by the input pattern generating means; tree scheme reference pattern memory means (4) for storing beforehand a tree scheme reference pattern as a reference pattern expressed in a tree scheme; data amount estimating means (5) for calculating the number of input samples in each node of the tree scheme reference pattern stored in the tree scheme reference pattern memory means by using the correspondence obtained through the pattern matching by the pattern matching means; node selection means (6) for selecting a node for the adaptation according to the calculated number of the input samples by the data amount estimating means; adaptation parameter generating means (7) for calculating an adaptation parameter in a node selected by the node selecting means; and reference pattern generating means (8) for producing an adapted reference pattern by using the adaptation parameter produced by the adaptation parameter generating means and updating the reference pattern. The pattern adaptation system using a tree scheme according to claim 1, wherein the pattern matching means executes probability-based matching, and the data statistics estimating means calculates an expected input sample number, the expected input sample number being used in lieu of the input sample number. The pattern adaptation system using a tree scheme according to one of claims 1 or 2, wherein as the input pattern used is a time series of feature vectors obtained through analysis of the input speech is used. The pattern adaptation system using a tree scheme according to claim 3, wherein a hidden Marcov model in which the output probability distribution is a mixture Gaussian distribution is used as the reference pattern. The pattern adaptation system with a tree scheme according to claim 4, wherein the tree scheme reference pattern is a tree scheme reference pattern produced by taking considerations of output probability distribution mean vectors in individual stages of the hidden Marcov model is used. The pattern adaptation system with a tree scheme according to claim 1, wherein the tree scheme is based on vocal sound similarities in the vocal sound theory. The pattern adaptation system with a tree scheme according to claim 1, wherein the tree scheme is based on a probability-based tree scheme, in which the degrees to which sub-nodes belong to parent nodes are shown by real numbers of 0 to 1 and the sum of degrees to which a sub-node belongs to a plurality of parent nodes is 1. The pattern adaptation system with a tree scheme according to claim 1, wherein the reference pattern is updated after operation concerning all input speeches has been ended. The pattern adaptation system with a tree scheme according to claim 1, wherein the reference pattern is updated for every input of input speech. A pattern adaptation method using a tree scheme for adapting a reference pattern constituted by a plurality of different categories based on an input pattern as an aggregate of input samples, comprising the steps of matching the categories of a stored reference pattern and an input pattern, calculating the number of input samples in each node of a tree scheme reference pattern stored beforehand as a reference pattern expressed in a tree scheme by using the correspondance obtained through the matching step, selecting a node used for adaptation according to the calculated number of input samples, calculating an adaptation parameter in the selected node and producing an adapted reference pattern by using the calculated adaptation parameter.

Inventors: SHINODA KOICHI, SHINODA, KOICHI
Applicants: NIPPON ELECTRIC CO, NEC CORPORATION
Application year: 1996
Main classification: G10L15
IPC codes: C04B28, G10L15