{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T05:23:44Z","timestamp":1737264224972,"version":"3.33.0"},"reference-count":10,"publisher":"Wiley","issue":"7","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":4097,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1996,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Until now, the successive state\u2010splitting algorithm (SSS) has been proposed as an automatic generation algorithm for the hidden Markov network (HMnet), which can be used as a high\u2010performance efficient context\u2010dependent model. SSS is a splitting\u2010type algorithm in which the HMnet is detailed only by splitting states.<\/jats:p><jats:p>On the other hand, the \u201cmerge\u2010type\u201d algorithm also is proposed, where the model is constructed while merging the parameters based on the partial similarity of the model parameters. The two methods have the common goal, but take completely different approaches. Consequently, they should complement each other.<\/jats:p><jats:p>From such a viewpoint, this paper introduces the mechanism of the \u201cmerge\u2010type\u201d technique into SSS as the \u201csplitting\u2010type\u201d algorithm. In other words, the \u201cstate\u2010splitting and merging\u201d algorithm is proposed, where a higher\u2010performance automatic generation of HMnet is realized by complementing the defects of the two methods. An HMnet actually is constructed using 25 Japanese phoneme samples. By various evaluation experiments, the performance of the proposed algorithm is demonstrated.<\/jats:p>","DOI":"10.1002\/scj.4690270708","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T11:18:25Z","timestamp":1183893505000},"page":"84-96","source":"Crossref","is-referenced-by-count":0,"title":["Automatic generation of efficient hidden markov network by a state\u2010splitting and merging algorithm"],"prefix":"10.1002","volume":"27","author":[{"given":"Jun\u2010Ichi","family":"Takami","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"issue":"12","key":"e_1_2_1_2_2","first-page":"936","article-title":"Speech recognition based on hidden Markov model","volume":"42","author":"Okouchi M.","year":"1986","journal-title":"J. Acoust. Soc. Jap."},{"key":"e_1_2_1_3_2","unstructured":"S.Nakagawa.Speech recognition by stochastic model.Inst. Elect. Inf. Com. Eng. Jap.(1988)."},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"R.Schwartz Y.Chow O.Kimball S.Roucos M.KrasnerandJ.Makhoul.Context\u2010Dependent Modeling for Acoustic\u2010Phonetic Recognition of Continuous Speech.Proc. ICASSP'85 pp.1205\u201312\u20108 (1985).","DOI":"10.1109\/ICASSP.1985.1168283"},{"key":"e_1_2_1_5_2","unstructured":"S.HayamizuandK.Tanaka.Prediction and evaluation of acoustic variation in unknown phoneme context by tree\u2010structured phoneme model.Tech. Rep. I.E.I.C.E. Japan SP90\u201064 (1990)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"K. F.Lee S.Hayamizu H. W.Hon C.Huang J.SchwartzandR.Weide.Allophone Clustering for Continuous Speech Recognition. Proc. ICASSP'90 pp.749\u2013752(1990).","DOI":"10.1109\/ICASSP.1990.115900"},{"key":"e_1_2_1_7_2","unstructured":"S.Sagayama.Principle and algorithm of phoneme context clustering.Tech. Rep. I.E.I.C.E. Japan SP87\u201086 (1987)."},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"X. D.Huang K. F.Lee H. W.HonandM. Y.Hwang.Improved Acoustic Modeling with the SPHINX Speech Recognition System. Proc. ICASSP'91 pp.345\u2013348(1991).","DOI":"10.1109\/ICASSP.1991.150347"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"M. Y.HwangandX. D.Huang.Subphonetic Modeling with Markov States \u2014 Senon. ICASSP'92 pp.33\u201336(1992).","DOI":"10.1109\/ICASSP.1992.225979"},{"issue":"10","key":"e_1_2_1_10_2","first-page":"2155","article-title":"Automatic generation of hidden Markov network by successive state splitting","volume":"76","author":"Takami J.","year":"1993","journal-title":"Trans. (D\u2010II) I.E.I.C.E., Japan"},{"issue":"10","key":"e_1_2_1_11_2","first-page":"747","article-title":"Construction of Japanese speech database for research application","volume":"44","author":"Takeda K.","year":"1988","journal-title":"J. Acoust. Soc. Jap."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690270708","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690270708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T20:54:51Z","timestamp":1737233691000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690270708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":10,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["10.1002\/scj.4690270708"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690270708","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"type":"print","value":"0882-1666"},{"type":"electronic","value":"1520-684X"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}