NEAR MINIMAL WEIGHTED WORD GRAPHS FOR POST-PROCESSING SPEECH
暂无分享,去创建一个
[1] Hermann Ney,et al. Word graphs: an efficient interface between continuous-speech recognition and language understanding , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[2] Mehryar Mohri,et al. Finite-State Transducers in Language and Speech Processing , 1997, CL.
[3] Mary P. Harper,et al. Semantics and constraint parsing of word graphs , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[4] Mary P. Harper,et al. Interfacing a CDG parser with an HMM word recognizer using word graphs , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).
[5] Hermann Ney,et al. Large vocabulary continuous speech recognition using word graphs , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.
[6] Andreas Stolcke,et al. Efficient lattice representation and generation , 1998, ICSLP.
[7] Mari Ostendorf,et al. Lattice-based search strategies for large vocabulary speech recognition , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.
[8] Mary P. Harper,et al. Interfacing acoustic models with natural language processing systems , 1998, ICSLP.
[9] Hermann Ney,et al. A word graph algorithm for large vocabulary continuous speech recognition , 1994, Comput. Speech Lang..