A Composition Algorithm of Compact Finite-State Super Transducers for Grapheme-to-Phoneme Conversion
暂无分享,去创建一个
[1] Mehryar Mohri,et al. Finite-State Transducers in Language and Speech Processing , 1997, CL.
[2] Jerneja Zganec-Gros,et al. SI-PRON Pronunciation Lexicon: a New Language Resource for Slovenian , 2006, Informatica.
[3] Simon Dobrisek,et al. FST-Based Pronunciation Lexicon Compression for Speech Engines , 2012 .
[4] Hermann Ney,et al. Structure learning in hidden conditional random fields for grapheme-to-phoneme conversion , 2013, INTERSPEECH.
[5] Stefan Hahn,et al. Comparison of Grapheme-to-Phoneme Methods on Large Pronunciation Dictionaries and LVCSR Tasks , 2012, INTERSPEECH.
[6] Maja Skrjanc,et al. Automatic Lexical Stress Assignment of Unknown Words for Highly Inflected Slovenian Language , 2002, TSD.
[7] Hermann Ney,et al. Joint-sequence models for grapheme-to-phoneme conversion , 2008, Speech Commun..
[8] Johan Schalkwyk,et al. OpenFst: A General and Efficient Weighted Finite-State Transducer Library , 2007, CIAA.
[9] Grzegorz Kondrak,et al. Letter-Phoneme Alignment: An Exploration , 2010, ACL.
[10] Mehryar Mohri,et al. Minimization algorithms for sequential transducers , 2000, Theor. Comput. Sci..