{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T23:40:27Z","timestamp":1684539627888},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1007\/bf02950410","type":"journal-article","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T18:02:55Z","timestamp":1221328975000},"page":"461-471","source":"Crossref","is-referenced-by-count":2,"title":["Improving the syllable-synchronous network search algorithm for word decoding in continuous Chinese speech recognition"],"prefix":"10.1007","volume":"15","author":[{"given":"Fang","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhanjiang","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02950410_CR1","doi-asserted-by":"crossref","unstructured":"Zheng F. A syllable-synchronous network search algorithm for word decoding in Chinese speech recognition.IEEE International Conf. Acoust., Speech and Signal Processing (ICASSP) March 15\u201319, 1999, Phoenix, USA, pp.II-601-604.","DOI":"10.1109\/ICASSP.1999.759738"},{"key":"BF02950410_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1967.1053967","volume":"13","author":"A J Viterbi","year":"1967","unstructured":"Viterbi A J. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm.IEEE Trans. IT, 1967, 13(2).","journal-title":"IEEE Trans. IT"},{"issue":"11","key":"BF02950410_CR3","doi-asserted-by":"crossref","first-page":"1649","DOI":"10.1109\/29.46547","volume":"37","author":"C-H Lee","year":"1989","unstructured":"Lee C-H, Rabiner L R. A frame-synchronous network search algorithm for connected word recognition.IEEE Trans. ASSP, Nov. 1989, 37(11): 1649\u20131658.","journal-title":"IEEE Trans. ASSP"},{"key":"BF02950410_CR4","unstructured":"Zheng F. Studies on approaches to keyword spotting in unconstrained continuous speech [dissertation]. Dept. of Computer Sci. & Tech., Tsinghua University, May 1997."},{"key":"BF02950410_CR5","unstructured":"Zheng F, Mou X-L, Xu M-Xet al. The implementation of a speech-to-text editor. In5th National Conference on Man-Machine Speech Communication (NCMMSC-98), 1998, pp.280\u2013285. (in Chinese)"},{"key":"BF02950410_CR6","doi-asserted-by":"crossref","unstructured":"Zheng F, Song Z-J, Xu M-X,et al. EasyTalk: A large-vocabulary speaker-independent Chinese dictation machine. InEuroSpeech\u201999, Budapest, Sept. 1999, 2: 819\u2013822.","DOI":"10.21437\/Eurospeech.1999-199"},{"key":"BF02950410_CR7","doi-asserted-by":"crossref","unstructured":"Nadas A. On turing\u2019s formula for word probabilities.IEEE Trans. on ASSP, June 1985, ASSP-33(6).","DOI":"10.1109\/TASSP.1985.1164728"},{"key":"BF02950410_CR8","unstructured":"Mou X-L, Zhan J-M, Zheng F, Wu W-H. The back-off algorithm based N-gram language model. In5th National Conference on Man-Machine Speech Communication (NCMMSC-98), 1998, pp.206\u2013209. (in Chinese)"},{"key":"BF02950410_CR9","unstructured":"Zheng F, Mou X-L, Wu W-H, Fang D-T. On the embedded multiple-model scoring scheme for speech recognition.International Symposium on Chinese Spoken Language Processing (ISCSLP\u201998), Singapore, Dec. 7\u20139, 1998, ASR-A3, pp.49\u201353."},{"issue":"3","key":"BF02950410_CR10","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TASSP.1987.1165125","volume":"35","author":"S M Katz","year":"1987","unstructured":"Katz S M. Estimation of probabilities from sparse data for the language model component of a speech recognizer.IEEE Trans. ASSP, March 1987, 35(3): 400\u2013401.","journal-title":"IEEE Trans. ASSP"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02950410.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02950410\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02950410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T23:19:46Z","timestamp":1684538386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02950410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["BF02950410"],"URL":"https:\/\/doi.org\/10.1007\/bf02950410","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}