SYSTEMS AND METHODS FOR TEXT NORMALIZATION FOR TEXT TO SPEECH SYNTHESIS
First Claim
1. A method for normalizing a text string, the method comprising:
- for each non-alphabetical character in the text string, identifying at least one alphabetical character or character string that corresponds to the non-alphabetical character;
creating a set of test strings, each of which being a version of the text string that is modified to include a different one of the identified at least one alphabetical character or character string instead of the non-alphabetical character;
retrieving a plurality of probabilities, each of which correspond to a probability of occurrence of a different one of the test strings; and
substituting a test string having the highest probability of occurrence for the text string.
1 Assignment
0 Petitions
Accused Products
Abstract
Algorithms for synthesizing speech used to identify media assets are provided. Speech may be selectively synthesized form text strings associated with media assets. A text string may be normalized and its native language determined for obtaining a target phoneme for providing human-sounding speech in a language (e.g., dialect or accent) that is familiar to a user. The algorithms may be implemented on a system including several dedicated render engines. The system may be part of a back end coupled to a front end including storage for media assets and associated synthesized speech, and a request processor for receiving and processing requests that result in providing the synthesized speech. The front end may communicate media assets and associated synthesized speech content over a network to host devices coupled to portable electronic devices on which the media assets and synthesized speech are played back.
371 Citations
10 Claims
-
1. A method for normalizing a text string, the method comprising:
-
for each non-alphabetical character in the text string, identifying at least one alphabetical character or character string that corresponds to the non-alphabetical character; creating a set of test strings, each of which being a version of the text string that is modified to include a different one of the identified at least one alphabetical character or character string instead of the non-alphabetical character; retrieving a plurality of probabilities, each of which correspond to a probability of occurrence of a different one of the test strings; and substituting a test string having the highest probability of occurrence for the text string. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
Specification