A pattern matching approach to connected-word recognition for Chinese

Author

Yuan, Bao-sheng ; Yu, Tie-cheng

Author_Institution

Inst. of Acoust., Acad. Sinica, Beijing, China

fYear

1988

Firstpage

490

Abstract

A speaker-dependent pattern-matching approach to connected word recognition for Chinese is presented. First, a method of adaptive energy normalization is applied to the speech spectrum, and a sound stimulus parameter is used to compress the normalized spectrum. Then, using a set of isolated word tokens as the reference patterns, a simplified dynamic programming-based matching strategy using a fast dynamic-time-warping alignment procedure is described. Experimental results for the recognition of a Chinese digit string (of unknown variable length from 2 to 5 digits), for two kinds of pronunciation (in standard Chinese and in the way used in telecommunication), are given. The correct string recognition rate is 96.8% and 97.6%, respectively

Keywords

dynamic programming; spectral analysis; speech recognition; Chinese; adaptive energy normalization; connected-word recognition; dynamic programming; fast dynamic-time-warping alignment; pattern matching approach; pronunciation; speech recognition; speech spectrum; string recognition rate; word tokens; Artificial intelligence; Decision trees; Dynamic programming; Error analysis; Pattern matching; Pattern recognition; Speech recognition; Telecommunication standards; Testing; Vocabulary;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 1988., 9th International Conference on

Conference_Location

Rome

Print_ISBN

0-8186-0878-1

Type

conf

DOI

10.1109/ICPR.1988.28275

Filename

28275