System and method for performing a grapheme-to-phoneme conversion

• US 20060031069A1
• Filed: 08/03/2004
• Published: 02/09/2006
• Est. Priority Date: 08/03/2004
• Status: Abandoned Application

• Current Assignee: Sony Corporation (Sony Group Corp.), Sony Electronics Inc. (Sony Group Corp.)
• Original Assignee: Sony Corporation (Sony Group Corp.), Sony Electronics Inc. (Sony Group Corp.)
• Inventors: Huang, Jun, Abrego, Gustavo, Olorenshaw, Lex S.
• Application Number:
  US10/910,383
• Publication Number:
  US 20060031069A1
• Time in Patent Office: Days
• US Class Current: 704/243
• CPC Class Codes: G10L 13/08 Text analysis or generation of parameters for speech synthesis out of text, e.g. grapheme to phoneme translation, prosody generation or stress or intonation determination

Abstract

A system and method for performing a grapheme-to-phoneme conversion procedure includes a graphone model generator that performs a graphone model training procedure to produce an N-gram graphone model based upon dictionary entries in a training dictionary. A grapheme-to-phoneme decoder then references the N-gram graphone model to perform grapheme-to-phoneme decoding procedures to convert input text into corresponding output phonemes.

Claims

1. A system for performing a grapheme-to-phoneme conversion procedure, comprising:

a graphone model generator that performs a graphone model training procedure to produce an N-gram graphone model based upon dictionary entries in a dictionary; and

a grapheme-to-phoneme decoder that references said N-gram graphone model to perform said grapheme-to-phoneme decoding procedure to convert input text into output phonemes.

2. The system of claim 1 wherein a speech synthesizer utilizes said grapheme-to-phoneme decoder for converting said input text into said output phonemes during a speech synthesis procedure.

3. The system of claim 1 wherein a speech recognizer utilizes said grapheme-to-phoneme decoder for converting said input text into said output phonemes for dynamically implementing recognition dictionary entries for performing speech recognition procedures.

4. The system of claim 1 wherein said dictionary includes a series of dictionary entries that each have a text vocabulary word and a corresponding phoneme representation for a pronunciation of said text vocabulary word.

5. The system of claim 1 wherein said N-gram graphone model includes a series of N-gram graphones and corresponding respective probability values, said N-gram graphones including respective unigram graphones and corresponding context information, said corresponding respective probability values expressing likelihoods that said unigram graphones and said corresponding context are observed in said dictionary.

6. The system of claim 5 wherein said unigram graphones each include one or more letters and one or more phonemes corresponding to a pronunciation of said one or more letters.

7. The system of claim 6 wherein said graphone model generator creates said N-gram graphone model according to a pre-defined grapheme limitation and a pre-defined phoneme limitation, said pre-defined grapheme limitation specifying a first maximum total for said one or more letters, said pre-defined phoneme limitation specifying a second maximum total for said one or more phonemes.

8. The system of claim 1 wherein said graphone model generator performs a maximum likelihood training procedure to generate a unigram graphone model by observing occurrences of unigram graphones in said dictionary.

9. The system of claim 8 wherein said graphone model generator utilizes a expectation-maximization algorithm to perform said maximum likelihood training procedure to generate said unigram graphone model.

10. The system of claim 8 wherein said graphone model generator utilizes a marginal trimming technique during said maximum likelihood training procedure to trim infrequently observed ones of said unigram graphones from said unigram graphone model.

11. The system of claim 8 wherein said graphone model generator performs a maximum likelihood alignment procedure upon said unigram graphone model to produce optimally-aligned graphone sequences by observing graphone alignment characteristics in said dictionary.

12. The system of claim 11 wherein said graphone model generator calculates probability values corresponding to said optimally-aligned graphone sequences by observing graphone sequence characteristics in said dictionary to produce said N-gram graphone model.

13. The system of claim 1 wherein said graphone model generator includes a first stage decoder and a second stage decoder to sequentially perform said grapheme-to-phoneme decoding procedure.

14. The system of claim 1 wherein said graphone model generator includes a first stage decoder to perform a word segmentation procedure upon said input text to produce an optimal word segmentation.

15. The system of claim 14 wherein said first stage decoder performs said word segmentation procedure upon said input text by statistically analyzing segmentation characteristics of said input text according to said N-gram graphone model.

16. The system of claim 14 wherein said first stage decoder of said grapheme-to-phoneme decoder utilizes pre-defined backoff priority levels to select said optimal word segmentation during said word segmentation procedure.

17. The system of claim 14 wherein a second stage decoder of said grapheme-to-phoneme decoder performs a stack search procedure upon said optimal word segmentation by referencing said N-gram graphone model to identify said output phones.

18. The system of claim 1 wherein said grapheme-to-phoneme decoder performs a post-processing procedure upon said output phonemes, said post-processing procedure including a format conversion procedure.

19. The system of claim 1 wherein said grapheme-to-phoneme decoder performs a post-processing procedure upon said output phonemes, said post-processing procedure including a stress processing procedure.

20. The system of claim 1 wherein said grapheme-to-phoneme decoder performs a post-processing procedure upon said output phonemes, said post-processing procedure including a syllable generation procedure.

21. A method for performing a grapheme-to-phoneme conversion procedure, comprising:

performing a graphone model training procedure with a graphone model generator to produce an N-gram graphone model based upon dictionary entries in a dictionary; and

referencing said N-gram graphone model with a grapheme-to-phoneme decoder to perform said grapheme-to-phoneme decoding procedure to convert input text into output phonemes.

22. The method of claim 21 wherein a speech synthesizer utilizes said grapheme-to-phoneme decoder to convert said input text into said output phonemes during a speech synthesis procedure.

23. The method of claim 21 wherein a speech recognizer utilizes said grapheme-to-phoneme decoder to convert said input text into said output phonemes to dynamically implement recognition dictionary entries to perform speech recognition procedures.

24. The method of claim 21 wherein said dictionary includes a series of dictionary entries that each have a text vocabulary word and a corresponding phoneme representation for a pronunciation of said text vocabulary word.

25. The method of claim 21 wherein said N-gram graphone model includes a series of N-gram graphones and corresponding probability values, said N-gram graphones including respective unigram graphones and corresponding context information, said corresponding respective probability values expressing likelihoods that said unigram graphones and said corresponding context are observed in said dictionary.

26. The method of claim 25 wherein said unigram graphones each include one or more letters and one or more phonemes corresponding to a pronunciation of said one or more letters.

27. The method of claim 26 wherein said graphone model generator creates said N-gram graphone model according to a pre-defined grapheme limitation and a pre-defined phoneme limitation, said pre-defined grapheme limitation specifying a first maximum total for said one or more letters, said pre-defined phoneme limitation specifying a second maximum total for said one or more phonemes.

28. The method of claim 21 wherein said graphone model generator performs a maximum likelihood procedure to generate a unigram graphone model by observing occurrences of unigram graphones in said dictionary.

29. The method of claim 28 wherein said graphone model generator utilizes a expectation-maximization algorithm to perform said maximum likelihood procedure to generate said unigram graphone model.

30. The method of claim 28 wherein said graphone model generator utilizes a marginal trimming technique during said maximum likelihood procedure to trim infrequently observed ones of said unigram graphones from said unigram graphone model.

31. The method of claim 28 wherein said graphone model generator performs a maximum likelihood alignment procedure upon said unigram graphone model to produce optimally-aligned graphone sequences by observing graphone alignment characteristics in said dictionary.

32. The method of claim 31 wherein said graphone model generator calculates probability values corresponding to said optimally-aligned graphone sequences by observing graphone sequence characteristics in said dictionary to produce said N-gram graphone model.

33. The method of claim 21 wherein said graphone model generator includes a first stage decoder and a second stage decoder to sequentially perform said grapheme-to-phoneme decoding procedure.

34. The method of claim 21 wherein said graphone model generator includes a first stage decoder to perform a word segmentation procedure upon said input text to produce an optimal word segmentation.

35. The method of claim 34 wherein said first stage decoder performs said word segmentation procedure upon said input text by statistically analyzing segmentation characteristics of said input text according to said N-gram graphone model.

36. The method of claim 34 wherein said first stage decoder of said grapheme-to-phoneme decoder utilizes pre-defined backoff priority levels when selecting said optimal word segmentation during said word segmentation procedure.

37. The method of claim 34 wherein a second stage decoder of said grapheme-to-phoneme decoder performs a stack search procedure upon said optimal word segmentation by referencing said N-gram graphone model to identify said output phones.

38. The method of claim 21 wherein said grapheme-to-phoneme decoder performs a post-processing procedure upon said output phonemes, said post-processing procedure including a format conversion procedure.

39. The method of claim 21 wherein said grapheme-to-phoneme decoder performs a post-processing procedure upon said output phonemes, said post-processing procedure including a stress processing procedure.

40. The method of claim 21 wherein said grapheme-to-phoneme decoder performs a post-processing procedure upon said output phonemes, said post-processing procedure including a syllable generation procedure.

41. A system for performing a grapheme-to-phoneme conversion procedure, comprising:

means for performing a graphone model training procedure to produce an N-gram graphone model based upon dictionary entries in a dictionary; and

means for referencing said N-gram graphone model to perform said grapheme-to-phoneme decoding procedure to convert input text into output phonemes.