Technique for adaptation of hidden Markov Models for speech recognition

Abstract: A speech recognition system learns characteristics of speech by a user during a learning phase to improve its performance. Adaptation data derived from the user's speech and its recognized result is collected during the learning phase. Parameters characterizing hidden Markov Models (HMMs) used in the system for speech recognition are modified based on the adaptation data. To that end, a hierarchical structure is defined in an HMM parameter space. This structure may assume the form of a tree structure having multiple layers, each of which includes one or more nodes. Each node on each layer is connected to at least one node on another layer. The nodes on the lowest layer of the tree structure are referred to as "leaf nodes." Each node in the tree structure represents a subset of the HMM parameters, and is associated with a probability measure which is derived from the adaptation data. In particular, each leaf node represents a different one of the HMM parameters, which is derivable from the probability measure associated with the leaf node. This probability measure is a function of the probability measures which are associated with the nodes connected to the leaf node, and which represent "hierarchical priors" to such a probability measure.

Description: Field of the Invention The invention relates to speech recognition systems and methods, and more particularly to systems and methods for recognizing speech based on hidden Markov models (HMMs), which are adapted to acoustic inputs during a learning phase of speech recognition. Background of the Invention In communication, data processing and similar systems, a user interface using audio facilities is often advantageous especially when it is anticipated that the user would be physically engaged in an activity (e.g., driving a car) while he/she is operating one such system. Techniques for recognizing human speech in such systems to perform certain tasks have been developed. In accordance with one such technique, input speech is analyzed in signal frames, represented by feature vectors corresponding to phonemes making up individual words. The phonemes are characterized by hidden Markov models (HMMs), and a Viterbi algorithm is used to identify a sequence of HMMs which best matches, in a maximum likelihood sense, a respective concatenation of phonemes corresponding to an unknown, spoken utterance. It is well known that each HMM comprises model parameters, e.g., mixture components which are characterized by Gaussian distributions. In a learning phase in a speech recognition system, the HMMs are adapted to input speech by a user to adjust to the particular speech characteristics of the user, thereby increasing accuracy of the speech recognition. In prior art, two well known approaches for adaptation of HMMs, namely, the Bayesian adaptation approach and the transformation based approach, have been employed. According to the Bayesian adaptation approach, prior distributions are assumed for the model parameters in HMMs, and the maximum a posteriori (MAP) estimates for the model parameters are calculated. For details on this approach, one may refer to: C. Lee et al., "A study on Speaker Adaptation of the Parameters of Continuous Density Hidden Markov Models," IEEE Transactions on Signal Processing , Vol. 39, No. 4, April 1991, pp. 806-814; and J. Gauvain et al., "Maximum a Posteriori Estimation for Multivariate Gaussian Mixture Observations of Markov Chains," IEEE Transactions on Speech and Audio Processing , Vol. 2, No. 2, 1994, pp. 291-298. Since the Bayesian adaptation approach utilizes the MAP estimates based on knowledge of prior distributions, it requires less input speech data for the adaptation than, e.g., one utilizing maximum likelihood (ML) estimates which does not rely on any such knowledge. However, if the adaptation data is scarce, the transformation based approach may be more effective than the Bayesian adaptation approach to adapt the HMMs. According to the transformation based approach, a transformation, e.g., a shift or an affine transformation, is defined in an acoustic feature space, also known as an "HMM parameter space," to explore correlations between different HMMs, and such correlations help adapt the HMMs despite the scarcity of the adaptation data. Parameters characterizing the transformation are estimated using the adaptation data. In implementing the transformation based approach, it is desirable to divide the acoustic feature space into a number of subspaces and estimate the transformation parameters in each subspace. However, the performance of speech recognition using the transformation based approach does not significantly improve with an increasing amount of adaptation data as any improvement is restricted by the limited number of variable transformation parameters used in the approach. An attempt to combine the Bayesian adaptation approach with the transformation based approach to improve the speech recognition performance has been made. This attempt is described in: Chien et al., "Improved Bayesian Learning of Hidden Markov Models for Speaker Adaptation," ICASSP-97 , 1997, pp. 1027-1039. However, the success of such an attempt relies on the requirement that the number of subspaces in the acoustic feature space be optimized for various amounts of adaptation data, which is usually impractical. Accordingly, there exists a need for combining the Bayesian adaptation approach with the transformation based approach in a feasible manner to improve the speech recognition performance, regardless of the amount of available adaptation data. Paul D B: "Extensions to Phone-State Decision-Tree Clustering: Single Tree and Tagged Clustering" IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP),US, Los Alamitos, IEEE Comp. Soc. Press,1997, pages 1487-1490, XP000822740 ISBN: 0-8186-7920-4 describes building a single decision tree by clustering a plurality of separate, individual decision trees. The single tree clustering structure combines all allophone states of all phones into a single tree to improve performance of speech recognition systems. Each separate decision tree tracks each individual state of each phone. Among the several steps in generating a single decision tree, a splitting step is included where each leaf node is split in two according to questions concerning the phone's context and selecting the best split by the largest increase in the log-likelihood of the data. Summary of the Invention Methods and apparatus according to the invention are as set out in the independent claims. Preferred forms are set out in the dependent claims. In accordance with the invention, the HMMs in a speech recognition system are adapted during a learning phase using a "structural maximum a posteriori (SMAP)" approach. According to this inventive approach, a hierarchical structure, e.g., a tree structure, having multiple levels is constructed in an HMM parameter space. Such a structure is characterized by transformation parameters associated with different levels of the structure. The transformation parameters associated with a level represent prior knowledge, referred to as "hierarchical priors," for the transformation parameters associated with the levels therebeneath. The transformation parameters associated with each level of the structure are estimated based on the adaptation data, and hierarchical priors from the levels thereabove. The HMM parameters are updated based on the transformation parameters associated with the lowest level of the structure, which thus are a function of at least the transformation parameters associated with a level other than the lowest level. Advantageously, given an amount of available adaptation data, the inventive SMAP approach effectively combines the Bayesian adaptation approach, characterized by use of the aforementioned hierarchical priors, with the transformation based approach, characterized by use of the aforementioned hierarchical structure, to synergistically effect the adaptation of HMMs. Brief Description of the Drawing In the drawing, Fig. 1 is a block diagram of a speech recognition system in accordance with the invention; Fig. 2 illustrates a hierarchical structure whereby HMMs in the system of Fig. 1 are adapted during its learning phase; and Fig. 3 is a flow chart depicting an algorithm for constructing the hierarchical structure of Fig. 2. Detailed Description Fig. 1 illustrates speech recognition system 100 embodying the principles of the invention. As shown in Fig. 1, system 100 includes a number of functional blocks including analog-to-digital (A/D) convertor 103, feature extractor 105, end-point detector 113, speech recognizer 117, word model processor 125, switch 139 and delay element 141. The functionality of each block of system 100 may be performed by a respective different processor, or the functionality of several or all blocks may be performed by the same processor. Furthermore, each stage can include multiple processing elements. The stages are pipelined and their operations are performed in a synchronous manner. Specifically, input speech including a sequence of spoken words is provided, through a microphone (not shown), to A/D convertor 103 in system 100. Convertor 103 in a conventional manner samples the input speech. The digital samples are then provided to feature extractor 105. Upon receiving the digital samples, feature extractor 105 organizes the received samples in speech frames of, say, 20 ms long, and derives for each frame a measure of energy in the frame and a set of short spectrum vectors, e.g., linear-predictive-coding (LPC) parameters. In this instance, the LPC parameters specify a spectrum of an all-pole model which best matches the signal spectrum over a period of time in which the frame of speech samples are accumulated. Based on the LPC parameters, extractor 105 produces a feature vector per frame, which comprises, for example, twelve cepstral features, twelve delta-cepstral features and a delta-energy feature. In a well-known manner, these cepstral and delta-cepstral features characterize the spectrum and its time variation of the speech frame. The delta-energy feature indicates an amount of change in energy in the speech frame from the previous frame. End-point detector 113 of conventional design uses the delta energy feature, in conjunction with the energy measure by feature extractor 105, to determine the beginning and end of a speech signal. It then passes data signals containing the 25 features in each feature vector onto speech recognizer 117 of conventional design, along with any end-point determinations. Based on such data signals and word models provided by word model processor 125 in accordance with the invention, recognizer 117 determines what the spoken words are. Processor 125, among other things, provides hidden Markov models (HMMs), e.g., continuous density (CD) HMMs in this instance, for various spoken words. Based on the Viterbi algorithm, recognizer 117 identifies an optimum sequence of CDHMMs which best matches, in a maximum likelihood sense, a respective concatenation of phonemes corresponding to an unknown spoken utterance. Such an identification process is realized by dynamic programming in a conventional manner. It should be noted at this point that system 100 operates in two modes, namely, a learning mode and a normal operation mode. In the normal operation mode, which is the current mode, switch 139 is set at a first position to relay a series of recognized words from recognizer 117 to the output of system 100. During the manufacture of system 100, all of the model parameters of the CDHMMs in processor 125 are predefined in a conventional manner using training data representing samples of speech from many speakers. However, when a user initially uses system 100 for speech recognition, system 100 undergoes the learning mode where the CDHMMs are adapted to the user's input speech to adjust to his/her particular speech characteristics, thereby further increasing the recognition accuracy of system 100. In implementing unsupervised learning in this instance, switch 139 is set at a second position in the learning mode to feed the series of recognized words from recognizer 117 back to processor 125, and the input speech corresponding to the recognized words. According to the unsupervised learning, the input speech is uncontrolled and the user is not restricted to speak only certain words as in supervised learning. In the learning mode, delay element 141 imparts a proper amount of delay to the input of recognizer 117 representing the input speech to synchronize it with the corresponding recognized words. Processor 125 uses the input of recognizer 117 and the corresponding recognized words as "adaptation data" to adapt the CDHMMs therein. In accordance with the invention, the HMMs in a speech recognition system, e.g., system 100, are adapted during the learning phase using a "structural maximum a posteriori (SMAP)" approach. According to this inventive approach, a hierarchical structure, e.g., a tree structure, having multiple levels is constructed in an HMM parameter space, also known as an "acoustic feature space." Such a structure is characterized by transformation parameters associated with different levels of the structure. The transformation parameters associated with a level represent prior knowledge, referred to as "hierarchical priors," for the transformation parameters associated with the levels beneath, or subordinate to, that level. The transformation parameters associated with each level of the structure are estimated based on the adaptation data, and aggregate hierarchical priors from the levels thereabove. The estimated transformation parameters associated with the lowest level of the hierarchical structure are used to update the HMM parameters in the learning phase. As a result, such updated HMM parameters are a function of a combination of all of the transformation parameters connected to the structure, which are weighted according to the respective levels associated therewith. The weight for each level varies with the amount of adaptation data used. The updated HMM parameters are used by processor 125 in system 100 to provide the HMMs, in particular, CDHMMs, during its normal operation mode for speech recognition as described before.. In order to fully appreciate the adaptation of HMMs in accordance with the invention, a normalization technique which simplifies the adaptation will now be described. Let G = {g m ; m = 1,..., M} and be the set of all mixture components of the CDHMMs in processor 125, where M represents the total number of mixture components in all the states of all the CDHMMs in processor 125, and g m represents a normal density function for a mixture component m. This normal density function is denoted N(X|µ m , S m ), where µ m represents a means vector and S m represents a covariance matrix. Let X = {x 1 ,..., x t ... , x T } and denote a set of T given observation vectors, which represents the adaptation data. In the normalization, each sample vector x t is transformed into a vector y mt for each mixture component m as follows: y mt = S -1/2 m ( x t -µ m ), where t = 1, ..., T and m = 1,..., M. As mentioned before, all of the CDHMM parameters here have been predefined in a conventional manner using training data derived from samples of speech from many speakers during the manufacture of system 100. Where there is no mismatch between the training data and adaptation data, it is apparent that the probability density function (pdf), or probability measure, for Y m = {y ml , ..., y mt ..., y mT } may be represented by the standard normal distribution N(Y|O, I), where O represents a vector whose components have zero values, and I represents an identity matrix. Otherwise, where there is a mismatch between the training data and adaptation data, the pdf for Y m may be generically represented by N(Y|υ,η), where µ ≠ O and η ≠ I. A "mismatch pdf" is defined below to represent the differences between the acoustic characteristics depicted by the training data and those depicted by the adaptation data. It can be shown that the number of mismatch pdfs required to model the acoustic differences is smaller than that of the pdfs for mixture components of HMMs. Thus, to reduce the number of required pdfs, the set of mixture components, G, is divided into more than one subset G p , 1 ≤ p ≤ P, where P is the total number of subsets which is smaller than the total number of mixture components, i.e., M. A common mismatch pdf h p = N(Y|υ p ,η p ) is shared by all the mixture components in each subset G p . In the following discussion, each mixture component g in subset G p is renumbered as g 1 (p) , ..., g m (p) ..., g Mp (p) , where M p represents the number of mixture components in subset G p . The observed vector sequence X = {x 1 , ..., x T } is normalized to X = {y ml (p) , ..., y mT (p) } for mixture components g m (p) . The parameters for the mismatch pdfs are estimated using the well known estimation-maximization (EM) algorithm. When the transition probabilities and the mixture component weight coefficients are specified, the auxiliary function Q for the HMM parameters is given by: where Θ = {µ m (p) , S m (p) ; m = 1, ..., M p and p = 1, ..., P} representing the current HMM parameter set; Θ and = {µ and m (p), S and m (p) ; m = 1, ... M p and p = 1, ...P} representing the HMM parameter set to be estimated; and γ mt (p) represents the posterior probability of using mixture component g m (p) at time t. The relation between the HMM parameters and the mismatch pdf parameters is established as follows: where J m (p) = (S m (p) ) 1/2 representing the Jacobian matrix for the normalization expressed in [1]. Based on expression [3], the auxiliary function may be modified as follows: By differentiating function [4], the maximum likelihood (ML) estimates of the mismatch pdf parameters can be defined as where (y mt (p) - p ) t represents the transpose of (y mt (p) - p ). Using these mismatch pdf parameters, the corresponding HMM parameters can be updated as follows: where µ and m (p) and S and m (p) represent the updated mean and covariance, respectively. The optimal number of mismatch pdfs for deriving the corresponding HMMs varies with the amount of available adaptation data. We have recognized that a methodology which utilizes the mismatch pdf parameters as transformation parameters for constructing the aforementioned hierarchical structure, and which takes advantage of both its entire structure and sub-structures is preferable to achieve a good speech recognition performance with any given amount of adaptation data. To that end, a tree structure for the set G is realized in accordance with the invention. Fig. 2 illustrates one such tree structure, denoted 200. As shown in Fig. 2, tree structure 200 has H levels, where H is an integer greater than zero. The first level of structure 200 consists of root node 203 which represents the set G containing all M mixture components of the CDHMMs. The H th level of structure 200 consists of M leaf nodes representing the M mixture components of the CDHMMs, respectively. Each intermediate node or non-terminal node between the first level and the H th level represents a subset of G, i.e., G p , containing M p mixture components respectively represented by those M p leaf nodes or terminal nodes on the H th level which are subordinate to the intermediate node. A leaf node is said to be subordinate to an intermediate node if the leaf node "emanates" from that intermediate node, or in other words its origin can be traced back to that intermediate node through intervening paths. For example, in structure 200, the leaf nodes which are subordinate to intermediate node 222 are leaf nodes 231, 233 and 235 as they are connected to node 222 through paths 224, 226 and 228, respectively. Similarly, the leaf nodes which are subordinate to intermediate node 211 are leaf nodes 231, 233, 235, 237, 239, 241, 243, 245 and 247. Of course, root node 203 has each leaf node on the H th level subordinate thereto. The methodology for constructing structure 200 is described in detail below. For each node N in tree structure 200, a mismatch pdf, which is shared by the mixture components in G p represented by the node, is assigned thereto. Specifically, for each node N, the ML estimates of the mismatch pdf parameters, p and p , are determined using the adaptation data based on expressions [5] and [6]. Without loss of generality, let's estimate the parameter set  m = (µ m , S m ) for each mixture component m in G. For the sake of convenience, it should be noted that in the ensuing discussion, the subscript "m" of each variable associated with the mixture component m is dropped except where a confusion may arise without such a subscript. In tree structure 200, each sequence of connected nodes with one node from each level, including root node 203 and a leaf node, corresponds to a mixture component represented by the leaf node. Let the sequence of connected nodes corresponding to the mixture component m be denoted {N 1 , ..., N k , ..., N H }, where N 1 denotes root node 203; N k denotes one of the intermediate nodes in the sequence; and N H denotes the leaf node representing the mixture component m. Let λ k = (µ k , η k ) and represent the set of pdf mismatch parameters associated with node N k . The parameter set, λ k , is determined by maximizing the posterior probabilities described below, given a sequence of feature vectors, Y. It should be noted that once λ k is determined, the HMM parameter set  is readily obtained using expressions [7] and [8] above. In accordance with the inventive SMAP approach, the set {λ 0 , λ 1 , ... λ k ..., λ H-1 } is used as the aforementioned "hierarchical priors" for λ H , where λ 0 = (O, I). The mismatch pdf parameter set λ 0 is assumed to be the prior for the parameter set λ 1 associated with root node 203, and the parameter set λ k associated with node N k is used as the prior for the parameter set λ k+1 associated with its immediately subordinate node or child node, N k+1 . The posteriori distribution for λ k may be expressed as follows: where p(λ k , λ k-1 , Y) = p(Y |λ k )p( λ k |λ k-1 ) ∫ p(Y |λ k )p( λ k |λ k-1 )d λ k , where k = H, ..., 1. Two approximations are employed here to simplify the evaluation of the posteriori distribution of [9]. The first approximation using the probability given by the maximum a posteriori (MAP) estimates is expressed as follows : ∫ p(λ 1 | λ 0 ,Y)p(λ 0 )dλ 0 _ p(λ 1 | λ 0 ,Y) ; ∫ p(λ k+1 |λ k ,Y)p(λ k | λ k-1 ,Y)dλ k _p( λ k+1 | λ k ,Y) , where λ 0 = λ 0 ; λ k = argmax λk p( λ k | λ k-1 , Y) = argmax λk p(Y | λ k )p(λ k | λ k-1 ) . The second approximation is expressed as follows: p(Y | λ k )_ _ (Y | λ k ) , With these approximations, the MAP estimates of the mismatch pdf parameters for each node N k can be determined as follows: ν 0 = 0 η 0 = I where G k is a subset of G represented by node N k ; ( k , k ) represents ML estimates for (µ k ,η k ). The parameters ψ > 0, and ξ > 1 are standard control parameters. By successively applying expressions [18] and [19] from the root node N 1 to a leaf node N H along the node sequence, the mean µ H and the variance η H for the leaf node N H are obtained. These µ H and η H are used as µ P and η P , respectively in expressions [7] and [8] to update the mixture components, in accordance with the inventive SMAP approach. It should be noted that expression [18] can be rewritten for the leaf node N H as follows: where From expression [21], the mean estimate µ H in accordance with SMAP approach can be envisioned as the weighted sum of the ML estimates k at different levels of tree structure 200. It should also be noted that at node N k , the more adaptation data available, the larger is Γ k , and thus w k . In addition, the weight w k for k at node N k decreases exponentially with the value of k. Thus, when the amount of available adaptation data is relatively small, the ML estimates k corresponding to upper levels of tree structure 200 dominate in the mean estimate of [21]. On the other hand, when the amount of available adaptation data is relatively large, the ML estimates k corresponding to lower levels thereof dominate in such a mean estimate. The methodology for construction of tree structure 200 will now be described. The a priori knowledge about the embedded structure in the acoustic feature space should be used for the construction of tree structure 200 for the set of all mixture components, G. The tree construction is based on the methodology described, e.g., in: T. Watanabe et al., "Speech Recognition Using Tree-Structured Probability Density Function, " Proc.of ICSLP-94 , 1994, pp. 223-226. In this tree construction, a well known Kullback divergence between pdfs of the mixture components is used as the distance measure between the mixture components. Accordingly, the distance d(m,n) between two mixture components, say, g m and g n , is determined as follows: where σ m (i) represents the i th diagonal element of covariance S m . A node pdf is assigned to each node of tree structure 200. The pdf parameters for node N k to which mixture components g m (k) = N(X|µ m (k) ,S m (k) ) belong, m = 1, ..., M k , are given as follows: Fig. 3 illustrates conventional k-means clustering algorithm 300 for clustering the mixture components. According to this algorithm, the number of branches from each node and the number of levels in tree structure 200 are predetermined, and the clustering is recursively carried out. Specifically, root node 203 is initially set to be node n, as indicated at step 305. At step 308, it is determined whether node n has any child nodes. If node n has no child node, algorithm 300 comes to an end. Otherwise, if node n has one or more child nodes, initial pdfs are assigned to the child nodes, respectively, using the well known min-max method, as indicated at step 311. At step 315, the set of mixture components represented by node n is divided among the child nodes by calculating the distances between the child node pdfs and the mixture components using expression [23]. Each mixture component is assigned to a child node whose pdf is closest to the mixture component. A pdf is then calculated at step 318 for each child node of node n based on expressions [24] and [25]. For each child node, the sum of the distances from the child node pdf to the mixture components represented by the child node is computed. The respective sums of distances for all of the child nodes of node n are added, resulting in a grand sum. It is then determined whether such a grand sum converges, as indicated at step 321. If the grand sum does not converge, algorithm 300 returns to step 315. Otherwise, if it converges, each child node is set to be a node n, as indicated at step 322. For each new node n, algorithm 300 returns to step 308. The foregoing merely illustrates the principles of the invention. It will thus be appreciated that a person skilled in the art will be able to devise numerous systems which, although not explicitly shown or described herein, embody the principles of the invention and are thus within its spirit and scope. For example, in the disclosed embodiment, the learning by speech recognition system 100 is unsupervised. That is, the speech provided by a user for the learning is uncontrolled. However, it will be appreciated that such learning may be supervised, in which the user may be allowed to speak only certain pre-selected words for the learning.

Claims: A method for use in an apparatus for recognizing selected speech based on acoustic models, the method comprising defining a hierarchical structure which includes a plurality of levels, each level having one or more nodes thereon, each level in the structure arranged higher than every other level having a smaller number of nodes thereon than the other level, the method CHARACTERIZED BY : modifying the acoustic models in response to selected data representing a sample of the selected speech , each node being associated with a probability measure which is determined based on at least the selected data, each node on each level having two or more nodes thereon being connected to a node on a second level higher than the level having two or more nodes thereon, the probability measure associated with each node on each level having two or more nodes thereon being a function of at least the probability measure associated with the node connected thereto on the second level, the acoustic models being modified based on at least the probability measure associated with each node on a selected level. The method of claim 1 wherein the acoustic models are characterized by a plurality of parameters, each node representing a set containing one or more of the parameters. The method of claim 2 wherein the selected level is arranged furthest in the direction of all of the levels, each node on the selected level representing a set containing a different one of the plurality of parameters. The method of claim 3 wherein the probability measure assigned to each node on the selected level is used to modify the parameter in the set represented by the node. The method of claim 3 wherein the set represented by each node on a level other than the selected level includes the sets represented by the nodes on the selected level which are connected to the node. A method for use in a system for recognizing selected speech based on acoustic models, which are characterized by a plurality of parameters, the method comprising: providing selected data representing a sample of the selected speech; defining a structure which includes a plurality of levels, each level including one or more nodes, each node being associated with a respective probability measure which is derived from at least the selected data; identifying at least one sequence of nodes from different levels; and CHARACTERIZED BY modifying at least one of the parameters based on at least the probability measure associated with a selected node in the sequence, the probability measure associated with the selected node being a function of the probability measure associated with a second node in the sequence. The method of claim 6 wherein the levels in the structure are arranged in order in a direction, a level arranged further in the direction including a larger number of nodes, the selected node being from the level arranged furthest in the direction of all of the levels. The method of claim 6 wherein the probability measure associated with the selected node is also a function of at least one weight for scaling the probability measure associated with the second node in the sequence, the weight varying with a position of the level where the second node is from, relative to positions of other levels in the structure. The method of claim 8 wherein the weight also varies with an amount of the data. The method of any of the preceding claims wherein the acoustic models are in accordance with hidden Markov models. The method of claim 10 wherein the hidden Markov models include continuous density hidden Markov models. The method of any of the preceding claims wherein the or each probability measure is derived also from second data representing a sample of at least second speech. The method of claim 12 wherein the or each probability measure is determined based on a difference between the sample of the first speech and that of the at least second speech, the difference being a function of the first and second data. The method of any of the preceding claims wherein the acoustic models are modified based in response also to a recognized version of the sample of the speech. Apparatus for recognizing speech based on acoustic models, said apparatus comprising means adapted and arranged to carry out each step in a method as claimed in any of the preceding claims.

Inventors: CHIN-HUI LEE, KOICHI SHINODA, CHIN-HUI, LEE, KOICHI, SHINODA
Applicants: LUCENT TECHNOLOGIES INC, LUCENT TECHNOLOGIES INC.
Application year: 1998
Main classification: G10L15
IPC codes: G10L15