1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML>
<HEAD>
<META HTTP-EQUIV="CONTENT-TYPE" CONTENT="text/html; charset=iso-8859-1">
<TITLE>FreeTTS Programmer's Guide</TITLE>
<META NAME="GENERATOR" CONTENT="StarOffice 6.0 (Solaris Sparc)">
<META NAME="CREATED" CONTENT="20011115;9153400">
<META NAME="CHANGED" CONTENT="20011116;15171800">
<!-- /**
* Copyright (c) 2001 Sun Microsystems, Inc.
*
* See the file "license.terms" for information on usage and
* redistribution of this file, and for a DISCLAIMER OF ALL
* WARRANTIES.
*/
-->
</HEAD>
<BODY BGCOLOR="#ffffff">
<CENTER>
<TABLE WIDTH=100% CELLPADDING=2 CELLSPACING=2 BGCOLOR="#ccccee" STYLE="page-break-before: always">
<TR>
<TD WIDTH=100%>
<H1 ALIGN=CENTER>FreeTTS Programmer's Guide</H1>
</TD>
</TR>
</TABLE>
</CENTER>
<TABLE WIDTH=100% BORDER=0 CELLPADDING=2 CELLSPACING=2>
<TR>
<TD WIDTH=25% VALIGN=TOP BGCOLOR="#eeeeff">
<P><BR><B>Table of Contents </B><BR><A HREF="#organization">FreeTTS
Organization </A><BR><A HREF="#objects">Major FreeTTS Objects
</A><BR><A HREF="#processing">Processing Walkthrough</A> <BR><A HREF="#data">FreeTTS
Data</A> <BR><A HREF="#code">Code Walkthrough </A>
<BR><A HREF="#packaging">Voice Packaging</A>
</P>
<P><B>Related Documentation </B><BR><A HREF="index.html">FreeTTS
Overview </A><BR><A HREF="../javadoc/index.html">FreeTTS API </A><BR><A HREF="http://java.sun.com/products/java-media/speech/forDevelopers/jsapi-doc/index.html">The
Java Speech API (JSAPI) </A><BR><A HREF="http://java.sun.com/products/java-media/speech/forDevelopers/jsapi-guide/index.html">JSAPI
Programmer's Guide </A><BR><A HREF="http://www.cmuflite.org/">Flite
</A><BR><A HREF="http://www.speech.cs.cmu.edu/festival/index.html">Festival
</A>
</P>
</TD>
<TD WIDTH=5%></TD>
<TD>
<P><I>What this is </I>- This is an overview of how FreeTTS works
from a programmer's point of view. It describes the major classes
and objects used in FreeTTS, provides a data-flow walkthrough of
FreeTTS as it synthesizes speech, and provides an annotated
definition of a voice that serves as an example of how to define
a new custom voice.
</P>
<P><I>What this is not</I> - This is not an API guide to FreeTTS,
nor is it a tutorial on the fundamentals of speech synthesis.
</P>
<P>The FreeTTS package is based upon Flite, a light-weight
synthesis package developed at CMU. FreeTTS retains the core
architecture of Flite. Anyone who is familiar with the workings of
Flite will probably feel comfortable working with FreeTTS. Since
Flite itself is based upon the Festival speech synthesis system,
those who are experienced with the Festival package will notice
some similarities between Festival and FreeTTS.
</P>
</TD>
</TR>
</TABLE>
<HR>
<TABLE WIDTH=100% CELLPADDING=2 CELLSPACING=2>
<TR>
<TD BGCOLOR="#eeeeff">
<H2><A NAME="organization"></A>FreeTTS Organization
</H2>
</TD>
</TR>
</TABLE>
<P>FreeTTS is organized as a number of trees as follows:
</P>
<UL>
<!--
<LI><P STYLE="margin-bottom: 0cm"><B>javax.speech </B>contains the
generic JSAPI speech implementation. Code in this tree is
independent of any speech synthesis system.
</P>
-->
<LI><P STYLE="margin-bottom: 0cm"><B>com.sun.speech.engine </B>contains
support for JSAPI 1.0. Various packages
can be found in this tree.
</P>
<LI><P><B>com.sun.speech.freetts </B>contains the implementation of
the FreeTTS synthesis engine. The bulk of the code can be found in
this tree.
<B>com.sun.speech.freetts.jsapi</B> package provides the
JSAPI glue code for FreeTTS.
</P>
</UL>
<P>The <B>com.sun.speech.freetts</B> package is broken down further
into sets of sub-packages as follows:
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm"><B>com.sun.speech.freetts </B>contains
high-level interfaces and classes for FreeTTS. Much non-language and
voice dependent code can be found here.
</P>
<LI><P STYLE="margin-bottom: 0cm"><B>com.sun.speech.freetts.diphone
</B>provides support for diphone encoded speech.
</P>
<LI><P STYLE="margin-bottom: 0cm"><B>com.sun.speech.freetts.clunits
</B>provides support for cluster-unit encoded speech.
</P>
<LI><P STYLE="margin-bottom: 0cm"><B>com.sun.speech.freetts.lexicon
</B>provides definition and implementation of the Lexicon and
Letter-to-Sound Rules.
</P>
<LI><P STYLE="margin-bottom: 0cm"><B>com.sun.speech.freetts.util
</B>provides a set of tools and utilities.
</P>
<LI><P STYLE="margin-bottom: 0cm"><B>com.sun.speech.freetts.audio
</B>provides audio output support.
</P>
<LI><P STYLE="margin-bottom: 0cm"><B>com.sun.speech.freetts.cart
</B><SPAN STYLE="font-weight: medium">p</SPAN>rovides interface and
implementations of several Classification and Regression Trees
(CART).
</P>
<LI><P STYLE="margin-bottom: 0cm"><B>com.sun.speech.freetts.relp
</B>provides support for Residual Excited Linear Predictive (RELP)
decoding of audio samples.
</P>
<LI><P STYLE="margin-bottom: 0cm"><B>com.sun.speech.freetts.en
</B>contains <SPAN STYLE="font-weight: medium">English</SPAN>
specific code.</P>
<LI><P><B>com.sun.speech.freetts.en.us </B><SPAN STYLE="font-weight: medium">contains
</SPAN>US-English specific code.</P>
</UL>
<TABLE WIDTH=100% CELLPADDING=2 CELLSPACING=2>
<TR>
<TD BGCOLOR="#eeeeff">
<H2><A NAME="objects"></A>Major FreeTTS Objects
</H2>
</TD>
</TR>
</TABLE>
<P>There are a number of objects that work together to perform speech
synthesis.
</P>
<H3><A HREF="../javadoc/com/sun/speech/freetts/FreeTTSSpeakable.html">FreeTTSSpeakable</A></H3>
<P>FreeTTSSpeakable is an interface. Anything that is a source of text
that needs to be spoken with FreeTTS is first converted into a
FreeTTSSpeakable. One implementation of this interface is
FreeTTSSpeakableImpl. This implementation will wrap the most common
input forms (a String, an InputStream, or a JSML XML document) as a
FreeTTSSpeakable. A FreeTTSSpeakable is given to a Voice to be spoken.
</P>
<H3><A HREF="../javadoc/com/sun/speech/freetts/Voice.html">Voice</A></H3>
<P>The Voice is the central processing point for FreeTTS. The Voice
takes as input a FreeTTSSpeakable, translates the text associated with
the FreeTTSSpeakable into speech and generates audio output
corresponding to that speech. The Voice is the primary customization
point for FreeTTS. Language, speaker, and algorithm customizations can
all be performed by extending the Voice. A Voice will accept a
FreeTTSSpeakable via the Voice.speak method and process it as follows:
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm">The Voice converts a
FreeTTSSpeakable into a series of Utterances. The rules for breaking
a FreeTTSSpeakable into an Utterance is generally language dependent.
For instance, an English Voice may chose to break a FreeTTSSpeakable
into Utterances based upon sentence breaks.
</P>
<LI><P STYLE="margin-bottom: 0cm">As the Voice generates each
Utterance, a series of UtteranceProcessors processes the Utterance.
Each Voice defines its own set of UtteranceProcessors. This is the
primary method of customizing Voice behavior. For instance, to
change how units are joined together during the synthesis process, a
Voice would simply supply a new UtteranceProcessor that implements
the new algorithm. Typically each UtteranceProcessor will run in
turn, annotating or modifying the Utterance with information. For
instance, a 'Phrasing' UtteranceProcessor may insert phrase marks
into an Utterance that indicate where a spoken phrase begins. The
Utterance and UtteranceProcessors are described in more detail
below.
</P>
<LI><P>Once all Utterance processing has been applied, the Voice
sends the Utterance to the AudioOutput UtteranceProcessor. The
AudioOutput processor may run in a separate thread to allow
Utterance processing to overlap with audio output, ensuring the
lowest sound latency possible.
</P>
</UL>
<H3><A HREF="../javadoc/com/sun/speech/freetts/VoiceManager.html">VoiceManager</A></H3>
<P>The VoiceManager is the central repository of voices available to
FreeTTS. To get a voice you can do:
<pre>
VoiceManager voiceManager = VoiceManager.getInstance();
// create a list of new Voice instances
Voice[] voices = voiceManager.getVoices();
// iterate through the list until you find a Voice with the properties
// you want
...
// allocate the resources for the voice
voices[x].allocate();
</pre>
You can save yourself the chore of iterating through the voices if you
already know the name of the Voice you want by using voiceManager.getVoice()
</P>
<H3><A HREF="../javadoc/com/sun/speech/freetts/Utterance.html">Utterance</A></H3>
<P>The Utterance is the central processing target in FreeTTS. A
FreeTTSSpeakable is broken up into one or more Utterances, processed
by a series of UtteranceProcessors, and finally output as audio. An
Utterance consists of a set of Relations and a set of features called
FeatureSets.
</P>
<H3><A HREF="../javadoc/com/sun/speech/freetts/FeatureSet.html">FeatureSet</A></H3>
<P>A FeatureSet is simply a Name/Value pair. An Utterance can contain
an arbitrary number of FeatureSets. FeatureSets are typically used to
maintain global Utterance information such as volume, pitch and
speaking rate.
</P>
<H3><A HREF="../javadoc/com/sun/speech/freetts/Relation.html">Relation</A></H3>
<P>A Relation is a named list of Items. An Utterance can hold an
arbitrary number of Relations. A typical UtteranceProcessor may
iterate through one Relation and create a new Relation. For
instance, a word normalization UtteranceProcessor could iterate
through a token Relation and generate a word Relation based upon
token-to-word rules. A detailed description of the Utterance
processing and how it affects the Relations in an Utterance is
described below.
</P>
<H3><A HREF="../javadoc/com/sun/speech/freetts/Item.html">Item</A></H3>
<P>A Relation is a list of Item objects. An Item contains a set of
Features (as described previously, FeatureSets are merely name/value
pairs). An Item can have a list of daughter Items as well. Items in a
Relation are linked to Items in the same and other Relations. For
instance, the words in a word Relation are linked back to the
corresponding tokens in the token Relation. Similarly, a word in a
word Relation is linked to the previous and next words in the word
Relation. This gives an UtteranceProcessor the capability of easily
traversing from one Item to another.
</P>
<H3><A HREF="../javadoc/com/sun/speech/freetts/UtteranceProcessor.html">UtteranceProcessor</A></H3>
<P STYLE="margin-bottom: 0cm">An UtteranceProcessor is any object
that implements the UtteranceProcessor interface. An
UtteranceProcessor takes as input an Utterance and performs some
operation on the Utterance.
</P>
<P STYLE="margin-bottom: 0cm"><BR>
</P>
<TABLE WIDTH=100% CELLPADDING=2 CELLSPACING=2>
<TR>
<TD BGCOLOR="#eeeeff">
<H2><A NAME="processing"></A>Processing Walkthrough</H2>
</TD>
</TR>
</TABLE>
<P>In this section we will describe the detailed processing performed
by the CMUDiphoneVoice. This voice is an unlimited-domain voice that
uses diphone synthesis to generate speech. It is derived from the
CMUVoice class. The CMUVoice describes the general processing
required for an English voice without specifying how unit selection
and concatenation is performed. Subclasses of the CMUVoice
(CMUDiphoneVoice and CMUClusterUnitVoice) provide this
specialization.
</P>
<P>Processing starts with the <FONT FACE="Courier, sans-serif">speak</FONT>
method found in <FONT FACE="Courier, sans-serif">com.sun.speech.freetts.Voice</FONT>.
The <FONT FACE="Courier, sans-serif">speak</FONT> method performs the
following tasks:
<ul>
<li><a href="#Tokenization"> Tokenization </a>
<li><a href="#TokenToWords"> TokenToWords </a>
<li><a href="#PartOfSpeechTagger"> PartOfSpeechTagger </a>
<li><a href="#Phraser"> Phraser </a>
<li><a href="#Segmenter"> Segmenter </a>
<li><a href="#PauseGenerator"> PauseGenerator </a>
<li><a href="#Intonator"> Intonator </a>
<li><a href="#PostLexicalAnalyzer"> PostLexicalAnalyzer </a>
<li><a href="#Durator"> Durator </a>
<li><a href="#ContourGenerator"> ContourGenerator </a>
<li><a href="#UnitSelector"> UnitSelector </a>
<li><a href="#PitchMarkGenerator"> PitchMarkGenerator </a>
<li><a href="#UnitConcatenator"> UnitConcatenator </a>
</ul>
</P>
<H3><a name="Tokenization"> Tokenization</a></H3>
<P>In this step, the Voice uses the Tokenizer as returned from the
<FONT FACE="Courier, sans-serif">getTokenizer</FONT> method to break
a FreeTTSSpeakable object is into a series of Utterances. Typically,
tokenization is language-specific so each Voice needs to specify
which Tokenizer is to be used by overriding the <FONT FACE="Courier, sans-serif">getTokenizer</FONT>
method. The CMUDiphoneVoice uses the
c<FONT FACE="Courier, sans-serif">om.sun.speech.freetts.en.TokenizerImpl
</FONT>Tokenizer which is designed to parse and tokenize the English
language.
</P>
<P>A Tokenizer breaks an input stream of text into a series of Tokens
defined by the <FONT FACE="Courier, sans-serif">com.sun.speech.freetts.Token
</FONT>class. Typically, a Token represents a single word in the
input stream. Additionally, a Token will include such information as
the surrounding punctuation and whitespace, and the position of the
token in the input stream.
</P>
<P>The English Tokenizer (c<FONT FACE="Courier, sans-serif">om.sun.speech.freetts.en.TokenizerImpl</FONT>)
relies on a set of symbols being defined that specify what characters
are to be considered whitespace and punctuation.
</P>
<P>The Tokenizer defines a method called <FONT FACE="Courier, sans-serif">isBreak</FONT>
that is used to determine when the input stream should be broken and
a new Utterance is generated. For example, the English Tokenizer has
a set of rules to detect an end of sentence. If the current token
should start a new sentence, then the English Tokenizer <FONT FACE="Courier, sans-serif">isBreak</FONT>
method returns true.
</P>
<P>A higher level Tokenizer, FreeTTSSpeakableTokenizer repeatedly
calls the English Tokenizer and places each token into a list. When
the Tokenizer <FONT FACE="Courier, sans-serif">isBreak</FONT> method
indicates that a sentence break has occurred, the Voice creates a new
Utterance with the current list of tokens. The process of generating
and processing Utterances continues until no more tokens remain in
the input.
</P>
<H2 ALIGN=CENTER>Figure 1: The Utterance after Tokenization
</H2>
<P><IMG SRC="images/img0.jpg" NAME="Graphic1" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<H3>Utterance Processing
</H3>
<P>A Voice maintains a list of UtteranceProcessors. Each Utterance
generated by the tokenization step is run through the
UtteranceProcessors for the Voice. Each processor receives as input
the Utterance that is being processed. The UtteranceProcessor may add
new Relations to the Utterance, add new Items to Relations, or add
new FeatureSets to Items or to the Utterance itself. Often times, a
series of UtteranceProcessors are tightly coupled; one
UtteranceProcessors may add a Relation to an Utterance that is used
by the next.
</P>
<P>CMUVoice sets up most of the UtteranceProcessors used by
CMUDiphoneVoice. CMUVoice provides a number of <FONT FACE="Courier, sans-serif">getXXX</FONT>
methods that return an UtteranceProcessor, such as <FONT FACE="Courier, sans-serif">getUnitSelector</FONT>
and <FONT FACE="Courier, sans-serif">getUnitConcatenator</FONT>.
Sub-classes of CMUVoice override these <FONT FACE="Courier, sans-serif">getXXX</FONT>
methods to customize the processing. For instance, the
CMUDiphoneVoice overrides <FONT FACE="Courier, sans-serif">getUnitSelector
</FONT>to return a DiphoneUnitsSelector.
</P>
<H3>CMUDiphoneVoice Utterance Processing
</H3>
<P>The UtteranceProcessors described in this section are invoked when
the CMUDiphoneVoice processes an Utterance. When processing begins
the Utterance contains the token list and FeatureSets.
</P>
<H4><a name="TokenToWords"> TokenToWords </a>
</H4>
<P>The TokenToWords UtteranceProcessor creates a word Relation from
the token Relation by iterating through the token Relation Item list
and creating one or more words for each token. For most tokens there
is a one to one relationship between words and tokens, in which case
a single word Item is generated for the token item. Other tokens,
such as: "2001" generate multiple words "two thousand
one". Each word is created as an Item and added to the word
Relation. Additionally, each word Item is added as a daughter to the
corresponding token in the token Relation.
</P>
<P>The main role of TokenToWords is to look for various forms of
numbers and convert them into the corresponding English words.
TokenToWords looks for simple digit strings, comma separated numerals
(such as 1,234,567), ordinal values, years, floating point values,
and exponential notation. TokenToWords uses the JDK 1.4 regular
expression API to perform some classification. In addition a CART
(Classification and Regression Tree) is used to classify numbers as
one of: year, ordinal, cardinal, digits. Refer to <A HREF="#cart">Classification
and Regression Trees</A> for more information on CARTS.
</P>
<H2 ALIGN=CENTER>Figure 2: The Utterance after TokenToWords
</H2>
<P><IMG SRC="images/img1.jpg" NAME="Graphic2" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<H4><a name="PartOfSpeechTagger"> PartOfSpeechTagger </a>
</H4>
<P>The PartOfSpeechTagger UtteranceProcessor is a place-holder
processor that currently does nothing.
</P>
<H2 ALIGN=CENTER>Figure 3: The Utterance after PartOfSpeechTagger
</H2>
<P><IMG SRC="images/img2.jpg" NAME="Graphic3" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<H4><A NAME="Phraser"></A>Phraser
</H4>
<P>The Phraser processor creates a phrase Relation in the Utterance.
The phrase Relation represents how the Utterance is to be broken into
phrases when spoken. The phrase Relation consists of an Item marking
the beginning of each phrase in the Utterance. This phrase Item has
as its daughters the list of words that are part of the phrase.
</P>
<P>The Phraser builds the phrase Relation by iterating through the
Word Relation created by the TokenToWords processor. The Phraser uses
a Phrasing CART to determine where the phrase breaks occur and
creates the phrase Items accordingly.
</P>
<H2 ALIGN=CENTER>Figure 4: The Utterance after Phraser Processing</H2>
<P><IMG SRC="images/img3.jpg" NAME="Graphic4" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<H4><a name="Segmenter"> Segmenter </a>
</H4>
<P>The Segmenter is one of the more complex UtteranceProcessors. It
is responsible for determining where syllable breaks occur in the
Utterance. It organizes this information in several new Relations in
the Utterance.
</P>
<P>The Segmenter iterates through each word in the Utterance. For
each word, the Segmenter performs the following steps:
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm">Retrieves the phones that are
associated with the word from the <A HREF="#lexicon">Lexicon </A>.
Each word is organized in a Relation called "SylStructure".
</P>
<LI><P STYLE="margin-bottom: 0cm">Iterates through each phone of the
word, adding the phone to a Relation called "Segment".
</P>
<LI><P STYLE="margin-bottom: 0cm">Determines where syllable breaks
occur (with help from the lexicon) and notes the syllable break
points in a Relation called "Syllable"
</P>
<LI><P>If the lexicon indicates that a particular phone is stressed,
then the syllable that contains that phone is marked as "stressed".
</P>
</UL>
<P>When the Segmenter is finished, three new Relations have been
added to the Utterance that denote the syllable structure and units
for the Utterance.
</P>
<H2 ALIGN=CENTER>Figure 5: The Utterance after Segmenter Processing
</H2>
<P><IMG SRC="images/img4.jpg" NAME="Graphic5" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<H4><a name="PauseGenerator"> PauseGenerator </a>
</H4>
<P>The PauseGenerator annotates an Utterance with pause information.
It inserts a pause at the beginning of the segment list (thus all
Utterances start with a pause). It then iterates through the phrase
Relation (set up by the <A HREF="#Phraser">Phraser</A>) and inserts a
pause before the first segment of each phrase.
</P>
<H2 ALIGN=CENTER>Figure 6: The Utterance after PauseGenerator
Processing
</H2>
<P><IMG SRC="images/img5.jpg" NAME="Graphic6" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<H4><a name="Intonator"> Intonator </a>
</H4>
<P>The Intonator processor annotates the syllable Relation of an
Utterances with "accent" and "endtone" features.
A typical application of this uses the ToBI (tones and break indices)
scheme for transcribing intonation and accent in English, developed
by Janet Pierrehumbert and Mary Beckman.
</P>
<P>The intonation is independent of the ToBI annotation: ToBI
annotations are not used by this class, but are merely copied from
the CART result to the "accent" and "endtone"
features of the syllable Relation.
</P>
<P>This processor relies on two <A HREF="#cart">CARTs </A>: an accent
CART and a tone CART. This processor iterates through each syllable
in the syllable relation, applies each CART to the syllable and sets
the accent and endtone features of the Item based upon the results of
the CART processing.
</P>
<H2 ALIGN=CENTER>Figure 7: The Utterance after Intonator Processing
</H2>
<P><IMG SRC="images/img6.jpg" NAME="Graphic7" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<H4><a name="PostLexicalAnalyzer"> PostLexicalAnalyzer </a>
</H4>
<P>The PostLexicalAnalyzer is responsible for performing any fix ups
before the next phase of processing. For instance, the
CMUDiphoneVoice provides a PostLexicalAnalyzer that performs two
functions:
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm"><B>Fix AH </B>The diphone data for
the CMUDiphoneVoice does not have any diphone data for the "ah"
diphone. The CMU Lexicon that is used by the CMUDiphoneVoice,
however, contains a number of words that reference the "ah"
diphone. The CMUDiphoneVoice PostLexicalAnalyzer iterates through
all phones in the segment Relation and replaces them with "aa"
diphones.
</P>
<LI><P><B>Fix Apostrophe-S </B>This step iterates through the
segments and looks for words associated with the segments that
contain an apostrophe-s. The processor then inserts a 'schwa'
phoneme in certain cases.
</P>
</UL>
<H4><a name="Durator"> Durator </a>
</H4>
<P>The Durator is responsible for determining the ending time for
each unit in the segment list. The Durator uses a CART to look up the
statistical average duration and standard deviation for each phone
and calculates an exact duration based upon the CART derived
adjustment. Each unit is finally tagged with an "end"
attribute that indicates the time, in seconds, at which the unit
should be completed.
</P>
<H2 ALIGN=CENTER>Figure 8: The Utterance after Durator Processing
</H2>
<P><IMG SRC="images/img7.jpg" NAME="Graphic8" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<H4><a name="ContourGenerator"> ContourGenerator </a>
</H4>
<P>The ContourGenerator is responsible for calculating the F0
(Fundamental Frequency) curve for an Utterance. The paper: <A HREF="http://citeseer.nj.nec.com/20262.html">Generating
F0 contours from ToBI labels using linear regression </A>by Alan W.
Black, Andrew J. Hunt, describes the techniques used.
</P>
<P>The ContourGenerator creates the "target" Relation and
populates it with target points that mark the time and target
frequency for each segment. The ContourGenerator is driven by a a
file of feature model terms. For example, CMUDiphoneVoice uses
com/sun/speech/freetts/en/us/f0_lr_terms.txt. Here is an excerpt:
</P>
<PRE>Intercept 160.584961 169.183380 169.570374 null
p.p.accent 10.081770 4.923247 3.594771 H*
p.p.accent 3.358613 0.955474 0.432519 !H*
p.p.accent 4.144342 1.193597 0.235664 L+H*
p.accent 32.081028 16.603350 11.214208 H*
p.accent 18.090033 11.665814 9.619350 !H*
p.accent 23.255280 13.063298 9.084690 L+H*
accent 5.221081 34.517868 25.217588 H*
accent 10.159194 22.349655 13.759851 !H*
accent 3.645511 23.551548 17.635193 L+H*
n.accent -5.691933 -1.914945 4.944848 H*
n.accent 8.265606 5.249441 7.398383 !H*
n.accent 0.861427 -1.929947 1.683011 L+H*
n.n.accent -3.785701 -6.147251 -4.335797 H*</PRE><P>
The first column represents the feature name. It is followed by the
starting point, the mid-point and the ending point for the term (in
terms of relative frequency deltas). The final column represents the
ToBI label.
</P>
<P>The ContourGenerator iterates through each syllable in the
Utterance and applies the linear regression model as follows:
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm">For each entry in the
feature/model/terms table, extract the named feature.
</P>
<LI><P STYLE="margin-bottom: 0cm">Compare the feature value to the
ToBI label as specified in the table.
</P>
<LI><P STYLE="margin-bottom: 0cm">If the features match, then use
the start/midpoint and end to update the curve.
</P>
<LI><P>Add the new target point to the target Relation
</P>
</UL>
<H2 ALIGN=CENTER>Figure 9: The Utterance after ContourGenerator
Processing
</H2>
<P><IMG SRC="images/img8.jpg" NAME="Graphic9" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<H4><a name="UnitSelector"> UnitSelector </a>
</H4>
<P>The UnitSelector that is used by the CMUDiphoneVoice creates a
Relation in the Utterance called "unit". This relation
contains Items that represent the diphones for the unit. This
processor iterates through the segment list and builds up diphone
names by assembling two adjacent phone names. The diphone is added to
the unit Relation along with timing information about the diphone.
</P>
<H2 ALIGN=CENTER>Figure 10: The Utterance after UnitSelector
Processing
</H2>
<P><IMG SRC="images/img9.jpg" NAME="Graphic10" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<H4><a name="PitchMarkGenerator"> PitchMarkGenerator </a>
</H4>
<P>The PitchMarkGenerator is responsible for calculating pitchmarks
for the Utterance. The pitchmarks are generated by iterating through
the target Relation and calculating a slope based upon the desired
time and F0 values for each Item in the target Relation. The
resulting slope is used to calculate a series of target times for
each pitchmark. These target times are stored in an LPCResult object
that is added to the Utterance.
</P>
<P><IMG SRC="images/img10.jpg" NAME="Graphic11" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<H4><a name="UnitConcatenator"> UnitConcatenator </a>
</H4>
<P>The UnitConcatenator processor is responsible for gathering all of
the diphone data and joining it together. For each Item in the unit
Relation (recall this was the set of diphones) the UnitConcatenator
extracts the unit sample data from the unit based upon the target
times as stored in the LPC result.
</P>
<H2 ALIGN=CENTER>Figure 11: The Utterance after UnitConcatenator
Processing
</H2>
<P STYLE="margin-bottom: 0cm"><IMG SRC="images/img11.jpg" NAME="Graphic11" ALIGN=BOTTOM WIDTH=800 HEIGHT=617 BORDER=0>
</P>
<TABLE WIDTH=100% CELLPADDING=2 CELLSPACING=2>
<TR>
<TD BGCOLOR="#eeeeff">
<H2><A NAME="data"></A>FreeTTS Data
</H2>
</TD>
</TR>
</TABLE>
<P>FreeTTS uses a number of interesting data structures. These are
described here.
</P>
<H3><A NAME="cart"></A>Classification and Regression Trees (CART)
</H3>
<P>The use of Classification and Regression Trees is described in the
paper by L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone.
<A HREF="http://citeseer.nj.nec.com/context/7119/0"><I>Classification
and Regression Trees.</I></A> Additional information about how such
trees can be used in the context of speech synthesis is described in
<A HREF="http://festvox.org/docs/speech_tools-1.2.0/c16616.htm">Chapter
10 </A>of the System Documentation of the <I>Edinburgh Speech Tools
Library</I>. The Classification and Regression Trees (CART) in FreeTTS
are essentially binary decision trees used to classify some part of
an Utterance.
</P>
<P>A CART is a tree of nodes and leaves. Each node consists of the
following:
</P>
<UL>
<LI><P><B>Feature </B>The feature to test. This is in the form of a
feature traversal string. For instance the feature string:
</P>
<PRE STYLE="margin-bottom: 0.5cm">"R:SylStructure.daughter.R:Segment.p.end"</PRE><P STYLE="margin-bottom: 0cm">
Can be interpreted as:<BR><BR>
</P>
</UL>
<P STYLE="margin-left: 2cm; margin-bottom: 0cm"><I>Given an Item in
the syllable relation (syl), find the SylStructure Relation in that
syllable, get the first daughter, find the segment associated with
the daughter, find the previous segment and return its "end
time".</I> <BR><BR>
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm"><B>Operand </B>The type of test to
perform. The available operands are:
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm">LESS_THAN - The feature is less
than the value
</P>
<LI><P STYLE="margin-bottom: 0cm">EQUAL - The feature is equal to
the value
</P>
<LI><P STYLE="margin-bottom: 0cm">GREATER_THAN - The feature is
greater than the value
</P>
<LI><P STYLE="margin-bottom: 0cm">MATCHES - The feature matches the
regular expression stored in the value
</P>
</UL>
<LI><P STYLE="margin-bottom: 0cm"><B>Value </B>The feature value is
compared based on the operand to this value.
</P>
<LI><P STYLE="margin-bottom: 0cm"><B>Success Node </B>If the
comparison is successful, tree traversal continues at this node.
</P>
<LI><P STYLE="margin-bottom: 0cm"><B>Failure Node </B>If the
comparison fails, traversal continues at this node.
</P>
<LI><P><B>Type </B>A node can be of two types, a NODE or a LEAF. A
NODE is a non-terminal member of the tree, whereas a LEAF is a
terminal node. Once the interpretation of a CART reaches a LEAF
node, the value for that node is returned.
</P>
</UL>
<P>Typically, an UtteranceProcessor will employ a CART tree to
classify a particular Item or part of an Utterance. The CART
processing proceeds as follow:
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm">Starting at the first node in the
CART, extract the feature pointed to by the node.
</P>
<LI><P STYLE="margin-bottom: 0cm">Compare based upon the NODE
operand to the node value. If the comparison succeeds proceed to the
Success Node, otherwise go to the Failure Node.
</P>
<LI><P>Continue processing nodes in this fashion until a LEAF node
is reached, at which point return the value of that node.
</P>
</UL>
<CENTER>
<TABLE WIDTH=100% BORDER=1 CELLPADDING=2 CELLSPACING=2>
<TR>
<TH COLSPAN=4>
<P>CARTS used by FreeTTS
</P>
</TH>
</TR>
<TR>
<TH>
<P>Name
</P>
</TH>
<TH>
<P>Location
</P>
</TH>
<TH>
<P># Nodes
</P>
</TH>
<TH>
<P>Description
</P>
</TH>
</TR>
<TR>
<TH>
<P>Phraser
</P>
</TH>
<TD>
<P>en/us/durz_cart.txt
</P>
</TD>
<TD>
<P>40 nodes
</P>
</TD>
<TD>
<P>used to determine where to place breaks in phrases.
</P>
</TD>
</TR>
<TR>
<TH>
<P>Accent
</P>
</TH>
<TD>
<P>en/us/int_accent_cart.txt
</P>
</TD>
<TD>
<P>150 nodes
</P>
</TD>
<TD>
<P>used to determine where to apply syllable accents .
</P>
</TD>
</TR>
<TR>
<TH>
<P>Tone
</P>
</TH>
<TD>
<P>en/us/int_tone_cart.txt
</P>
</TD>
<TD>
<P>100 nodes
</P>
</TD>
<TD>
<P>used to determine the type of 'end tone' for syllables.
</P>
</TD>
</TR>
<TR>
<TH>
<P>Duration
</P>
</TH>
<TD>
<P>durz_cart.txt
</P>
</TD>
<TD>
<P>800 nodes
</P>
</TD>
<TD>
<P>used to determine the duration for each segment of an
Utterance.
</P>
</TD>
</TR>
<TR>
<TH>
<P>TokenToWords
</P>
</TH>
<TD>
<P>en/us/nums_cart.txt
</P>
</TD>
<TD>
<P>100 nodes
</P>
</TD>
<TD>
<P>used to classify numbers as cardinal, digits, ordinal or year.
</P>
</TD>
</TR>
<TR>
<TH>
<P>ClusterUnitSelection
</P>
</TH>
<TD>
<P>en/us/cmu_awb/cmu_time_awb.txt
</P>
</TD>
<TD>
<P>130 CARTS, 2 nodes each
</P>
</TD>
<TD>
<P>The cluster unit database contains 132 separate CART trees,
each of which contains just a couple or so nodes. These CARTS are
used to select phoneme units.
</P>
</TD>
</TR>
</TABLE>
</CENTER>
<H3><a name="lexicon">Lexicon</a>
</H3>
<P>The Lexicon provides a mapping of words to their pronunciations.
FreeTTS provides a generic lexicon interface
(<FONT FACE="Courier, sans-serif">com.sun.speech.freetts.lexicon)</FONT>
and a specific implementation, <FONT FACE="Courier, sans-serif">com.sun.speech.freetts.en.us.CMULexicon</FONT>
that provides a English language lexicon based upon CMU data. The
essential function of a Lexicon is to determine the pronunciation of
a word. The retrieval is done via the interface: Lexicon.getPhones.
word.
</P>
<P>The Lexicon interface provides the ability to add new words to the
Lexicon.
</P>
<P>The CMULexicon is an implementation of the Lexicon interface that
supports the Flite CMU Lexicon. The CMULexicon contains over 60,000
pronunciations. Here is a snippet:
</P>
<PRE>abbasi0 aa b aa1 s iy
abbate0 aa1 b ey t
abbatiello0 aa b aa t iy eh1 l ow
abbe0 ae1 b iy
abbett0 ax b eh1 t
abbie0 ae1 b iy
abbitt0 ae1 b ax t
abbot0 ae1 b ax t
abboud0 ax b uw d
abbreviate0 ax b r iy1 v iy ey1 t
abbruzzese0 aa b r uw t s ey1 z iy
abbs0 ae1 b z
abby0 ae1 b iy
abco0 ae1 b k ow
abdel0 ae1 b d eh1 l
abdicating0 ae1 b d ih k ey1 t ih ng </PRE><P>
Each entry contains a word, with a part-of-speech tag appended to it,
followed by the phones representing the pronunciation. A separate
file maintains the addenda. The addenda is a smaller set of
pronunciations typically used to provide custom or application or
domain specific pronunciations.
</P>
<P>The CMULexicon implementation also relies on a set of
Letter-To-Sound rules. These rules can automatically determine the
pronunciation of a word. When the pronunciation of a word is
requested, the CMULexicon will first look it up in the main list of
words. If it is not found, the addenda is checked. If the word is
still not found, then the Letter-To-Sound rules are used to convert
the words into phones. To conserve space, the CMULexicon has been
stripped of all words that can be recreated using the Letter-To-Sound
rules. One can look at the 60,000 pronunciations in the Lexicon as
exceptions to the rule.
</P>
<P>The Lexicon data is represented in two forms: text and binary. The
binary form loads much quicker than the text form of the data and is
the form that is generally used by FreeTTS. FreeTTS provides a method
of generating the binary form of the Lexicon from the text form of
the Lexicon.
</P>
<H3>Letter-To-Sound Rules
</H3>
<P>The Letter-To-Sound (LTS) rules are used to generate a phone
sequence for words not in the Lexicon. The LTS rules are a simple
state machine, with one entry point for each letter of the alphabet.
</P>
<P>The state machine consists of a large list of entries. There are
two types of entries: a STATE and a PHONE. A STATE entry contains a
decision and the indices of two other entries. The first of these two
indices represents where to go if the decision is true, and the
second represents where to go if the decision is false. A PHONE entry
is the final state of the decision tree and contains the phone that
should be returned.
</P>
<P>The decision in FreeTTS's case is a simple character comparison,
but it is done in the context of a window around the character in the
word. The decision consists of a index into the context window and a
character value. If the character in the context window matches the
character value, then the decision is true. The machine traversal for
each letter starts at that letter's entry in the state machine and
ends only when it reaches a final state. If there is no phone that
can be mapped, the phone in the final state is set to 'epsilon.' The
context window for a character is generated in the following way:
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm">Pad the original word on either
side with '#' and '0' characters to the size of the window for the
LTS rules (in FreeTTS's case, this is 4). The "#" is used
to indicate the beginning and end of the word. So, the word "monkey"
would turn into "000#monkey#000".
</P>
<LI><P>For each character in the word, the context window consists
of the characters in the padded form that precede and follow the
word. The number of characters on each side is dependent upon the
window size. So, for FreeTTS, the context window for the 'k' in
monkey is "#money#0".
</P>
</UL>
<P>Here's how the phone for 'k' in 'monkey' might be determined:
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm">Create the context window
"#monkey#0".
</P>
<LI><P STYLE="margin-bottom: 0cm">Start at the state machine entry
for 'k' in the state machine.
</P>
<LI><P STYLE="margin-bottom: 0cm">Grab the 'index' from the current
state. This represents an index into the context window. Compare the
value of the character at the index in the context window to the
character from the current state. If there is a match, the next
state is the true value. If there is not a match, the next state is
the false state.
</P>
<LI><P STYLE="margin-bottom: 0cm">Repeat the previous step until you
read a final state.
</P>
<LI><P>When you get to the final state, the phone is the character
in that state.
</P>
</UL>
<H3>Unit Selection
</H3>
<P>The designers of FreeTTS have written it in such a way that the
unit selection can be done using several methods. The current methods
are diphone and cluster unit selection.
</P>
<P>Luckily, the unit selection is independent of the wave synthesis.
As a result, if the units from either unit selection type share the
same format, the same wave synthesis technique can be used. This is
the case for the KAL diphone and AWB cluster unit voices.
</P>
<H4>Diphone Unit Selection
</H4>
<P>The diphone unit selection is very simple: it combines each
adjacent phoneme into a pair separated by a "-". These
pairs are used to look up entries in the diphone database.
</P>
<H4>Cluster Unit Selection
</H4>
<P>The cluster unit selection is a bit more complex. Instead of
working with diphones, it works on one unit at a time, and there can
be more than one instance of a unit per database.
</P>
<P>The first step in cluster unit selection determines the unit type
for each unit in the Utterance. The unit type for selection in the
simple talking clock example (cmu_time_awb) is done per phone. The
unit type consists of the phone name followed by the word the phone
comes from (e.g., n_now for the phone 'n' in the word 'now').
</P>
<P>The unit database contains a plurality of instances per unit type,
and they are indexed by number (e.g., n_now_0, n_now_1, etc.). Also
included in this database are what unit instances come before and
after each unit (e.g., n_now_13 is preceded by z_is_13 and is
followed by unit_aw_now_13).
</P>
<P>Once the unit types have been determined, the next step is to
select the best unit instance. This is done using a Viterbi algorithm
where the cost is based upon the Mel-Cepstra distance between
candidates. The candidate selection is determined using two things:
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm">A CART - given an item, the CART
will return a list of the unit type instances that are potential
choices. Most of the CARTs in cmu_time_awb are very simple - there
are no choices and the first node is a leaf node containing the
list.
</P>
<LI><P>Extended selections. For the unit preceding the current unit,
the candidate selection will search the units following that unit.
If the unit type is the same as the current unit, then that unit is
added as a candidate.
</P>
</UL>
<P>After the candidates are chosen, the Viterbi algorithm is used to
calculate path costs. The basic algorithm is as follows:
</P>
<UL>
<LI><P STYLE="margin-bottom: 0cm">For each candidate for the current
unit, calculate the cost between it and the first candidate in the
next unit. Save only the path that has the least cost. By default,
if two candidates come from units that are adjacent in the database,
the cost is 0 (i.e., they were spoken together, so they are a
perfect match).
</P>
<LI><P STYLE="margin-bottom: 0cm">Repeat the previous process for
each candidate in the next unit, creating a list of least cost paths
between the candidates between the current unit and the unit
following it.
</P>
<LI><P STYLE="margin-bottom: 0cm">Toss out all candidates in the
current unit that are not included in a path.
</P>
<LI><P>Move to the next unit and repeat the process.
</P>
</UL>
<P>Once the whole tree is done, the path(s) with the least cost
should be identified, and these represent the RELP encoded samples to
choose from the database.
</P>
<TABLE WIDTH=100% CELLPADDING=2 CELLSPACING=2>
<TR>
<TD BGCOLOR="#eeeeff">
<H2><A NAME="code"></A>CMUDiphoneVoice Code Walkthrough
</H2>
</TD>
</TR>
</TABLE>
<P>In this section, we will look at the CMUDiphoneVoice class to see
how a new voice is created and customized.
</P>
<PRE>
/**
* Defines an unlimited-domain diphone synthesis based voice
*/</PRE><P>
<FONT COLOR="#008000">The CMUDiphoneVoice class extends the CMUVoice.
CMUVoice provides much of the standard voice definition including
loading of the Lexicon, setting up of common features, setting up of
UtteranceProcessors. </FONT>
</P>
<PRE>public class CMUDiphoneVoice extends CMUVoice {
/**
* Creates a simple voice
*/
</PRE><P>
<FONT COLOR="#008000">It is possible and quite likely that multiple
voices will want to share a single Lexicon. By passing false to the
CMUVoice constructor, this voice indicates that by default no Lexicon
should be created. This allows a Voice manager (such as the
FreeTTSSynthesizer to create a single Lexicon and have multiple voices
share it. </FONT>
</P>
<PRE> public CMUDiphoneVoice() {
this(false);
}
/**
* Creates a simple voice
*
* @param createLexicon if true automatically load up
* the default CMU lexicon; otherwise, don't load it.
*/</PRE><P>
<FONT COLOR="#008000">This version of the constructor sets the
standard rate, pitch and range values for the voice. </FONT>
</P>
<PRE> public CMUDiphoneVoice(boolean createLexicon) {
super(createLexicon);
setRate(150f);
setPitch(100F);
setPitchRange(11F);
}
/**
* Sets the FeatureSet for this Voice.
*
* @throws IOException if an I/O error occurs
*/</PRE><P>
If this voice needed to add or customize the feature set, it would do
so here. This voice is happy with the default features provided by
CMUVoice, so nothing is done here.
</P>
<PRE> protected void setupFeatureSet() throws IOException {
super.setupFeatureSet();
}
/**
* Returns the post lexical processor to be used by this voice.
* Derived voices typically override this to customize behaviors.
*
* @return the Unit selector
*
* @throws IOException if an IO error occurs while getting
* processor
*/</PRE><P>
<FONT COLOR="#008000">Here is an example of how to override the
default Utterance processing provided by CMUVoice. CMUDiphoneVoice
needs to provide a post-lexical analyzer that converts one phone "ah"
to another "aa". CMUVoice provides a number of 'getXXXX'
functions that return the UtteranceProcessor that will be used for
that stage of processing. CMUDiphoneVoice overrides the
getPostLexicalAnalyzer method to provide the customized post lexical
analyzer. </FONT>
</P>
<PRE> protected UtteranceProcessor getPostLexicalAnalyzer() throws IOException {
return new CMUDiphoneVoicePostLexicalAnalyzer();
}
/**
* Returns the pitch mark generator to be used by this voice.
* Derived voices typically override this to customize behaviors.
* This voice uses a DiphonePitchMark generator to generate
* pitchmarks.
*
* @return the post lexical processor
*
* @throws IOException if an IO error occurs while getting
* processor
*/
</PRE><P>
<FONT COLOR="#008000">The diphone voice needs to provide a customized
pitchmark generator that is specific to diphone synthesis.</FONT>
</P>
<PRE> protected UtteranceProcessor getPitchmarkGenerator() throws IOException {
return new DiphonePitchmarkGenerator();
}
/**
* Returns the unit concatenator to be used by this voice.
* Derived voices typically override this to customize behaviors.
* This voice uses a relp.UnitConcatenator to concatenate units.
*
* @return the post lexical processor
*
* @throws IOException if an IO error occurs while getting
* processor
*/
</PRE><P>
<FONT COLOR="#008000">This voice uses the standard UnitConcatenator. </FONT>
</P>
<PRE> protected UtteranceProcessor getUnitConcatenator() throws IOException {
return new UnitConcatenator();
}
/**
* Returns the unit selector to be used by this voice.
* Derived voices typically override this to customize behaviors.
* This voice uses the DiphoneUnitSelector to select units. The
* unit selector requires the name of a diphone database. If no
* diphone database has been specified (by setting the
* DATABASE_NAME feature of this voice) then by default
* cmu_kal/diphone_units.bin is used.
*
* @return the post lexical processor
*
* @throws IOException if an IO error occurs while getting
* processor
*/</PRE><P>
<FONT COLOR="#008000">The unit selector is also diphone specific.
Note that this method also specifies which diphone unit database to
use if none has been supplied already. </FONT>
</P>
<PRE> protected UtteranceProcessor getUnitSelector() throws IOException {
String unitDatabaseName = getFeatures().getString(DATABASE_NAME);
if (unitDatabaseName == null) {
unitDatabaseName = "cmu_kal/diphone_units.bin";
}
return new DiphoneUnitSelector(
this.getClass().getResource(unitDatabaseName));
}
/**
* Converts this object to a string
*
* @return a string representation of this object
*/
public String toString() {
return "CMUDiphoneVoice";
}
}
/**
* Annotates the Utterance with post lexical information. Converts AH
* phonemes to AA phoneme in addition to the standard english postlex
* processing.
*/
</PRE><P>
<FONT COLOR="#008000">Here is an example of defining a new
UtteranceProcessor. This UtteranceProcessor traverses through the
SEGMENT Relation looking for all phones of type "ah" and
converts them to "aa" phones. Since this Processor is used
to replace the default post-lexical analyzer processor, it invokes
the default post-lexical analyzer after performing the custom
processing. </FONT>
</P>
<PRE>class CMUDiphoneVoicePostLexicalAnalyzer implements UtteranceProcessor {
UtteranceProcessor englishPostLex =
new com.sun.speech.freetts.en.PostLexicalAnalyzer();
/**
* performs the processing
* @param utterance the utterance to process/tokenize
* @throws ProcessException if an IOException is thrown during the
* processing of the utterance
*/
public void processUtterance(Utterance utterance) throws ProcessException {
fixPhoneme_AH(utterance);
englishPostLex.processUtterance(utterance);
}
/**
* Turns all AH phonemes into AA phonemes.
* This should really be done in the index itself
* @param utterance the utterance to fix
*/
private void fixPhoneme_AH(Utterance utterance) {
for (Item item = utterance.getRelation(Relation.SEGMENT).getHead();
item != null;
item = item.getNext()) {
if (item.getFeatures().getString("name").equals("ah")) {
item.getFeatures().setString("name", "aa");
}
}
}
// inherited from Object
public String toString() {
return "PostLexicalAnalyzer";
}
}</PRE>
<TABLE WIDTH=100% CELLPADDING=2 CELLSPACING=2>
<TR>
<TD BGCOLOR="#eeeeff">
<H2><A NAME="packaging"></A>Voice Packaging
</H2>
</TD>
</TR>
</TABLE>
<P> FreeTTS has been designed to allow flexible and dynamic addition of voices.
</P>
<H3>Voice Packages</H3>
<P>
Voices are defined by their corresponding VoiceDirectories. These directories
are what actually create the instances of the voices, and can create several
different voices. This is useful if a single voice can sound dramatically
different if it is created through different parameters. Then the directory
can return more than one instance of the same voice class though they may
sound different. It may also be useful for the same voice package to contain
more than one voice, allowing a single interface to those voices.
The voice directory MUST also provide a main() function that will print
out information about the voice if invoked. Typically this is done by
simply calling the VoiceDirectory's toString() method.
</P>
<P> A voice package is a jar file that contains exactly one subclass of
VoiceDirectory. The package probably contains data files as well as other
java classes that implement the voices provided. The jarfile Manifest
must also include three entries:</P>
<OL>
<LI><P>"Main-Class" which will be the VoiceDirectory class,
and prints out information about the voices provided</P>
<LI><P>"FreeTTSVoiceDefinition: true", which informs
FreeTTS that this jarfile is a voice package</P>
<LI><P>"Class-Path:" which lists all the jars upon which
this voice package is dependent. For example, the voice may
be dependent upon its lexicon jarfile. This allows a user
to simply execute the main() function without having to specify
all of the dependencies (which the user may not know).</P>
</OL>
<H3>Installing Voice Packages</H3>
<P>Voice Packages can be added to FreeTTS without any compilation. There
are two ways to alert FreeTTS to the presence of a new voice:</P>
<OL>
<LI><P>Listing of the VoiceDirectory classes that are loaded.</P>
<LI><P>Putting the packages in the correct directory and allowing
FreeTTS to automatically detect them.
[[[TODO: This is not yet implemented. For now use the listing method.]]]
</P>
</OL>
<P>Listing of the VoiceDirectory classes requires all of the required classes
to be appropriately in the java classpath. The names of the voice directory
classes are listed in voices files. When VoiceManager.getVoices() is
called, reads several files.</P>
<OL>
<LI><P>First, it looks for internal_voices.txt, stored
in the same directory as VoiceManager.class (If the VoiceManager is in a
jarfile, which it probably is, then this file is also inside the jar file).
If the file does not exist, FreeTTS moves on. internal_voices.txt only
exists to allow one to package FreeTTS into a single stand-alone jarfile,
as may be needed for applets. Avoid using internal_voices.txt if
at all possible. The file then requires you to ship all listed voices
along with FreeTTS and provides minimal flexibility.</P>
<LI><P>Next, FreeTTS looks for voices.txt in the same directory as
freetts.jar (assuming FreeTTS is being executed from a jar, which
it probably is). If the file does not exist, FreeTTS moves on.</P>
<LI><P>Last, if the system property "freetts.voicesfile"
is defined, then FreeTTS will use the voice directory classes
listed in that file.</P>
</OL>
<P>Voice packages can also be recognized simply by putting them in
the correct filesystem directory.
[[[TODO: At least, that is the plan. This is not yet actually implemented.]]]
If a jarfile is in the correct directory
and has the "FreeTTSVoiceDefinition: true" definition
in its Manifest, then it is assumed to be a voice package. The file
is then loaded along with all dependencies listed in the
"Class-Path:" definition. Whatever class is listed as the
"Main-Class:" is assumed to be the voice directory. There
are two ways to specify which filesystem directory to look in:</P>
<OL>
<LI><P>By default, FreeTTS will look in the same directory as
freetts.jar. (Assuming FreeTTS was loaded from a jarfile, which
it probably was).</P>
<LI><P>The directories specified by the system property
"freetts.voicespath".</P>
</OL>
<H3>Compiling Voice Packages</H3>
<P>To create a voice package you simply need to meet the qualifications
above. However that can be a bit of work. If you want to import a voice
from FestVox, there are tools in tools/FestVoxToFreeTTS/. View the
README file there for more information. The scripts can automatically
import a US/English voice, but is not designed to handle others. For the
simple case of US/English voices, simply put them in a subdirectory of
com/sun/speech/freetts/en/us/. Files ending with ".txt" will
be assumed to be data files for the voice and compiled into their
".bin" and ".idx" equivalents. The file
"voice.Manifest" will automatically be added to the Manifest
of the voice package's jarfile. The compilation system will automatically
detect new directories inside en/us, assume they are voice packages,
and create new jarfiles for them.</P>
<HR>
<P STYLE="margin-bottom: 0cm">See the <A HREF="../license.terms">license
terms</A> and <A HREF="../acknowledgments.txt">acknowledgments</A>.<BR>Copyright
2003 Sun Microsystems, Inc. All Rights Reserved. Use is subject to
license terms.
</P>
</BODY>
</HTML>
|