Premium
Continuous speech recognition without end‐point detection
Author(s) -
Segawa Osamu,
Takeda Kazuya,
Itakura Fumitada
Publication year - 2006
Publication title -
electrical engineering in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.136
H-Index - 28
eISSN - 1520-6416
pISSN - 0424-7760
DOI - 10.1002/eej.20140
Subject(s) - speech recognition , computer science , decodes , voice activity detection , decoding methods , word (group theory) , point (geometry) , block (permutation group theory) , speech processing , frame (networking) , algorithm , artificial intelligence , mathematics , telecommunications , geometry
A new continuous speech recognition method that does not need explicit speech end‐point detection is proposed. A one‐pass decoding algorithm is modified to decode the input speech of infinite length so that, with appropriate nonspeech models for silence and ambient noises, continuous speech recognition can be executed without explicit end‐point detection. The basic algorithm (1) decodes a processing block of the predetermined length, (2) backtraces and finds the boundaries of the processing blocks where the word history in the preceding processing block is merged into one, and (3) restarts decoding from the boundary frame with the merged word history. The effectiveness of the method is verified by spoken dialogue transcription experiments. With a 5‐minute dialogue in a moving car, the proposed method gives better results in word accuracy than the results using the explicit end‐point detection method and the conventional one‐pass decoder. © 2006 Wiley Periodicals, Inc. Electr Eng Jpn, 156(4): 43–50, 2006; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20140