Festival Speech Synthesis System: - Speech Resource Pages

( [ g u ] "'" EI = g )
( [ g u ] EI = g )
( [ g ] = g )
( [ h u e ] = u e )
( [ h i e ] = i e )
( [ h ] = )
( [ j ] = x )
( [ k ] = k )
( [ l l ] # = l )
( [ l l ] = ll )
( [ l ] = l )
( [ m ] = m )
( [ ~ n ] = ny )
( [ n ] = n )
( [ p ] = p )
( [ q u ] = k )
( [ r r ] = rr )
( # [ r ] = rr )
( LNS [ r ] = rr )
( [ r ] = r )
( [ s ] BDGLMN = th )
( [ s ] = s )
( # [ s ] C = e s )
( [ t ] = t )
( [ w ] = u )
( [ x ] = k s )
( AEO [ y ] = i )
( # [ y ] # = i )
( [ y ] = ll )
( [ z ] = th )
))
We could simply set our lexicon to use the above letter to sound system with the following command
(lex.set.lts.ruleset 'spanish)
But this would not deal with upper case letters. Instead of writing new rules for upper case letters we can define that a
Lisp function be called when looking up a word and intercept the lookup with our own function. First we state that
unknown words should call a function, and then define the function we wish called. The actual link to ensure our
function will be called is done below at lexicon selection time
(define (spanish_lts word features)
"(spanish_lts WORD FEATURES)
Using letter to sound rules build a spanish pronunciation of WORD."
(list word
nil
(lex.syllabify.phstress (lts.apply (downcase word) 'spanish))))
(lex.set.lts.method spanish_lts)
In the function we downcase the word and apply the LTS rule to it. Next we syllabify it and return the created lexical
entry.
[ < ] [ > ] [ > ] [Top] [Contents] [Index] [ ? ]
24.2.3 Phrasing
Without detailed labelled databases we cannot build statistical models of phrase breaks, but we can simply build a
phrase break model based on punctuation. The following is a CART tree to predict simple breaks, from punctuation.