Pronunciation modeling using a finite-state transducer representation

被引:17
|
作者
Hazen, TJ [1 ]
Hetherington, IL [1 ]
Shu, H [1 ]
Livescu, K [1 ]
机构
[1] MIT, Comp Sci & Artificial Intelligence Lab, Cambridge, MA 02139 USA
关键词
D O I
10.1016/j.specom.2005.03.004
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
The MIT SUMMIT speech recognition system models pronunciation using a phonemic baseform dictionary along with rewrite rules for modeling phonological variation and multi-word reductions. Each pronunciation component is encoded within a finite-state transducer (FST) representation whose transition weights can be trained using an EM algorithm for finite-state networks. This paper explains the modeling approach we use and the details of its realization. We demonstrate the benefits and weaknesses of the approach both conceptually and empirically using the recognizer for our JUPITER weather information system. Our experiments demonstrate that the use of phonological rewrite rules within our system achieves word error rate reductions between 4% and 9% over different test sets when compared against a system using no phonological rewrite rules. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:189 / 203
页数:15
相关论文
共 50 条
  • [1] PRONUNCIATION MODELING Automatic Learning of Finite-state Automata
    Pastor, Moises
    Casacuberta, Francisco
    INTEGRATION OF PHONETIC KNOWLEDGE IN SPEECH TECHNOLOGY, 2005, 25 : 133 - 148
  • [2] A Weighted Finite-State Transducer Implementation of Phoneme Rewrite Rules for English to Korean Pronunciation Conversion
    Koo, Hahn
    COMPUTATIONAL LINGUISTICS AND RELATED FIELDS, 2011, 27 : 202 - 208
  • [3] A finite-state morphological transducer for Kyrgyz
    Washington, Jonathan North
    Ipasov, Mirlan
    Tyers, Francis M.
    LREC 2012 - EIGHTH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION, 2012, : 934 - 940
  • [4] Guessers for Finite-State Transducer Lexicons
    Linden, Krister
    COMPUTATIONAL LINGUISTICS AND INTELLIGENT TEXT PROCESSING, 2009, 5449 : 158 - 169
  • [5] Finite-state transducer based modeling of morphosyntax with applications to Hungarian LVCSR
    Szarvas, M
    Furui, S
    2003 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL I, PROCEEDINGS: SPEECH PROCESSING I, 2003, : 368 - 371
  • [6] Finite-state transducer for Amazigh verbal morphology
    Ataa Allah, Fadoua
    DIGITAL SCHOLARSHIP IN THE HUMANITIES, 2016, 31 (01) : 21 - 29
  • [7] Klex: A finite-state transducer lexicon of Korean
    Han, Na-Rae
    Finite-State Methods and Natural Language Processing, 2006, 4002 : 67 - 77
  • [8] PROTOCOL REPRESENTATION WITH FINITE-STATE MODELS
    DANTHINE, AAS
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1980, 28 (04) : 632 - 643
  • [9] POLYNOMIAL REPRESENTATION OF FINITE-STATE MACHINES
    HUNT, BR
    IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1969, SSC5 (01): : 94 - &
  • [10] FINITE-STATE TRELLIS REPRESENTATION OF CPM
    LIYANAPATHIRANA, R
    EKANAYAKE, N
    ELECTRONICS LETTERS, 1992, 28 (02) : 108 - 109