DC Field | Value | Language |
---|---|---|
dc.contributor.author | o. w. kwon | ko |
dc.contributor.author | c. k. un | ko |
dc.date.accessioned | 2013-02-27T18:41:05Z | - |
dc.date.available | 2013-02-27T18:41:05Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1995-09 | - |
dc.identifier.citation | ELECTRONICS LETTERS, v.31, no.19, pp.1630 - 1631 | - |
dc.identifier.issn | 0013-5194 | - |
dc.identifier.uri | http://hdl.handle.net/10203/70168 | - |
dc.description.abstract | In a Korean connected digit recogniser, duration modelling is necessary to reduce insertion and deletion errors due to monophonemic digits, which cannot usually be corrected even by discriminative training algorithms. In the Latter the authors incorporate context-dependent word duration modelling directly in a decoding algorithm to reduce those errors. While incorporating duration information in the postprocessing stage shows little improvements over a baseline system, the proposed method reduces word error rates by similar to 10% for unknown length decoding when both maximum likelihood estimation and generalised probabilistic descent training are used. | - |
dc.language | English | - |
dc.publisher | Inst Engineering Technology-Iet | - |
dc.subject | HIDDEN MARKOV-MODELS | - |
dc.title | Context-Dependent Word Duration Modeling for Korean Connected Digit Recognition | - |
dc.type | Article | - |
dc.identifier.wosid | A1995RW64200010 | - |
dc.identifier.scopusid | 2-s2.0-0029378196 | - |
dc.type.rims | ART | - |
dc.citation.volume | 31 | - |
dc.citation.issue | 19 | - |
dc.citation.beginningpage | 1630 | - |
dc.citation.endingpage | 1631 | - |
dc.citation.publicationname | ELECTRONICS LETTERS | - |
dc.contributor.localauthor | c. k. un | - |
dc.contributor.nonIdAuthor | o. w. kwon | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | SPEECH RECOGNITION | - |
dc.subject.keywordAuthor | HIDDEN MARKOV MODELS | - |
dc.subject.keywordPlus | HIDDEN MARKOV-MODELS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.