Plausibility Functions in Continuous Speech Recognition : {The} {VINICS} System
Identifieur interne : 001225 ( Crin/Curation ); précédent : 001224; suivant : 001226Plausibility Functions in Continuous Speech Recognition : {The} {VINICS} System
Auteurs : Y. Gong ; J.-P. HatonSource :
- Speech Communication ; 1993.
English descriptors
Abstract
We propose a new approach to phoneme-based continuous speech recognition when a time function of plausibility of observing each phoneme is given. We introduce a criterion for best sentence, related to the sum of plausibilities of individual symbols composing the sentence. Based on the idea of making use of a high plausibility region to reduce the computation load while keeping optimality, our method finds the most plausible sentences relating to the input speech, given the plausibility \mua,n of observing each phoneme a at each time slot n. Two optimization procedures are defined to deal with the following embedded search processes\, : (1) find the best path connecting peaks of the plausibility functions of two successive symbols, and (2) find the best time transition slot index for two given peaks. Dynamic programming is used in these two procedures. Since the best path finding algorithm does not search slot by slot, the recognition is highly efficient. Experimental results with the VINICS system show that the method gives a better recognition precision while requiring about 1/20 computing time, compared to traditional DP based methods. The experimental system obtained a 95========percnt; sentence recognition rate on a speaker-dependent test.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001225
Links to Exploration step
CRIN:gong93dLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="519">Plausibility Functions in Continuous Speech Recognition : {The} {VINICS} System</title></titleStmt><publicationStmt><idno type="RBID">CRIN:gong93d</idno><date when="1993" year="1993">1993</date><idno type="wicri:Area/Crin/Corpus">001225</idno><idno type="wicri:Area/Crin/Curation">001225</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001225</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Plausibility Functions in Continuous Speech Recognition : {The} {VINICS} System</title><author><name sortKey="Gong, Y" sort="Gong, Y" uniqKey="Gong Y" first="Y." last="Gong">Y. Gong</name></author><author><name sortKey="Haton, J P" sort="Haton, J P" uniqKey="Haton J" first="J.-P." last="Haton">J.-P. Haton</name></author></analytic><series><title level="j">Speech Communication</title><imprint><date when="1993" type="published">1993</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>neural networks</term><term>phoneme recognition</term><term>speech recognition</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="4626">We propose a new approach to phoneme-based continuous speech recognition when a time function of plausibility of observing each phoneme is given. We introduce a criterion for best sentence, related to the sum of plausibilities of individual symbols composing the sentence. Based on the idea of making use of a high plausibility region to reduce the computation load while keeping optimality, our method finds the most plausible sentences relating to the input speech, given the plausibility \mua,n of observing each phoneme a at each time slot n. Two optimization procedures are defined to deal with the following embedded search processes\, : (1) find the best path connecting peaks of the plausibility functions of two successive symbols, and (2) find the best time transition slot index for two given peaks. Dynamic programming is used in these two procedures. Since the best path finding algorithm does not search slot by slot, the recognition is highly efficient. Experimental results with the VINICS system show that the method gives a better recognition precision while requiring about 1/20 computing time, compared to traditional DP based methods. The experimental system obtained a 95========percnt; sentence recognition rate on a speaker-dependent test.</div></front></TEI><BibTex type="article"><ref>gong93d</ref><crinnumber>93-R-229</crinnumber><category>1</category><equipe>RFIA</equipe><author><e>Gong, Y.</e><e>Haton, J.-P.</e></author><title>Plausibility Functions in Continuous Speech Recognition : {The} {VINICS} System</title><journal>Speech Communication</journal><year>1993</year><volume>13</volume><number>1-2</number><pages>187-196</pages><month>Oct</month><keywords><e>speech recognition</e><e>neural networks</e><e>phoneme recognition</e></keywords><abstract>We propose a new approach to phoneme-based continuous speech recognition when a time function of plausibility of observing each phoneme is given. We introduce a criterion for best sentence, related to the sum of plausibilities of individual symbols composing the sentence. Based on the idea of making use of a high plausibility region to reduce the computation load while keeping optimality, our method finds the most plausible sentences relating to the input speech, given the plausibility \mua,n of observing each phoneme a at each time slot n. Two optimization procedures are defined to deal with the following embedded search processes\, : (1) find the best path connecting peaks of the plausibility functions of two successive symbols, and (2) find the best time transition slot index for two given peaks. Dynamic programming is used in these two procedures. Since the best path finding algorithm does not search slot by slot, the recognition is highly efficient. Experimental results with the VINICS system show that the method gives a better recognition precision while requiring about 1/20 computing time, compared to traditional DP based methods. The experimental system obtained a 95========percnt; sentence recognition rate on a speaker-dependent test.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001225 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 001225 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Curation
|type= RBID
|clé= CRIN:gong93d
|texte= Plausibility Functions in Continuous Speech Recognition : {The} {VINICS} System
}}
| This area was generated with Dilib version V0.6.33. |  |