tailieunhanh - Báo cáo khoa học: "Paradigmatic Cascades: a Linguistically Sound Model of Pronunciation by Analogy"

We present and experimentally evaluate a new model of pronunciation by analogy: the paradigmatic cascades model. Given a pronunciation lexicon, this algorithm first extracts the most productive paradigmatic mappings in the graphemic domain, and pairs them statistically with their correlate(s) in the phonemic domain. These mappings are used to search and retrieve in the lexical database the most promising analog of unseen words. We finally apply to the analogs pronunciation the correlated series of mappings in the phonemic domain to get the desired pronunciation. . | Paradigmatic Cascades a Linguistically Sound Model of Pronunciation by Analogy Francois Yvon ENST and CNRS URA 820 Computer Science Department 46 rue Barrault - F 75 013 Paris yvon@ Abstract We present and experimentally evaluate a new model of pronunciation by analogy the paradigmatic cascades model. Given a pronunciation lexicon this algorithm first extracts the most productive paradigmatic mappings in the graphemic domain and pairs them statistically with their correlate in the phonemic domain. These mappings are used to search and retrieve in the lexical database the most promising analog of unseen words. We finally apply to the analogs pronunciation the correlated series of mappings in the phonemic domain to get the desired pronunciation. 1 Motivation Psychological models of reading aloud traditionally assume the existence of two separate routes for converting print to sound a direct lexical route which is used to read familiar words and a dual route relying upon abstract letter-to-sound rules to pronounce previously unseen words Coltheart 1978 Coltheart et al. 1993 . This view has been challenged by a number of authors . Glushsko 1981 who claim that the pronunciation process of every word familiar or unknown could be accounted for in a unified framework. These single-route models crucially suggest that the pronunciation of unknown words results from the parallel activation of similar lexical items the lexical neighbours . This idea has been tentatively implemented both into various symbolic analogy-based algorithms . Dedina and Nusbaum 1991 Sullivan and Damper 1992 and into connectionist pronunciation devices . Sei-denberg and McClelland 1989 . The basic idea of these analogy-based models is to pronounce an unknown word X by recombining pronunciations of lexical items sharing common subparts with X. To illustrate this strategy Dedina and Nussbaum show how the pronunciation of the sequence lop in the pseudo-word blope is analogized with the