• DocumentCode
    2020294
  • Title

    An efficient way to learn English grapheme-to-phoneme rules automatically

  • Author

    Torkkola, Kari

  • Author_Institution
    Inst. Dalle Molle D´´Intelligence Artificielle Perceptive, Martigny, Switzerland
  • Volume
    2
  • fYear
    1993
  • fDate
    27-30 April 1993
  • Firstpage
    199
  • Abstract
    An efficient way to learn automatically grapheme-to-phoneme mapping rules for English by using Kohonen´s concept of dynamically expanding context is presented. This method constructs rules that are most general in the sense of an explicitly defined specificity hierarchy. As the hierarchy, the amount of expanding context around the symbol to be transformed, weighted towards the right, is used. To apply this concept to English text-to-speech mapping, the authors have used the 20008-word corpus provided in the public domain by T. Sejnowski and C.R. Rosenberg (Complex Syst. vol.1, no.1, p.145-68 of 1987), which was also used in the NETTALK experiments. Phoneme-level mapping accuracies of 91% with data not used in training demonstrate that the dynamically expanding context is able to capture quite efficiently the context-dependent relationships in the corpus.<>
  • Keywords
    context-sensitive languages; hierarchical systems; learning (artificial intelligence); self-organising feature maps; speech synthesis; English; context-dependent relationships; dynamically expanding context; grapheme-to-phoneme mapping rules; mapping accuracies; specificity hierarchy;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on
  • Conference_Location
    Minneapolis, MN, USA
  • ISSN
    1520-6149
  • Print_ISBN
    0-7803-7402-9
  • Type

    conf

  • DOI
    10.1109/ICASSP.1993.319268
  • Filename
    319268