Inference of letter-phoneme correspondences with pre-defined consonant and vowel patterns

R. Luk, R. Damper
{"title":"Inference of letter-phoneme correspondences with pre-defined consonant and vowel patterns","authors":"R. Luk, R. Damper","doi":"10.1109/ICASSP.1993.319269","DOIUrl":null,"url":null,"abstract":"The authors describe the automatic inferencing of letter-phoneme correspondences with predefined consonant and vowel patterns, which imply a segmentation of the word in one domain. The technique obtains the maximum likelihood (ML) alignment of the training word, and correspondences are found according to where the segmentation projects onto the ML alignment. Here, the phoneme strings were segmented depending on the number of consonant phonemes preceding or following the vowel phoneme. Sets of correspondences were evaluated according to the performance obtained when they were used for text-phonemic alignment and translation. The number of correspondences inferred was too large to evaluate using Markov statistics. Instead, hidden Markov statistics were used, where the storage demand is further reduced by a recording technique. Performance improves significantly as the number of consonants included in the pattern is increased. The performance of correspondences with predefined V.C* patterns was consistently better than with C*.V patterns.<<ETX>>","PeriodicalId":428449,"journal":{"name":"1993 IEEE International Conference on Acoustics, Speech, and Signal Processing","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 IEEE International Conference on Acoustics, Speech, and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1993.319269","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

The authors describe the automatic inferencing of letter-phoneme correspondences with predefined consonant and vowel patterns, which imply a segmentation of the word in one domain. The technique obtains the maximum likelihood (ML) alignment of the training word, and correspondences are found according to where the segmentation projects onto the ML alignment. Here, the phoneme strings were segmented depending on the number of consonant phonemes preceding or following the vowel phoneme. Sets of correspondences were evaluated according to the performance obtained when they were used for text-phonemic alignment and translation. The number of correspondences inferred was too large to evaluate using Markov statistics. Instead, hidden Markov statistics were used, where the storage demand is further reduced by a recording technique. Performance improves significantly as the number of consonants included in the pattern is increased. The performance of correspondences with predefined V.C* patterns was consistently better than with C*.V patterns.<>
用预先定义的辅音和元音模式推断字母-音素的对应关系
作者描述了用预定义的辅音和元音模式自动推理字母-音素对应,这意味着在一个域中对单词进行分割。该技术获得训练词的最大似然对齐,并根据切分投影到ML对齐上的位置找到对应关系。在这里,音素串是根据元音音素之前或之后的辅音音素的数量来分割的。根据对应集用于文本-音位对齐和翻译时获得的性能对其进行评估。推断的对应数量太大,无法使用马尔可夫统计量进行评估。相反,使用了隐马尔可夫统计,其中存储需求通过记录技术进一步减少。随着模式中包含的辅音数量的增加,性能显著提高。与预定义的vc *模式对应的性能始终优于与C*对应的性能。V模式。>
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信