{"title":"中文连接词识别的模式匹配方法","authors":"Baosheng Yuan, T. Yu","doi":"10.1109/ICPR.1988.28275","DOIUrl":null,"url":null,"abstract":"A speaker-dependent pattern-matching approach to connected word recognition for Chinese is presented. First, a method of adaptive energy normalization is applied to the speech spectrum, and a sound stimulus parameter is used to compress the normalized spectrum. Then, using a set of isolated word tokens as the reference patterns, a simplified dynamic programming-based matching strategy using a fast dynamic-time-warping alignment procedure is described. Experimental results for the recognition of a Chinese digit string (of unknown variable length from 2 to 5 digits), for two kinds of pronunciation (in standard Chinese and in the way used in telecommunication), are given. The correct string recognition rate is 96.8% and 97.6%, respectively.<<ETX>>","PeriodicalId":314236,"journal":{"name":"[1988 Proceedings] 9th International Conference on Pattern Recognition","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A pattern matching approach to connected-word recognition for Chinese\",\"authors\":\"Baosheng Yuan, T. Yu\",\"doi\":\"10.1109/ICPR.1988.28275\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A speaker-dependent pattern-matching approach to connected word recognition for Chinese is presented. First, a method of adaptive energy normalization is applied to the speech spectrum, and a sound stimulus parameter is used to compress the normalized spectrum. Then, using a set of isolated word tokens as the reference patterns, a simplified dynamic programming-based matching strategy using a fast dynamic-time-warping alignment procedure is described. Experimental results for the recognition of a Chinese digit string (of unknown variable length from 2 to 5 digits), for two kinds of pronunciation (in standard Chinese and in the way used in telecommunication), are given. The correct string recognition rate is 96.8% and 97.6%, respectively.<<ETX>>\",\"PeriodicalId\":314236,\"journal\":{\"name\":\"[1988 Proceedings] 9th International Conference on Pattern Recognition\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988 Proceedings] 9th International Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.1988.28275\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988 Proceedings] 9th International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.1988.28275","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A pattern matching approach to connected-word recognition for Chinese
A speaker-dependent pattern-matching approach to connected word recognition for Chinese is presented. First, a method of adaptive energy normalization is applied to the speech spectrum, and a sound stimulus parameter is used to compress the normalized spectrum. Then, using a set of isolated word tokens as the reference patterns, a simplified dynamic programming-based matching strategy using a fast dynamic-time-warping alignment procedure is described. Experimental results for the recognition of a Chinese digit string (of unknown variable length from 2 to 5 digits), for two kinds of pronunciation (in standard Chinese and in the way used in telecommunication), are given. The correct string recognition rate is 96.8% and 97.6%, respectively.<>