File size: 100,176 Bytes
6fa4bc9 | 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 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 | {
"paper_id": "P09-1015",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:54:50.913695Z"
},
"title": "Reducing the Annotation Effort for Letter-to-Phoneme Conversion",
"authors": [
{
"first": "Kenneth",
"middle": [],
"last": "Dwyer",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Alberta Edmonton",
"location": {
"postCode": "T6G 2E8",
"region": "AB",
"country": "Canada"
}
},
"email": "dwyer@cs.ualberta.ca"
},
{
"first": "Grzegorz",
"middle": [],
"last": "Kondrak",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Alberta Edmonton",
"location": {
"postCode": "T6G 2E8",
"region": "AB",
"country": "Canada"
}
},
"email": "kondrak@cs.ualberta.ca"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Letter-to-phoneme (L2P) conversion is the process of producing a correct phoneme sequence for a word, given its letters. It is often desirable to reduce the quantity of training data-and hence human annotation-that is needed to train an L2P classifier for a new language. In this paper, we confront the challenge of building an accurate L2P classifier with a minimal amount of training data by combining several diverse techniques: context ordering, letter clustering, active learning, and phonetic L2P alignment. Experiments on six languages show up to 75% reduction in annotation effort.",
"pdf_parse": {
"paper_id": "P09-1015",
"_pdf_hash": "",
"abstract": [
{
"text": "Letter-to-phoneme (L2P) conversion is the process of producing a correct phoneme sequence for a word, given its letters. It is often desirable to reduce the quantity of training data-and hence human annotation-that is needed to train an L2P classifier for a new language. In this paper, we confront the challenge of building an accurate L2P classifier with a minimal amount of training data by combining several diverse techniques: context ordering, letter clustering, active learning, and phonetic L2P alignment. Experiments on six languages show up to 75% reduction in annotation effort.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "The task of letter-to-phoneme (L2P) conversion is to produce a correct sequence of phonemes, given the letters that comprise a word. An accurate L2P converter is an important component of a text-to-speech system. In general, a lookup table does not suffice for L2P conversion, since out-of-vocabulary words (e.g., proper names) are inevitably encountered. This motivates the need for classification techniques that can predict the phonemes for an unseen word.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Numerous studies have contributed to the development of increasingly accurate L2P systems Kienappel and Kneser, 2001; Bisani and Ney, 2002; Demberg et al., 2007; Jiampojamarn et al., 2008) . A common assumption made in these works is that ample amounts of labelled data are available for training a classifier. Yet, in practice, this is the case for only a small number of languages. In order to train an L2P classifier for a new language, we must first annotate words in that language with their correct phoneme sequences. As annotation is expensive, we would like to minimize the amount of effort that is required to build an adequate training set. The objective of this work is not necessarily to achieve state-of-the-art performance when presented with large amounts of training data, but to outperform other approaches when training data is limited.",
"cite_spans": [
{
"start": 90,
"end": 117,
"text": "Kienappel and Kneser, 2001;",
"ref_id": "BIBREF22"
},
{
"start": 118,
"end": 139,
"text": "Bisani and Ney, 2002;",
"ref_id": "BIBREF3"
},
{
"start": 140,
"end": 161,
"text": "Demberg et al., 2007;",
"ref_id": "BIBREF15"
},
{
"start": 162,
"end": 188,
"text": "Jiampojamarn et al., 2008)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This paper proposes a system for training an accurate L2P classifier while requiring as few annotated words as possible. We employ decision trees as our supervised learning method because of their transparency and flexibility. We incorporate context ordering into a decision tree learner that guides its tree-growing procedure towards generating more intuitive rules. A clustering over letters serves as a back-off model in cases where individual letter counts are unreliable. An active learning technique is employed to request the phonemes (labels) for the words that are expected to be the most informative. Finally, we apply a novel L2P alignment technique based on phonetic similarity, which results in impressive gains in accuracy without relying on any training data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Our empirical evaluation on several L2P datasets demonstrates that significant reductions in annotation effort are indeed possible in this domain. Individually, all four enhancements improve the accuracy of our decision tree learner. The combined system yields savings of up to 75% in the number of words that have to be labelled, and reductions of at least 52% are observed on all the datasets. This is achieved without any additional tuning for the various languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The paper is organized as follows. Section 2 explains how supervised learning for L2P conversion is carried out with decision trees, our classifier of choice. Sections 3 through 6 describe our four main contributions towards reducing the annotation effort for L2P: context ordering (Section 3), clustering letters (Section 4), active learning (Section 5), and phonetic alignment (Section 6). Our experimental setup and results are discussed in Sections 7 and 8, respectively. Finally, Section 9 offers some concluding remarks.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this work, we employ a decision tree model to learn the mapping from words to phoneme sequences. Decision tree learners are attractive because they are relatively fast to train, require little or no parameter tuning, and the resulting classifier can be interpreted by the user. A number of prior studies have applied decision trees to L2P data and have reported good generalization accuracy (Andersen et al., 1996; Kienappel and Kneser, 2001) . Also, the widely-used Festival Speech Synthesis System (Taylor et al., 1998) relies on decision trees for L2P conversion.",
"cite_spans": [
{
"start": 394,
"end": 417,
"text": "(Andersen et al., 1996;",
"ref_id": "BIBREF1"
},
{
"start": 418,
"end": 445,
"text": "Kienappel and Kneser, 2001)",
"ref_id": "BIBREF22"
},
{
"start": 503,
"end": 524,
"text": "(Taylor et al., 1998)",
"ref_id": "BIBREF30"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Decision tree learning of L2P classifiers",
"sec_num": "2"
},
{
"text": "We adopt the standard approach of using the letter context as features. The decision tree predicts the phoneme for the focus letter based on the m letters that appear before and after it in the word (including the focus letter itself, and beginning/end of word markers, where applicable). The model predicts a phoneme independently for each letter in a given word. In order to keep our model simple and transparent, we do not explore the possibility of conditioning on adjacent (predicted) phonemes. Any improvement in accuracy resulting from the inclusion of phoneme features would also be realized by the baseline that we compare against, and thus would not materially influence our findings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decision tree learning of L2P classifiers",
"sec_num": "2"
},
{
"text": "We employ binary decision trees because they substantially outperformed n-ary trees in our preliminary experiments. In L2P, there are many unique values for each attribute, namely, the letters of a given alphabet. In a n-ary tree each decision node partitions the data into n subsets, one per letter, that are potentially sparse. By contrast, a binary tree creates one branch for the nominated letter, and one branch grouping the remaining letters into a single subset. In the forthcoming experiments, we use binary decision trees exclusively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decision tree learning of L2P classifiers",
"sec_num": "2"
},
{
"text": "In the L2P task, context letters that are adjacent to the focus letter tend to be more important than context letters that are further away. For example, the English letter c is usually pronounced as [s] if the following letter is e or i. The general tree-growing algorithm has no notion of the letter distance, but instead chooses the letters on the ba-sis of their estimated information gain (Manning and Sch\u00fctze, 1999) . As a result, it will sometimes query a letter at position +3 (denoted l 3 ), for example, before examining the letters that are closer to the center of the context window.",
"cite_spans": [
{
"start": 394,
"end": 421,
"text": "(Manning and Sch\u00fctze, 1999)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Context ordering",
"sec_num": "3"
},
{
"text": "We propose to modify the tree-growing procedure to encourage the selection of letters near the focus letter before those at greater offsets are examined. In its strictest form, which resembles the \"dynamically expanding context\" search strategy of Davel and Barnard (2004) , l i can only be queried after l 0 , . . . , l i\u22121 have been queried. However, this approach seems overly rigid for L2P. In English, for example, l 2 can directly influence the pronunciation of a vowel regardless of the value of l 1 (c.f., the difference between rid and ride).",
"cite_spans": [
{
"start": 248,
"end": 272,
"text": "Davel and Barnard (2004)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Context ordering",
"sec_num": "3"
},
{
"text": "Instead, we adopt a less intrusive strategy, which we refer to as \"context ordering,\" that biases the decision tree toward letters that are closer to the focus, but permits gaps when the information gain for a distant letter is relatively high. Specifically, the ordering constraint described above is still applied, but only to letters that have aboveaverage information gain (where the average is calculated across all letters/attributes). This means that a letter with above-average gain that is eligible with respect to the ordering will take precedence over an ineligible letter that has an even higher gain. However, if all the eligible letters have below-average gain, the ineligible letter with the highest gain is selected irrespective of its position. Our only strict requirement is that the focus letter must always be queried first, unless its information gain is zero. Kienappel and Kneser (2001) also worked on improving decision tree performance for L2P, and devised tie-breaking rules in the event that the treegrowing procedure ranked two or more questions as being equally informative. In our experience with L2P datasets, exact ties are rare; our context ordering mechanism will have more opportunities to guide the tree-growing process. We expect this change to improve accuracy, especially when the amount of training data is very limited. By biasing the decision tree learner toward questions that are intuitively of greater utility, we make it less prone to overfitting on small data samples.",
"cite_spans": [
{
"start": 882,
"end": 909,
"text": "Kienappel and Kneser (2001)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Context ordering",
"sec_num": "3"
},
{
"text": "A decision tree trained on L2P data bases its phonetic predictions on the surrounding letter context. Yet, when making predictions for unseen words, contexts will inevitably be encountered that did not appear in the training data. Instead of relying solely on the particular letters that surround the focus letter, we postulate that the learner could achieve better generalization if it had access to information about the types of letters that appear before and after. That is, instead of treating letters as abstract symbols, we would like to encode knowledge of the similarity between certain letters as features. One way of achieving this goal is to group the letters into classes or clusters based on their contextual similarity. Then, when a prediction has to be made for an unseen (or low probability) letter sequence, the letter classes can provide additional information. Kienappel and Kneser (2001) report accuracy gains when applying letter clustering to the L2P task. However, their decision tree learner incorporates neighboring phoneme predictions, and employs a variety of different pruning strategies; the portion of the gains attributable to letter clustering are not evident. In addition to exploring the effect of letter clustering on a wider range of languages, we are particularly concerned with the impact that clustering has on decision tree performance when the training set is small. The addition of letter class features to the data may enable the active learner to better evaluate candidate words in the pool, and therefore make more informed selections.",
"cite_spans": [
{
"start": 881,
"end": 908,
"text": "Kienappel and Kneser (2001)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Clustering letters",
"sec_num": "4"
},
{
"text": "To group the letters into classes, we employ a hierarchical clustering algorithm (Brown et al., 1992) . One advantage of inducing a hierarchy is that we need not commit to a particular level of granularity; in other words, we are not required to specify the number of classes beforehand, as is the case with some other clustering algorithms. 1 The clustering algorithm is initialized by placing each letter in its own class, and then proceeds in a bottom-up manner. At each step, the pair of classes is merged that leads to the smallest loss in the average mutual information (Manning and Sch\u00fctze, 1999) between adjacent classes. The merging process repeats until a single class remains that contains all the letters in the alphabet. Recall that in our problem setting we have access to a (presumably) large pool of unannotated words. The unigram and bigram frequencies required by the clustering algorithm are cal-1 This approach is inspired by the work of Miller et al. (2004) , who clustered words for a named-entity tagging task. Table 1 : Hierarchical clustering of English letters culated from these words; hence, the letters can be grouped into classes prior to annotation. The letter classes only need to be computed once for a given language. We implemented a brute-force version of the algorithm that examines all the possible merges at each step, and generates a hierarchy within a few hours. However, when dealing with a larger number of unique tokens (e.g., when clustering words instead of letters), additional optimizations are needed in order to make the procedure tractable.",
"cite_spans": [
{
"start": 81,
"end": 101,
"text": "(Brown et al., 1992)",
"ref_id": "BIBREF6"
},
{
"start": 342,
"end": 343,
"text": "1",
"ref_id": null
},
{
"start": 958,
"end": 978,
"text": "Miller et al. (2004)",
"ref_id": "BIBREF27"
}
],
"ref_spans": [
{
"start": 1034,
"end": 1041,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Clustering letters",
"sec_num": "4"
},
{
"text": "The resulting hierarchy takes the form of a binary tree, where the root node/cluster contains all the letters, and each leaf contains a single letter. Hence, each letter can be represented by a bit string that describes the path from the root to its leaf. As an illustration, the clustering in Table 1 was automatically generated from the words in the English CMU Pronouncing Dictionary (Carnegie Mellon University, 1998). It is interesting to note that the first bit distinguishes vowels from consonants, meaning that these were the last two groups that were merged by the clustering algorithm. Note also that the beginning/end of word marker (#) is included in the hierarchy, and is the last character to be absorbed into a larger cluster. This indicates that # carries more information than most letters, as is to be expected, in light of its distinct status. We also experimented with a manually-constructed letter hierarchy, but observed no significant differences in accuracy vis\u00e0-vis the automatic clustering.",
"cite_spans": [],
"ref_spans": [
{
"start": 294,
"end": 301,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Clustering letters",
"sec_num": "4"
},
{
"text": "Whereas a passive supervised learning algorithm is provided with a collection of training examples that are typically drawn at random, an active learner has control over the labelled data that it obtains (Cohn et al., 1992) . The latter attempts to select its training set intelligently by requesting the labels of only those examples that are judged to be the most useful or informative. Numerous studies have demonstrated that active learners can make more efficient use of unlabelled data than do passive learners (Abe and Mamitsuka, 1998; Miller et al., 2004; Culotta and McCallum, 2005) . However, relatively few researchers have applied active learning techniques to the L2P domain. This is despite the fact that annotated data for training an L2P classifier is not available in most languages. We briefly review two relevant studies before proceeding to describe our active learning strategy.",
"cite_spans": [
{
"start": 204,
"end": 223,
"text": "(Cohn et al., 1992)",
"ref_id": "BIBREF8"
},
{
"start": 517,
"end": 542,
"text": "(Abe and Mamitsuka, 1998;",
"ref_id": "BIBREF0"
},
{
"start": 543,
"end": 563,
"text": "Miller et al., 2004;",
"ref_id": "BIBREF27"
},
{
"start": 564,
"end": 591,
"text": "Culotta and McCallum, 2005)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Active learning",
"sec_num": "5"
},
{
"text": "Maskey et al. 2004propose a bootstrapping technique that iteratively requests the labels of the n most frequent words in a corpus. A classifier is trained on the words that have been annotated thus far, and then predicts the phonemes for each of the n words being considered. Words for which the prediction confidence is above a certain threshold are immediately added to the lexicon, while the remaining words must be verified (and corrected, if necessary) by a human annotator. The main drawback of such an approach lies in the risk of adding erroneous entries to the lexicon when the classifier is overly confident in a prediction. Kominek and Black (2006) devise a word selection strategy based on letter n-gram coverage and word length. Their method slightly outperforms random selection, thereby establishing passive learning as a strong baseline. However, only a single Italian dataset was used, and the results do not necessarily generalize to other languages.",
"cite_spans": [
{
"start": 635,
"end": 659,
"text": "Kominek and Black (2006)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Active learning",
"sec_num": "5"
},
{
"text": "In this paper, we propose to apply an active learning technique known as Query-by-Bagging (Abe and Mamitsuka, 1998) . We consider a pool-based active learning setting, whereby the learner has access to a pool of unlabelled examples (words), and may obtain labels (phoneme sequences) at a cost. This is an iterative procedure in which the learner trains a classifier on the current set of labelled training data, then selects one or more new examples to label, according to the classifier's predictions on the pool data. Once labelled, these examples are added to the training set, the classifier is re-trained, and the process repeats until some stopping criterion is met (e.g., annotation resources are exhausted).",
"cite_spans": [
{
"start": 90,
"end": 115,
"text": "(Abe and Mamitsuka, 1998)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Active learning",
"sec_num": "5"
},
{
"text": "Query-by-Bagging (QBB) is an instance of the Query-by-Committee algorithm (Freund et al., 1997) , which selects examples that have high classification variance. At each iteration, QBB employs the bagging procedure (Breiman, 1996) to create a committee of classifiers C. Given a training set T containing k examples (in our setting, k is the total number of letters that have been labelled), bagging creates each committee member by sampling k times from T (with replacement), and then training a classifier C i on the resulting data. The example in the pool that maximizes the disagreement among the predictions of the committee members is selected.",
"cite_spans": [
{
"start": 74,
"end": 95,
"text": "(Freund et al., 1997)",
"ref_id": "BIBREF17"
},
{
"start": 214,
"end": 229,
"text": "(Breiman, 1996)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Active learning",
"sec_num": "5"
},
{
"text": "A crucial question is how to calculate the disagreement among the predicted phoneme sequences for a word in the pool. In the L2P domain, we assume that a human annotator specifies the phonemes for an entire word, and that the active learner cannot query individual letters. We require a measure of confidence at the word level; yet, our classifiers make predictions at the letter level. This is analogous to the task of estimating record confidence using field confidence scores in information extraction (Culotta and McCallum, 2004) .",
"cite_spans": [
{
"start": 505,
"end": 533,
"text": "(Culotta and McCallum, 2004)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Active learning",
"sec_num": "5"
},
{
"text": "Our solution is as follows. Let w be a word in the pool. Each classifier C i predicts the phoneme for each letter l \u2208 w. These \"votes\" are aggregated to produce a vector v l for letter l that indicates the distribution of the |C| predictions over its possible phonemes. We then compute the margin for each letter: If {p, p } \u2208 v l are the two highest vote totals, then the margin is M (v l ) = |p \u2212 p |. A small margin indicates disagreement among the constituent classifiers. We define the disagreement score for the entire word as the minimum margin:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Active learning",
"sec_num": "5"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "score(w) = min l\u2208w {M (v l )}",
"eq_num": "(1)"
}
],
"section": "Active learning",
"sec_num": "5"
},
{
"text": "We also experimented with maximum vote entropy and average margin/entropy, where the average is taken over all the letters in a word. The minimum margin exhibited the best performance on our development data; hence, we do not provide a detailed evaluation of the other measures.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Active learning",
"sec_num": "5"
},
{
"text": "Before supervised learning can take place, the letters in each word need to be aligned with phonemes. However, a lexicon typically provides just the letter and phoneme sequences for each word, without specifying the specific phoneme(s) that each letter elicits. The sub-task of L2P that pairs letters with phonemes in the training data is referred to as alignment. The L2P alignments that are specified in the training data can influence the accuracy of the resulting L2P classifier. In our setting, we are interested in mapping each letter to either a single phoneme or the \"null\" phoneme.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "6"
},
{
"text": "The standard approach to L2P alignment is described by Damper et al. (2005) . It performs an Expectation-Maximization (EM) procedure that takes a (preferably large) collection of words as input and computes alignments for them simultaneously. However, since in our active learning setting the data is acquired incrementally, we cannot count on the initial availability of a substantial set of words accompanied by their phonemic transcriptions.",
"cite_spans": [
{
"start": 55,
"end": 75,
"text": "Damper et al. (2005)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "6"
},
{
"text": "In this paper, we apply the ALINE algorithm to the task of L2P alignment (Kondrak, 2000; Inkpen et al., 2007) . ALINE, which performs phonetically-informed alignment of two strings of phonemes, requires no training data, and so is ideal for our purposes. Since our task requires the alignment of phonemes with letters, we wish to replace every letter with a phoneme that is the most likely to be produced by that letter. On the other hand, we would like our approach to be languageindependent. Our solution is to simply treat every letter as an IPA symbol (International Phonetic Association, 1999) . The IPA is based on the Roman alphabet, but also includes a number of other symbols. The 26 IPA letter symbols tend to correspond to the usual phonetic value that the letter represents in the Latin script. 2 For example, the IPA symbol [m] denotes \"voiced bilabial nasal,\" which is the phoneme represented by the letter m in most languages that utilize Latin script.",
"cite_spans": [
{
"start": 73,
"end": 88,
"text": "(Kondrak, 2000;",
"ref_id": "BIBREF24"
},
{
"start": 89,
"end": 109,
"text": "Inkpen et al., 2007)",
"ref_id": "BIBREF18"
},
{
"start": 556,
"end": 598,
"text": "(International Phonetic Association, 1999)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "6"
},
{
"text": "The alignments produced by ALINE are of high quality. The example below shows the alignment of the Italian word scianchi to its phonetic transcription [SaNki] . ALINE correctly aligns not only identical IPA symbols (i:i), but also IPA symbols that represent similar sounds (s:S, n:N, c:k). s c i a n c h i",
"cite_spans": [
{
"start": 151,
"end": 158,
"text": "[SaNki]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "6"
},
{
"text": "| | | | | S a N k i 7 Experimental setup",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "6"
},
{
"text": "We performed experiments on six datasets, which were obtained from the PRONALSYL letterto-phoneme conversion challenge. 3 They are: English CMUDict (Carnegie Mellon University, 1998); French BRULEX (Content et al., 1990) , Dutch and German CELEX (Baayen et al., 1996) , the Italian Festival dictionary (Cosi et al., 2000) , and the Spanish lexicon. Duplicate words and words containing punctuation or numerals were removed, as were abbreviations and acronyms. The resulting datasets range in size from 31,491 to 111,897 words. The PRONALSYL datasets are already divided into 10 folds; we used the first fold as our test set, and the other folds were merged together to form the learning set. In our preliminary experiments, we randomly set aside 10 percent of this learning set to serve as our development set. Since the focus of our work is on algorithmic enhancements, we simulate the annotator with an oracle and do not address the potential human interface factors. During an experiment, 100 words were drawn at random from the learning set; these constituted the data on which an initial classifier was trained. The rest of the words in the learning set formed the unlabelled pool for active learning; their phonemes were hidden, and a given word's phonemes were revealed if the word was selected for labelling. After training a classifier on the 100 annotated words, we performed 190 iterations of active learning. On each iteration, 10 words were selected according to Equation 1, labelled by an oracle, and added to the training set. In order to speed up the experiments, a random sample of 2000 words was drawn from the pool and presented to the active learner each time. Hence, QBB selected 10 words from the 2000 candidates. We set the QBB committee size |C| to 10.",
"cite_spans": [
{
"start": 198,
"end": 220,
"text": "(Content et al., 1990)",
"ref_id": "BIBREF9"
},
{
"start": 223,
"end": 267,
"text": "Dutch and German CELEX (Baayen et al., 1996)",
"ref_id": null
},
{
"start": 302,
"end": 321,
"text": "(Cosi et al., 2000)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "6"
},
{
"text": "At each step, we measured word accuracy with respect to the holdout set as the percentage of test words that yielded no erroneous phoneme predictions. Henceforth, we use accuracy to refer to word accuracy. Note that although we query examples using a committee, we train a single tree on these examples in order to produce an intelligible model. Prior work has demonstrated that this configuration performs well in practice (Dwyer and Holte, 2007) . Our results report the accuracy of the single tree grown on each iteration, averaged over 10 random draws of the initial training set.",
"cite_spans": [
{
"start": 424,
"end": 447,
"text": "(Dwyer and Holte, 2007)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "6"
},
{
"text": "For our decision tree learner, we utilized the J48 algorithm provided by Weka (Witten and Frank, 2005) . We also experimented with Wagon (Taylor et al., 1998) , an implementation of CART, but J48 performed better during preliminary trials. We ran J48 with default parameter settings, except that binary trees were grown (see Section 2), and subtree raising was disabled. 4 Our feature template was established during development set experiments with the English CMU data; the data from the other five languages did not influence these choices. The letter context consisted of the focus letter and the 3 letters appearing before and after the focus (or beginning/end of word markers, where applicable). For letter class features, bit strings of length 1 through 6 were used for the focus letter and its immediate neighbors. Bit strings of length at most 3 were used at positions +2 and \u22122, and no such features were added at \u00b13. 5 We experimented with other configurations, including using bit strings of up to length 6 at all positions, but they did not produce consistent improvements over the selected scheme.",
"cite_spans": [
{
"start": 78,
"end": 102,
"text": "(Witten and Frank, 2005)",
"ref_id": "BIBREF31"
},
{
"start": 137,
"end": 158,
"text": "(Taylor et al., 1998)",
"ref_id": "BIBREF30"
},
{
"start": 371,
"end": 372,
"text": "4",
"ref_id": null
},
{
"start": 928,
"end": 929,
"text": "5",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "6"
},
{
"text": "We first examine the contributions of the individual system components, and then compare our complete system to the baseline. The dashed curves in Figure 1 represent the baseline performance with no clustering, no context ordering, random sampling, and ALINE, unless otherwise noted. In all plots, the error bars show the 99% confidence interval for the mean. Because the average word length differs across languages, we report the number of words along the x-axis. We have verified that our system does not substantially alter the average number of letters per word in the training set for any of these languages. Hence, the number of words reported here is representative of the true annotation effort. 4 Subtree raising is an expensive pruning operation that had a negligible impact on accuracy during preliminary experiments. Our pruning performs subtree replacement only.",
"cite_spans": [
{
"start": 705,
"end": 706,
"text": "4",
"ref_id": null
}
],
"ref_spans": [
{
"start": 147,
"end": 155,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "8"
},
{
"text": "5 The idea of lowering the specificity of letter class questions as the context length increases is due to Kienappel and Kneser (2001) , and is intended to avoid overfitting. However, their configuration differs from ours in that they use longer context lengths (4 for German and 5 for English) and ask letter class questions at every position. Essentially, the authors tuned the feature set in order to optimize performance on each problem, whereas we seek a more general representation that will perform well on a variety of languages.",
"cite_spans": [
{
"start": 107,
"end": 134,
"text": "Kienappel and Kneser (2001)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "8"
},
{
"text": "Our context ordering strategy improved the accuracy of the decision tree learner on every language (see Figure 1a) . Statistically significant improvements were realized on Dutch, French, and German. Our expectation was that context ordering would be particularly helpful during the early rounds of active learning, when there is a greater risk of overfitting on the small training sets. For some languages (notably, German and Spanish) this was indeed the case; yet, for Dutch, context ordering became more effective as the training set increased in size.",
"cite_spans": [],
"ref_spans": [
{
"start": 104,
"end": 114,
"text": "Figure 1a)",
"ref_id": null
}
],
"eq_spans": [],
"section": "Context ordering",
"sec_num": "8.1"
},
{
"text": "It should be noted that our context ordering strategy is sufficiently general that it can be implemented in other decision tree learners that grow binary trees, such as Wagon/CART (Taylor et al., 1998 ). An n-ary implementation is also feasible, although we have not tried this variation.",
"cite_spans": [
{
"start": 180,
"end": 200,
"text": "(Taylor et al., 1998",
"ref_id": "BIBREF30"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Context ordering",
"sec_num": "8.1"
},
{
"text": "As can be seen in Figure 1b , clustering letters into classes tended to produce a steady increase in accuracy. The only case where it had no statistically significant effect was on English. Another benefit of clustering is that it reduces variance. The confidence intervals are generally wider when clustering is disabled, meaning that the system's performance was less sensitive to changes in the initial training set when letter classes were used.",
"cite_spans": [],
"ref_spans": [
{
"start": 18,
"end": 27,
"text": "Figure 1b",
"ref_id": null
}
],
"eq_spans": [],
"section": "Clustering letters",
"sec_num": "8.2"
},
{
"text": "On five of the six datasets, Query-by-Bagging required significantly fewer labelled examples to reach the maximum level of performance achieved by the passive learner (see Figure 1c) . For instance, on the Spanish dataset, random sampling reached 97% word accuracy after 1420 words had been annotated, whereas QBB did so with only 510 words -a 64% reduction in labelling effort. Similarly, savings ranging from 30% to 63% were observed for the other languages, with the exception of English, where a statistically insignificant 4% reduction was recorded. Since English is highly irregular in comparison with the other five languages, the active learner tends to query examples that are difficult to classify, but which are unhelpful in terms of generalization.",
"cite_spans": [],
"ref_spans": [
{
"start": 172,
"end": 182,
"text": "Figure 1c)",
"ref_id": null
}
],
"eq_spans": [],
"section": "Active learning",
"sec_num": "8.3"
},
{
"text": "It is important to note that empirical comparisons of different active learning techniques have shown that random sampling establishes a very 132 Figure 1 : Performance of the individual system components strong baseline on some datasets (Schein and Ungar, 2007; Settles and Craven, 2008) . It is rarely the case that a given active learning strategy is able to unanimously outperform random sampling across a range of datasets. From this perspective, to achieve statistically significant improvements on five of six L2P datasets (without ever being beaten by random) is an excellent result for QBB.",
"cite_spans": [
{
"start": 238,
"end": 262,
"text": "(Schein and Ungar, 2007;",
"ref_id": "BIBREF28"
},
{
"start": 263,
"end": 288,
"text": "Settles and Craven, 2008)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [
{
"start": 146,
"end": 154,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Active learning",
"sec_num": "8.3"
},
{
"text": "The ALINE method for L2P alignment outperformed EM on all six datasets (see Figure 1d ). As was mentioned in Section 6, the EM aligner depends on all the available training data, whereas ALINE processes words individually. Only on Spanish and Italian, languages which have highly regular spelling systems, was the EM aligner competitive with ALINE. The accuracy gains on the remaining four datasets are remarkable, considering that better alignments do not necessarily translate into improved classification.",
"cite_spans": [],
"ref_spans": [
{
"start": 76,
"end": 85,
"text": "Figure 1d",
"ref_id": null
}
],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "8.4"
},
{
"text": "We hypothesized that EM's inferior performance was due to the limited quantities of data that were available in the early stages of active learning. In a follow-up experiment, we allowed EM to align the entire learning set in advance, and these aligned entries were revealed when requested by the learner. We compared this with the usual procedure whereby EM is applied to the labelled training data at each iteration of learning. The learning curves (not shown) were virtually indistinguishable, and there were no statistically significant differences on any of the languages. EM appears to produce poor alignments regardless of the amount of available data. Figure 2 : Performance of the complete system 8.5 Complete system",
"cite_spans": [],
"ref_spans": [
{
"start": 660,
"end": 668,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "8.4"
},
{
"text": "The complete system consists of context ordering, clustering, Query-by-Bagging, and ALINE; the baseline represents random sampling with EM alignment and no additional enhancements. Figure 2 plots the word accuracies for all six datasets. Although the absolute word accuracies varied considerably across the different languages, our system significantly outperformed the baseline in every instance. On the French dataset, for example, the baseline labelled 1850 words before reaching its maximum accuracy of 64%, whereas the complete system required only 480 queries to reach 64% accuracy. This represents a reduction of 74% in the labelling effort. The savings for the other languages are: Spanish, 75%; Dutch, 68%; English, 59%; German, 59%; and Italian, 52%. 6 Interestingly, the savings are the highest on Spanish, even though the corresponding accuracy gains are the smallest. This demonstrates that our approach is also effective on languages with relatively transparent orthography.",
"cite_spans": [
{
"start": 761,
"end": 762,
"text": "6",
"ref_id": null
}
],
"ref_spans": [
{
"start": 181,
"end": 187,
"text": "Figure",
"ref_id": null
}
],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "8.4"
},
{
"text": "At first glance, the performance of both systems appears to be rather poor on the English dataset. To put our results into perspective, report 57.8% accuracy on this dataset with a similar alignment method and decision tree learner. Our baseline system achieves 57.3% accuracy when 90,000 words have been labelled. Hence, the low values in Figure 2 simply reflect the fact that many more examples are required to 6 The average savings in the number of labelled words with respect to the entire learning curve are similar, ranging from 50% on Italian to 73% on Spanish.",
"cite_spans": [
{
"start": 413,
"end": 414,
"text": "6",
"ref_id": null
}
],
"ref_spans": [
{
"start": 340,
"end": 348,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "8.4"
},
{
"text": "learn an accurate classifier for the English data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "L2P alignment",
"sec_num": "8.4"
},
{
"text": "We have presented a system for learning a letterto-phoneme classifier that combines four distinct enhancements in order to minimize the amount of data that must be annotated. Our experiments involving datasets from several languages clearly demonstrate that unlabelled data can be used more efficiently, resulting in greater accuracy for a given training set size, without any additional tuning for the different languages. The experiments also show that a phonetically-based aligner may be preferable to the widely-used EM alignment technique, a discovery that could lead to the improvement of L2P accuracy in general.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "9"
},
{
"text": "While this work represents an important step in reducing the cost of constructing an L2P training set, we intend to explore other active learners and classification algorithms, including sequence labelling strategies (Settles and Craven, 2008) . We also plan to incorporate user-centric enhancements (Davel and Barnard, 2004; Culotta and Mc-Callum, 2005 ) with the aim of reducing both the effort and expertise that is required to annotate words with their phoneme sequences.",
"cite_spans": [
{
"start": 217,
"end": 243,
"text": "(Settles and Craven, 2008)",
"ref_id": "BIBREF29"
},
{
"start": 300,
"end": 325,
"text": "(Davel and Barnard, 2004;",
"ref_id": "BIBREF14"
},
{
"start": 326,
"end": 353,
"text": "Culotta and Mc-Callum, 2005",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "9"
},
{
"text": "ALINE can also be applied to non-Latin scripts by replacing every grapheme with the IPA symbol that is phonetically closest to it(Jiampojamarn et al., 2009).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Available at http://pascallin.ecs.soton.ac.uk/Challenges/ PRONALSYL/Datasets/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to thank Sittichai Jiampojamarn for helpful discussions and for providing an implementation of the Expectation-Maximization alignment algorithm. This research was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) and the Informatics Circle of Research Excellence (iCORE).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Query learning strategies using boosting and bagging",
"authors": [
{
"first": "Naoki",
"middle": [],
"last": "Abe",
"suffix": ""
},
{
"first": "Hiroshi",
"middle": [],
"last": "Mamitsuka",
"suffix": ""
}
],
"year": 1998,
"venue": "Proc. International Conference on Machine Learning",
"volume": "",
"issue": "",
"pages": "1--9",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Naoki Abe and Hiroshi Mamitsuka. 1998. Query learning strategies using boosting and bagging. In Proc. International Conference on Machine Learn- ing, pages 1-9.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Comparison of two tree-structured approaches for grapheme-to-phoneme conversion",
"authors": [
{
"first": "Ove",
"middle": [],
"last": "Andersen",
"suffix": ""
},
{
"first": "Ronald",
"middle": [],
"last": "Kuhn",
"suffix": ""
},
{
"first": "Ariane",
"middle": [],
"last": "Lazarid\u00e8s",
"suffix": ""
},
{
"first": "Paul",
"middle": [],
"last": "Dalsgaard",
"suffix": ""
},
{
"first": "J\u00fcrgen",
"middle": [],
"last": "Haas",
"suffix": ""
},
{
"first": "Elmar",
"middle": [],
"last": "N\u00f6th",
"suffix": ""
}
],
"year": 1996,
"venue": "Proc. International Conference on Spoken Language Processing",
"volume": "3",
"issue": "",
"pages": "1700--1703",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ove Andersen, Ronald Kuhn, Ariane Lazarid\u00e8s, Paul Dalsgaard, J\u00fcrgen Haas, and Elmar N\u00f6th. 1996. Comparison of two tree-structured approaches for grapheme-to-phoneme conversion. In Proc. Inter- national Conference on Spoken Language Process- ing, volume 3, pages 1700-1703.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "The CELEX2 lexical database. Linguistic Data Consortium",
"authors": [
{
"first": "R",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "Harald",
"middle": [],
"last": "Baayen",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Piepenbrock",
"suffix": ""
},
{
"first": "Leon",
"middle": [],
"last": "Gulikers",
"suffix": ""
}
],
"year": 1996,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Harald Baayen, Richard Piepenbrock, and Leon Gu- likers, 1996. The CELEX2 lexical database. Lin- guistic Data Consortium, Univ. of Pennsylvania.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Investigations on joint-multigram models for grapheme-tophoneme conversion",
"authors": [
{
"first": "Maximilian",
"middle": [],
"last": "Bisani",
"suffix": ""
},
{
"first": "Hermann",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc. International Conference on Spoken Language Processing",
"volume": "",
"issue": "",
"pages": "105--108",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maximilian Bisani and Hermann Ney. 2002. Investi- gations on joint-multigram models for grapheme-to- phoneme conversion. In Proc. International Confer- ence on Spoken Language Processing, pages 105- 108.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Issues in building general letter to sound rules",
"authors": [
{
"first": "Alan",
"middle": [
"W"
],
"last": "Black",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Lenzo",
"suffix": ""
},
{
"first": "Vincent",
"middle": [],
"last": "Pagel",
"suffix": ""
}
],
"year": 1998,
"venue": "ESCA Workshop on Speech Synthesis",
"volume": "",
"issue": "",
"pages": "77--80",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alan W. Black, Kevin Lenzo, and Vincent Pagel. 1998. Issues in building general letter to sound rules. In ESCA Workshop on Speech Synthesis, pages 77-80.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Bagging predictors",
"authors": [
{
"first": "Leo",
"middle": [],
"last": "Breiman",
"suffix": ""
}
],
"year": 1996,
"venue": "Machine Learning",
"volume": "24",
"issue": "",
"pages": "123--140",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Leo Breiman. 1996. Bagging predictors. Machine Learning, 24(2):123-140.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Class-based n-gram models of natural language",
"authors": [
{
"first": "F",
"middle": [],
"last": "Peter",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Brown",
"suffix": ""
},
{
"first": "J",
"middle": [
"Della"
],
"last": "Vincent",
"suffix": ""
},
{
"first": "Peter",
"middle": [
"V"
],
"last": "Pietra",
"suffix": ""
},
{
"first": "Jennifer",
"middle": [
"C"
],
"last": "Desouza",
"suffix": ""
},
{
"first": "Robert",
"middle": [
"L"
],
"last": "Lai",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mercer",
"suffix": ""
}
],
"year": 1992,
"venue": "Computational Linguistics",
"volume": "18",
"issue": "4",
"pages": "467--479",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter F. Brown, Vincent J. Della Pietra, Peter V. deS- ouza, Jennifer C. Lai, and Robert L. Mercer. 1992. Class-based n-gram models of natural language. Computational Linguistics, 18(4):467-479.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "The Carnegie Mellon pronouncing dictionary",
"authors": [],
"year": 1998,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Carnegie Mellon University. 1998. The Carnegie Mel- lon pronouncing dictionary.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Improving generalization with active learning",
"authors": [
{
"first": "David",
"middle": [
"A"
],
"last": "Cohn",
"suffix": ""
},
{
"first": "Les",
"middle": [
"E"
],
"last": "Atlas",
"suffix": ""
},
{
"first": "Richard",
"middle": [
"E"
],
"last": "Ladner",
"suffix": ""
}
],
"year": 1992,
"venue": "Machine Learning",
"volume": "15",
"issue": "",
"pages": "201--221",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David A. Cohn, Les E. Atlas, and Richard E. Ladner. 1992. Improving generalization with active learn- ing. Machine Learning, 15(2):201-221.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Brulex: Une base de donn\u00e9es lexicales informatis\u00e9e pour le fran\u00e7ais \u00e9crit et parl\u00e9. L'ann\u00e9e Psychologique",
"authors": [
{
"first": "Alain",
"middle": [],
"last": "Content",
"suffix": ""
},
{
"first": "Phillppe",
"middle": [],
"last": "Mousty",
"suffix": ""
},
{
"first": "Monique",
"middle": [],
"last": "Radeau",
"suffix": ""
}
],
"year": 1990,
"venue": "",
"volume": "90",
"issue": "",
"pages": "551--566",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alain Content, Phillppe Mousty, and Monique Radeau. 1990. Brulex: Une base de donn\u00e9es lexicales in- formatis\u00e9e pour le fran\u00e7ais \u00e9crit et parl\u00e9. L'ann\u00e9e Psychologique, 90:551-566.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Festival parla Italiano",
"authors": [
{
"first": "Piero",
"middle": [],
"last": "Cosi",
"suffix": ""
},
{
"first": "Roberto",
"middle": [],
"last": "Gretter",
"suffix": ""
},
{
"first": "Fabio",
"middle": [],
"last": "Tesser",
"suffix": ""
}
],
"year": 2000,
"venue": "Proc. Giornate del Gruppo di Fonetica Sperimentale",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Piero Cosi, Roberto Gretter, and Fabio Tesser. 2000. Festival parla Italiano. In Proc. Giornate del Gruppo di Fonetica Sperimentale.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Confidence estimation for information extraction",
"authors": [
{
"first": "Aron",
"middle": [],
"last": "Culotta",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Mccallum",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. HLT-NAACL",
"volume": "",
"issue": "",
"pages": "109--114",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Aron Culotta and Andrew McCallum. 2004. Con- fidence estimation for information extraction. In Proc. HLT-NAACL, pages 109-114.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Reducing labeling effort for structured prediction tasks",
"authors": [
{
"first": "Aron",
"middle": [],
"last": "Culotta",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Mccallum",
"suffix": ""
}
],
"year": 2005,
"venue": "Proc. National Conference on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "746--751",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Aron Culotta and Andrew McCallum. 2005. Reduc- ing labeling effort for structured prediction tasks. In Proc. National Conference on Artificial Intelligence, pages 746-751.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Aligning text and phonemes for speech technology applications using an EM-like algorithm",
"authors": [
{
"first": "Robert",
"middle": [
"I"
],
"last": "Damper",
"suffix": ""
},
{
"first": "Yannick",
"middle": [],
"last": "Marchand",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "John-David",
"suffix": ""
},
{
"first": "Alexander",
"middle": [
"I"
],
"last": "Marsters",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Bazin",
"suffix": ""
}
],
"year": 2005,
"venue": "International Journal of Speech Technology",
"volume": "8",
"issue": "2",
"pages": "147--160",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robert I. Damper, Yannick Marchand, John-David S. Marsters, and Alexander I. Bazin. 2005. Align- ing text and phonemes for speech technology appli- cations using an EM-like algorithm. International Journal of Speech Technology, 8(2):147-160.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "The efficient generation of pronunciation dictionaries: Human factors during bootstrapping",
"authors": [
{
"first": "Marelie",
"middle": [],
"last": "Davel",
"suffix": ""
},
{
"first": "Etienne",
"middle": [],
"last": "Barnard",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. International Conference on Spoken Language Processing",
"volume": "",
"issue": "",
"pages": "2797--2800",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marelie Davel and Etienne Barnard. 2004. The effi- cient generation of pronunciation dictionaries: Hu- man factors during bootstrapping. In Proc. Interna- tional Conference on Spoken Language Processing, pages 2797-2800.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Phonological constraints and morphological preprocessing for grapheme-to-phoneme conversion",
"authors": [
{
"first": "Vera",
"middle": [],
"last": "Demberg",
"suffix": ""
},
{
"first": "Helmut",
"middle": [],
"last": "Schmid",
"suffix": ""
},
{
"first": "Gregor",
"middle": [],
"last": "M\u00f6hler",
"suffix": ""
}
],
"year": 2007,
"venue": "Proc. ACL",
"volume": "",
"issue": "",
"pages": "96--103",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vera Demberg, Helmut Schmid, and Gregor M\u00f6hler. 2007. Phonological constraints and morphologi- cal preprocessing for grapheme-to-phoneme conver- sion. In Proc. ACL, pages 96-103.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Decision tree instability and active learning",
"authors": [
{
"first": "Kenneth",
"middle": [],
"last": "Dwyer",
"suffix": ""
},
{
"first": "Robert",
"middle": [],
"last": "Holte",
"suffix": ""
}
],
"year": 2007,
"venue": "Proc. European Conference on Machine Learning",
"volume": "",
"issue": "",
"pages": "128--139",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kenneth Dwyer and Robert Holte. 2007. Decision tree instability and active learning. In Proc. European Conference on Machine Learning, pages 128-139.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Selective sampling using the query by committee algorithm",
"authors": [
{
"first": "Yoav",
"middle": [],
"last": "Freund",
"suffix": ""
},
{
"first": "H",
"middle": [
"Sebastian"
],
"last": "Seung",
"suffix": ""
},
{
"first": "Eli",
"middle": [],
"last": "Shamir",
"suffix": ""
},
{
"first": "Naftali",
"middle": [],
"last": "Tishby",
"suffix": ""
}
],
"year": 1997,
"venue": "Machine Learning",
"volume": "28",
"issue": "",
"pages": "133--168",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yoav Freund, H. Sebastian Seung, Eli Shamir, and Naf- tali Tishby. 1997. Selective sampling using the query by committee algorithm. Machine Learning, 28(2-3):133-168.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Graphon: un outil pour la transcription phon\u00e9tique des mots fran\u00e7ais",
"authors": [
{
"first": "Diana",
"middle": [],
"last": "Inkpen",
"suffix": ""
},
{
"first": "Rapha\u00eblle",
"middle": [],
"last": "Martin",
"suffix": ""
},
{
"first": "Alain",
"middle": [],
"last": "Desrochers",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diana Inkpen, Rapha\u00eblle Martin, and Alain Desrochers. 2007. Graphon: un outil pour la transcription phon\u00e9tique des mots fran\u00e7ais. Unpublished manuscript.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Handbook of the International Phonetic Association: A Guide to the Use of the International Phonetic Alphabet",
"authors": [],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "International Phonetic Association. 1999. Handbook of the International Phonetic Association: A Guide to the Use of the International Phonetic Alphabet. Cambridge University Press.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Joint processing and discriminative training for letter-to-phoneme conversion",
"authors": [
{
"first": "Sittichai",
"middle": [],
"last": "Jiampojamarn",
"suffix": ""
},
{
"first": "Colin",
"middle": [],
"last": "Cherry",
"suffix": ""
},
{
"first": "Grzegorz",
"middle": [],
"last": "Kondrak",
"suffix": ""
}
],
"year": 2008,
"venue": "Proc. ACL",
"volume": "",
"issue": "",
"pages": "905--913",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sittichai Jiampojamarn, Colin Cherry, and Grzegorz Kondrak. 2008. Joint processing and discriminative training for letter-to-phoneme conversion. In Proc. ACL, pages 905-913.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Di-recTL: a language-independent approach to transliteration",
"authors": [
{
"first": "Sittichai",
"middle": [],
"last": "Jiampojamarn",
"suffix": ""
},
{
"first": "Aditya",
"middle": [],
"last": "Bhargava",
"suffix": ""
},
{
"first": "Qing",
"middle": [],
"last": "Dou",
"suffix": ""
},
{
"first": "Kenneth",
"middle": [],
"last": "Dwyer",
"suffix": ""
},
{
"first": "Grzegorz",
"middle": [],
"last": "Kondrak",
"suffix": ""
}
],
"year": 2009,
"venue": "Named Entities Workshop (NEWS): Shared Task on Transliteration",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sittichai Jiampojamarn, Aditya Bhargava, Qing Dou, Kenneth Dwyer, and Grzegorz Kondrak. 2009. Di- recTL: a language-independent approach to translit- eration. In Named Entities Workshop (NEWS): Shared Task on Transliteration. Submitted.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Designing very compact decision trees for graphemeto-phoneme transcription",
"authors": [
{
"first": "Anne",
"middle": [
"K"
],
"last": "Kienappel",
"suffix": ""
},
{
"first": "Reinhard",
"middle": [],
"last": "Kneser",
"suffix": ""
}
],
"year": 2001,
"venue": "Proc. European Conference on Speech Communication and Technology",
"volume": "",
"issue": "",
"pages": "1911--1914",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Anne K. Kienappel and Reinhard Kneser. 2001. De- signing very compact decision trees for grapheme- to-phoneme transcription. In Proc. European Con- ference on Speech Communication and Technology, pages 1911-1914.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Learning pronunciation dictionaries: Language complexity and word selection strategies",
"authors": [
{
"first": "John",
"middle": [],
"last": "Kominek",
"suffix": ""
},
{
"first": "Alan",
"middle": [
"W"
],
"last": "Black",
"suffix": ""
}
],
"year": 2006,
"venue": "Proc. HLT-NAACL",
"volume": "",
"issue": "",
"pages": "232--239",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "John Kominek and Alan W. Black. 2006. Learn- ing pronunciation dictionaries: Language complex- ity and word selection strategies. In Proc. HLT- NAACL, pages 232-239.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "A new algorithm for the alignment of phonetic sequences",
"authors": [
{
"first": "Grzegorz",
"middle": [],
"last": "Kondrak",
"suffix": ""
}
],
"year": 2000,
"venue": "Proc. NAACL",
"volume": "",
"issue": "",
"pages": "288--295",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Grzegorz Kondrak. 2000. A new algorithm for the alignment of phonetic sequences. In Proc. NAACL, pages 288-295.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Foundations of Statistical Natural Language Processing",
"authors": [
{
"first": "D",
"middle": [],
"last": "Christopher",
"suffix": ""
},
{
"first": "Hinrich",
"middle": [],
"last": "Manning",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sch\u00fctze",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christopher D. Manning and Hinrich Sch\u00fctze. 1999. Foundations of Statistical Natural Language Pro- cessing. MIT Press.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Boostrapping phonetic lexicons for new languages",
"authors": [
{
"first": "R",
"middle": [],
"last": "Sameer",
"suffix": ""
},
{
"first": "Alan",
"middle": [
"W"
],
"last": "Maskey",
"suffix": ""
},
{
"first": "Laura",
"middle": [
"M"
],
"last": "Black",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Tomokiya",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. International Conference on Spoken Language Processing",
"volume": "",
"issue": "",
"pages": "69--72",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sameer R. Maskey, Alan W. Black, and Laura M. Tomokiya. 2004. Boostrapping phonetic lexicons for new languages. In Proc. International Confer- ence on Spoken Language Processing, pages 69-72.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Name tagging with word clusters and discriminative training",
"authors": [
{
"first": "Scott",
"middle": [],
"last": "Miller",
"suffix": ""
},
{
"first": "Jethran",
"middle": [],
"last": "Guinness",
"suffix": ""
},
{
"first": "Alex",
"middle": [],
"last": "Zamanian",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. HLT-NAACL",
"volume": "",
"issue": "",
"pages": "337--342",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Scott Miller, Jethran Guinness, and Alex Zamanian. 2004. Name tagging with word clusters and dis- criminative training. In Proc. HLT-NAACL, pages 337-342.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Active learning for logistic regression: an evaluation. Machine Learning",
"authors": [
{
"first": "Andrew",
"middle": [
"I"
],
"last": "Schein",
"suffix": ""
},
{
"first": "Lyle",
"middle": [
"H"
],
"last": "Ungar",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "68",
"issue": "",
"pages": "235--265",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andrew I. Schein and Lyle H. Ungar. 2007. Active learning for logistic regression: an evaluation. Ma- chine Learning, 68(3):235-265.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "An analysis of active learning strategies for sequence labeling tasks",
"authors": [
{
"first": "Burr",
"middle": [],
"last": "Settles",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Craven",
"suffix": ""
}
],
"year": 2008,
"venue": "Proc. Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1069--1078",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Burr Settles and Mark Craven. 2008. An analysis of active learning strategies for sequence labeling tasks. In Proc. Conference on Empirical Methods in Natural Language Processing, pages 1069-1078.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "The architecture of the Festival Speech Synthesis System",
"authors": [
{
"first": "Paul",
"middle": [
"A"
],
"last": "Taylor",
"suffix": ""
},
{
"first": "Alan",
"middle": [],
"last": "Black",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Caley",
"suffix": ""
}
],
"year": 1998,
"venue": "ESCA Workshop on Speech Synthesis",
"volume": "",
"issue": "",
"pages": "147--151",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Paul A. Taylor, Alan Black, and Richard Caley. 1998. The architecture of the Festival Speech Synthesis System. In ESCA Workshop on Speech Synthesis, pages 147-151.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Data Mining: Practical Machine Learning Tools and Techniques",
"authors": [
{
"first": "H",
"middle": [],
"last": "Ian",
"suffix": ""
},
{
"first": "Eibe",
"middle": [],
"last": "Witten",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Frank",
"suffix": ""
}
],
"year": 2005,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ian H. Witten and Eibe Frank. 2005. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, 2nd edition.",
"links": null
}
},
"ref_entries": {}
}
} |