# US 2002/0055842 A1 · Method for calculating HMM output probability and speech recognition apparatus

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2002/0055842 A1
- Document ID: US20020055842A1
- Status: Published application
- Kind: A1
- Application number: 09/955,164
- Filed: 2001-09-19
- Published: 2002-05-09
- Earliest claimed: 2000-09-20
- Assignees: Seiko Epson Corporation
- Inventors: Yasunaga Miyazawa
- Web page: https://patentgrep.com/patent/US20020055842A1

## CPC

- G10L 15/144: {Training of HMMs}
- G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING

## Abstract

The invention enables even a CPU having low processing performance to find an HMM output probability by simplifying arithmetic operations. The dimensions of an input vector are grouped into several sets, and tables are created for the sets. When an output probability is calculated, codes corresponding to the first dimension to n-the dimension of the input vector are sequentially obtained, and for each code, by referring to the corresponding table, output values for each table are obtained. By substituting the output values for each table for a formula for finding an output probability, the output probability is found.

## Claims

### Claim 1

A method for calculating an HMM output probability, comprising:
using a noncorrelative normal distribution as an output-probability distribution, in which, when an input vector at a time is represented by Y (Y has n-dimensional components, and n is a positive integer), dispersion in k dimensions (k is any natural number from 1 to n) in the case of states i to j is represented by σij(k), and an average in the k dimensions in the case of states i to j is represented by μij(k), a formula for finding the output probability being provided by: expression 1:
1 b ij ⁡ ( Y ) = ∏ k = 1 n ⁢ ( 1 2 ⁢ ⁢ π ⁢ ⁢ σ ij ⁡ ( k ) 2 ) 1 2 · e - ∑ k = 1 n ⁢ ⁢ [ { y k - μ ij ⁡ ( k ) } 2 2 ⁢ ⁢ σ ij 2 ⁡ ( k ) ] ( 1 )
using the logarithms of both sides thereof, by: expression 2:
2 log x ⁢ b ij ⁡ ( Y ) = log x ⁡ [ ∏ k = 1 n ⁢ ( 1 2 ⁢ ⁢ π ⁢ ⁢ σ ij 2 ⁡ ( k ) ) 1 2 ] ⏟ A - ∑ k = 1 n ⁢ [ { y k - μ ij ⁡ ( k ) } 2 2 ⁢ σ ij 2 ⁡ ( k ) ] · log x ⁢ e ⏞ B ′ ⏟ B ( 2 )
reducing the number of calculations of a calculation term represented by [{yk−μij(k)}2]/2σij(k)2·logxe in expression (2) by:
creating code books in which the values in dimensions of input vector Y at a time are represented by sets of representative values;
substituting the values in the dimensions (first to n-th dimensions) of input vector Y at said time by codes existing in said code books;
finding, based on the codes, the calculation term represented by [{yk−μij(k)}2]/2σij(k)2·logxe by referring to tables;
creating said tables for sets formed, such that among the first to n-th dimensions, dimensions capable of being treated as each set being collected, and in the table for each set, output values, found based on codes selected for the dimensions existing in the set, being found as total output values for combinations of all the codes, and the combinations of the codes being correlated with total output values obtained thereby;
based on the codes selected for the dimensions corresponding to one set, by referring to said tables, obtaining the total output values which correspond to the combinations of the code for the dimensions; and
calculating the output probability based on the total output values.

### Claim 2 (depends on 1)

The method for calculating an HMM output probability as set forth in claim 1, further including: when the numbers of codes in the dimensions in collections of the dimensions capable of being treated as each set are allowed to differ, collecting dimensions having identical numbers of codes to form each set.

### Claim 3

A speech recognition apparatus, comprising:
a characteristic analyzer which performs characteristic analyses on an input speech signal and which outputs an input vector at each point of time and components composed of a plurality of dimensions;
a scalar quantizer which replaces the components by predetermined codes by performing scalar quantization on received components for the dimensions from said characteristic analyzer;
an arithmetic processor which finds an output probability by using output values obtained by referring to tables which are created beforehand and uses the output probability to perform the arithmetic operations required for speech recognition; and
a speech-recognition processor which outputs the result of performing speech recognition based on the result of calculation performed by said arithmetic processor,
said tables being created for sets formed such that among the first to n-th dimensions, dimensions capable of being treated as each set are collected, and in the table for each set, output values, found based on codes selected for the dimensions existing in the set, being found as total output values for combinations of all the codes, and the combinations of the codes are correlated with total output values obtained thereby; and
based on the codes selected for the dimensions corresponding to one set, by referring to said tables, said arithmetic processor obtaining the total output values which correspond to the combinations of the code for the dimensions and calculating the output probability based on the total output values.

### Claim 4 (depends on 3)

The speech recognition apparatus as set forth in claim 3, when the numbers of codes in the dimensions in collections of the dimensions capable of being treated as each set are allowed to differ, dimensions having identical numbers of codes being collected to form each set.
