Copy
Minoru SHIGENAGA, Yoshihiro SEKIGUCHI, "Speech Recognition of Connectedly Spoken FORTRAN Programs" in IEICE TRANSACTIONS on transactions,
vol. E62-E, no. 7, pp. 466-473, July 1979, doi: .
Abstract: A speech recognition system for programs written in FORTRAN level is described. The acoustic analyser based on a psychological model for phoneme identification can represent the speech sound by a phoneme string which contains some acoustic features such as buzz and silence. Therefore a word, its corresponding item of the word dictionary, is readily expressed in Roman letters accompanied with some acoustic features. The linguistic processor, using global acoustic information in addition to linguistic one, can effectively restrict the number of candidate words. The recognition process has been executed for each block; here, a block is a part of speech uttered in a breath. A new method for matching the input symbol string with errors to the reference symbol strings is also described. The system contains 146 words including letters. The syntax is expressed by state transition diagrams and implemented using tables. It has a back-tracking function. The recognition score is about 91% in terms of blocks when FORTRAN programs are spoken by 3 adult males. Since we cannot yet classify some letters such as P and T, the system has some restrictions of use.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e62-e_7_466/_p
Copy
@ARTICLE{e62-e_7_466,
author={Minoru SHIGENAGA, Yoshihiro SEKIGUCHI, },
journal={IEICE TRANSACTIONS on transactions},
title={Speech Recognition of Connectedly Spoken FORTRAN Programs},
year={1979},
volume={E62-E},
number={7},
pages={466-473},
abstract={A speech recognition system for programs written in FORTRAN level is described. The acoustic analyser based on a psychological model for phoneme identification can represent the speech sound by a phoneme string which contains some acoustic features such as buzz and silence. Therefore a word, its corresponding item of the word dictionary, is readily expressed in Roman letters accompanied with some acoustic features. The linguistic processor, using global acoustic information in addition to linguistic one, can effectively restrict the number of candidate words. The recognition process has been executed for each block; here, a block is a part of speech uttered in a breath. A new method for matching the input symbol string with errors to the reference symbol strings is also described. The system contains 146 words including letters. The syntax is expressed by state transition diagrams and implemented using tables. It has a back-tracking function. The recognition score is about 91% in terms of blocks when FORTRAN programs are spoken by 3 adult males. Since we cannot yet classify some letters such as P and T, the system has some restrictions of use.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Speech Recognition of Connectedly Spoken FORTRAN Programs
T2 - IEICE TRANSACTIONS on transactions
SP - 466
EP - 473
AU - Minoru SHIGENAGA
AU - Yoshihiro SEKIGUCHI
PY - 1979
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E62-E
IS - 7
JA - IEICE TRANSACTIONS on transactions
Y1 - July 1979
AB - A speech recognition system for programs written in FORTRAN level is described. The acoustic analyser based on a psychological model for phoneme identification can represent the speech sound by a phoneme string which contains some acoustic features such as buzz and silence. Therefore a word, its corresponding item of the word dictionary, is readily expressed in Roman letters accompanied with some acoustic features. The linguistic processor, using global acoustic information in addition to linguistic one, can effectively restrict the number of candidate words. The recognition process has been executed for each block; here, a block is a part of speech uttered in a breath. A new method for matching the input symbol string with errors to the reference symbol strings is also described. The system contains 146 words including letters. The syntax is expressed by state transition diagrams and implemented using tables. It has a back-tracking function. The recognition score is about 91% in terms of blocks when FORTRAN programs are spoken by 3 adult males. Since we cannot yet classify some letters such as P and T, the system has some restrictions of use.
ER -
English
