File size: 102,859 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 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 |
{
"paper_id": "I17-1025",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T07:37:52.149568Z"
},
"title": "Unsupervised Segmentation of Phoneme Sequences based on Pitman-Yor Semi-Markov Model using Phoneme Length Context",
"authors": [
{
"first": "Ryu",
"middle": [],
"last": "Takeda",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Osaka University",
"location": {
"addrLine": "8-1",
"postCode": "567-0047",
"settlement": "Mihogaoka",
"region": "Ibaraki, Osaka",
"country": "Japan"
}
},
"email": "rtakeda@sanken.osaka-u.ac.jp"
},
{
"first": "Kazunori",
"middle": [],
"last": "Komatani",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Osaka University",
"location": {
"addrLine": "8-1",
"postCode": "567-0047",
"settlement": "Mihogaoka",
"region": "Ibaraki, Osaka",
"country": "Japan"
}
},
"email": "komatani@sanken.osaka-u.ac.jp"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Unsupervised segmentation of phoneme sequences is an essential process to obtain unknown words during spoken dialogues. In this segmentation, an input phoneme sequence without delimiters is converted into segmented sub-sequences corresponding to words. The Pitman-Yor semi-Markov model (PYSMM) is promising for this problem, but its performance degrades when it is applied to phonemelevel word segmentation. This is because of insufficient cues for the segmentation, e.g., homophones are improperly treated as single entries and their different contexts are also confused. We propose a phoneme-length context model for PYSMM to give a helpful cue at the phoneme-level and to predict succeeding segments more accurately. Our experiments showed that the peak performance with our context model outperformed those without such a context model by 0.045 at most in terms of Fmeasures of estimated segmentation.",
"pdf_parse": {
"paper_id": "I17-1025",
"_pdf_hash": "",
"abstract": [
{
"text": "Unsupervised segmentation of phoneme sequences is an essential process to obtain unknown words during spoken dialogues. In this segmentation, an input phoneme sequence without delimiters is converted into segmented sub-sequences corresponding to words. The Pitman-Yor semi-Markov model (PYSMM) is promising for this problem, but its performance degrades when it is applied to phonemelevel word segmentation. This is because of insufficient cues for the segmentation, e.g., homophones are improperly treated as single entries and their different contexts are also confused. We propose a phoneme-length context model for PYSMM to give a helpful cue at the phoneme-level and to predict succeeding segments more accurately. Our experiments showed that the peak performance with our context model outperformed those without such a context model by 0.045 at most in terms of Fmeasures of estimated segmentation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "The final goal of our current project is to achieve the development of robots or systems that acquire knowledge during spoken interactions between them and human beings in the open world. Unknown or new words appear frequently in our daily lives, and because their meanings may be different for the systems deployed in different areas, automatic lexicon acquisition is a useful function for maintenance-free spoken dialogue systems. In this paper, we focus on the phoneme-level representation of utterance -not in the signal-level -to relax the problem, which results in an issue with phoneme sequence segmentation. The segmentation converts an input phoneme sequence into segmented sub-sequences corresponding to individual words. The focus of our study is illustrated in Figure 1 . When the robot listens to a human utterance that includes an unknown word like \"tempura,\" the robot will estimate the unknown segment \"tempura\" by the iterative search based on trial-and-error of many hypotheses among different layers. Here, the phoneme sequence of an unknown word is necessary as an intermediate representation between signals and lexicon because we cannot directly obtain the spelling of an unknown word just from sound information. Note that our assumption of a phoneme sequence given is partly supported by the high accuracy of state-of-the-art speech and phoneme recognition Hinton et al., 2012; Seide et al., 2011a,b) .",
"cite_spans": [
{
"start": 1381,
"end": 1401,
"text": "Hinton et al., 2012;",
"ref_id": "BIBREF6"
},
{
"start": 1402,
"end": 1424,
"text": "Seide et al., 2011a,b)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 773,
"end": 781,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Motivation",
"sec_num": "1.1"
},
{
"text": "Approaches based on Bayesian nonparametrics are promising methods to achieve lexical acquisition from unsegmented characters or phonemes. Context (Bi-gram) (2,0) (2,2) (3,2) (0,3)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Motivation",
"sec_num": "1.1"
},
{
"text": "Our idea Figure 2 : Example of phoneme-length and its context phonemes corresponding to words with an unsupervised manner. The label represents the boundary of each word. Mochihashi et al. proposed the nested Pitman-Yor language model (NPYLM) (Mochihashi et al., 2009) , or Pitman-Yor semi-Markov model (PYSMM) in other words. The model achieved high computational efficiency and high segmentation accuracy compared with a previous method based on the hierarchical Dirichlet process using simple Gibbs sampling (Goldwater et al., 2006) . Uchiumi et al. also proposed a method that estimates the segmentation labels and part-of-speech tagging of words at the same time based on Pitman-Yor hidden semi-Markov models (PYHSMM) for characterlevel segmentation (Murphy, 2002; Uchiumi et al., 2015) . PYHSMM has not been applied to the segmentation of phoneme sequences. The difficulty with phoneme sequence segmentation is insufficient cues to distinguish or predict the context and segmentation labels. For example, the homophones are improperly treated as single entry and their different contexts are also confused in phoneme-level segmentation. This is a similar situation with the homographs in characterlevel segmentation, but it occurs much more frequently in phoneme-level segmentation, resulting in more serious problem. Although NPYLM and PYHSMM have been applied to character-level segmentation, they do not utilize cues useful for phoneme-level segmentation. We need to determine such useful cues to achieve accurate segmentation of phoneme sequences. Note that the performance comparison of NPYLM and PYHSMM methods in phoneme-level segmentation have not been conducted. We believe that comparing these methods on the basis of phoneme sequences is also useful for further improvement of the model.",
"cite_spans": [
{
"start": 171,
"end": 188,
"text": "Mochihashi et al.",
"ref_id": null
},
{
"start": 243,
"end": 268,
"text": "(Mochihashi et al., 2009)",
"ref_id": "BIBREF11"
},
{
"start": 511,
"end": 535,
"text": "(Goldwater et al., 2006)",
"ref_id": "BIBREF3"
},
{
"start": 755,
"end": 769,
"text": "(Murphy, 2002;",
"ref_id": "BIBREF13"
},
{
"start": 770,
"end": 791,
"text": "Uchiumi et al., 2015)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [
{
"start": 9,
"end": 17,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Motivation",
"sec_num": "1.1"
},
{
"text": "We propose a phoneme-length context model for segmentation, which was not used in the NPYLM and PYHSMM. Note that the length is not the duration of a phoneme (the phoneme 'a' continues for three frames in the time axis, for example), which is used in signal-level segmentation (Lee and Glass, 2012) . Figure 2 illustrates phoneme length and its contexts in the case of bi-grams. The phoneme sequence of 'see' and 'sea' is same and both lengths are two as shown in the left side of Fig. 2 . The context of phoneme length is the sequence of these lengths. For example, if 'him' succeeds to 'see', the bi-gram of phoneme length is the pair of 3 and 2 where 3 is the length of phonemes 'him' and 2 is the length of phonemes 'si:'. We denote the pair as (3, 2) as shown in the right side of Fig. 2 . Since the length of each segmented phoneme also depends on the previously segmented phonemes, this context represents one aspect of parts of speech. For example, the phoneme-length context captures the tendency that the length of the adposition is usually short and the length of the succeeding segment will be relatively long. We expect the phonemelength context to be another cue for segmentation because the phoneme-length context is more abstract than word-level context. This phonemelength model is expected to capture a rhythmic aspect of language.",
"cite_spans": [
{
"start": 277,
"end": 298,
"text": "(Lee and Glass, 2012)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [
{
"start": 301,
"end": 309,
"text": "Figure 2",
"ref_id": null
},
{
"start": 481,
"end": 487,
"text": "Fig. 2",
"ref_id": null
},
{
"start": 786,
"end": 792,
"text": "Fig. 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Motivation",
"sec_num": "1.1"
},
{
"text": "We model the phoneme-length context as a prior probability distribution of sequential segmentation labels. This is because the probability distribution is expected to control how long each segmented phoneme becomes. Since the joint prior probability distribution of sequential segmentation labels were decomposed into factorized probabilities like N -gram, the phoneme-length model follows the Markov process and has a transition probability. The transition probability is also modeled and smoothed by using the Pitman-Yor N -gram model as other language models did. Our method, using NPYLM and PYHSMM, is evaluated by using a conversational corpus in English and Japanese in terms of the F-measures of the estimated segmentation labels. Because the corpus contains fillers and hesitations, the property of utterance used for evaluation matches our research purpose.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Motivation",
"sec_num": "1.1"
},
{
"text": "There are several approaches based on Bayesian nonparametrics to achieve lexical acquisition from raw audio signals (Neubig et al., 2010; Lee and Glass, 2012; Kamper et al., 2016; Taniguchi et al., 2016) , unsegmented phonemes, or words (Mochihashi et al., 2009; Goldwater et al., 2009; Elsner et al., 2013; Uchiumi et al., 2015) . The lexical acquisition technique is necessary in other areas, such as dialogue system that acquires knowledge through dialogue (Ono et al., 2016) . The advantages of Bayesian approach compared with other approaches (Kuo et al., 2007; R\u00e4s\u00e4nen et al., 2015) are that a) the number of words in the system's vocabulary can be increased automatically in accordance with the amount of data and b) the semi-supervised learning of segmentation labels is easy to apply to utilize our knowledge of language. A typical estimation procedure is a Gibbs-sampling-based iteration of 1) the estimation of borders (segmentation labels) given a temporal N -gram language model (Goodman, 2001) and 2) the estimation of an Ngram language model given the temporal segmentation labels.",
"cite_spans": [
{
"start": 116,
"end": 137,
"text": "(Neubig et al., 2010;",
"ref_id": "BIBREF14"
},
{
"start": 138,
"end": 158,
"text": "Lee and Glass, 2012;",
"ref_id": "BIBREF9"
},
{
"start": 159,
"end": 179,
"text": "Kamper et al., 2016;",
"ref_id": "BIBREF7"
},
{
"start": 180,
"end": 203,
"text": "Taniguchi et al., 2016)",
"ref_id": "BIBREF20"
},
{
"start": 237,
"end": 262,
"text": "(Mochihashi et al., 2009;",
"ref_id": "BIBREF11"
},
{
"start": 263,
"end": 263,
"text": "",
"ref_id": null
},
{
"start": 264,
"end": 287,
"text": "Goldwater et al., 2009;",
"ref_id": "BIBREF4"
},
{
"start": 288,
"end": 308,
"text": "Elsner et al., 2013;",
"ref_id": "BIBREF1"
},
{
"start": 309,
"end": 330,
"text": "Uchiumi et al., 2015)",
"ref_id": "BIBREF22"
},
{
"start": 461,
"end": 479,
"text": "(Ono et al., 2016)",
"ref_id": "BIBREF15"
},
{
"start": 549,
"end": 567,
"text": "(Kuo et al., 2007;",
"ref_id": "BIBREF8"
},
{
"start": 568,
"end": 589,
"text": "R\u00e4s\u00e4nen et al., 2015)",
"ref_id": "BIBREF16"
},
{
"start": 993,
"end": 1008,
"text": "(Goodman, 2001)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "1.2"
},
{
"text": "We explain the overview and segmentation algorithm of NPYLM and PYHSMM as baseline methods. PYHSMM is an extended model of NPYLM to estimate the part-of-speech tagging of segmented words at the same time.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Segmentation and Baselines",
"sec_num": "2"
},
{
"text": "The unsupervised segmentation problem is defined finding the latent segmentation labels z = [z 1 , ..., z Lc ] T that correspond to each phoneme in the phoneme sequence c = [c 1 , ..., c Lc ] T with length L c . If the binary label z i = 1, the phoneme sequence is separated after the phoneme c i . ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "arg max z p(z|c) \u221d p(c|z) or (1) arg max z,m p(z, m|c) \u221d p(c|z, m)p(m),",
"eq_num": "(2)"
}
],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "where NPYLM uses Eq. (1) and PYHSMM uses Eq. 2. The definition of each likelihood, such as p(c|z) and p(c|z, m), is important. Because the border of phonemes z is given in these models, the likelihood can be factorized like N -gram probability. For example, the likelihood can be factorized as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "p(c i+1 , ..., c N |c 1 , ..., c i , z)p(c 1 , ..., c i |z)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": ", where the phoneme segments are considered to be two word segments w 1 = c 1 ...c i and",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "w 2 = c i+1 ...c Lc .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "This N -gram modeling is also adopted to decompose the part-of-speech label m, and this controls the grammar and the number of words. The nested hierarchical Pitman-Yor language model (NPYLM) is used to represent the factorized N -gram probability (Mochihashi et al., 2009) . Here, we represent the context of N -gram as h and the depth of the hierarchical context tree of h as | h|. Given the seating arrangement of customers that are represented by hidden variables s in the hierarchical Chinese restaurant process (CRP), the conditional probability of a word segment w with the context h is defined as follows:",
"cite_spans": [
{
"start": 248,
"end": 273,
"text": "(Mochihashi et al., 2009)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "p(w| s, h) = c hw \u2212 d | h| t hw c h * + \u03b8 | h| + \u03b8 h + d | h| t h * c h * + \u03b8 | h| p(w| s, h ),",
"eq_num": "(3)"
}
],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "where c hw is the count of word w at context h, and c h * = w c hw is its sum. h is the reduced context of h, in which the ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "relationship | h | = | h| \u2212 1 exists. t",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "w = c i ...c j ) is smoothed by the phoneme-level N -gram probabil- ity p(c i , ..., c j ) = p(c j |c i , ..., c j\u22121 )p(c i , ..., c j\u22121 ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "Please see the work of Teh (2006) for the sampling algorithm of seating arrangement. The segmentation labels z and other parameters such as the N -gram language model are updated iteratively. If the segmentation labels are given, we can calculate the statistics of the N -gram model. If the N -gram model is given, we can estimate the probability of the segmentation labels. Because the update of the N -gram model is well known, we explain the update of the estimation of the segmentation labels in the latter parts of this section.",
"cite_spans": [
{
"start": 23,
"end": 33,
"text": "Teh (2006)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "Algorithm 1 Backward sampling: \u0398 represents parameter set",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "Require: t \u2190 N, i \u2190 0, w0 \u2190 E while t > 0 do Draw k \u221d p(wi|c t t\u2212k+1 , \u0398)\u03b1[t][k] Set wi \u2190 c t t\u2212k+1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "Set t \u2190 t \u2212 k, i \u2190 i + 1 end while 2.2 Inference for NPYLM Mochihashi et al. (2009) proposed introducing the forward-backward inference to estimate the segmentation labels efficiently. This method uses a semi-Markov model, and it considers the problem as a sequential estimation of the hidden labels. The procedure consists of two steps: forward filtering and backward sampling.",
"cite_spans": [
{
"start": 59,
"end": 83,
"text": "Mochihashi et al. (2009)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "The forward filtering calculates the forward probability that is used for the Bayesian learning of the hidden Markov model (HMM) (Scott, 2002) . The following equation denotes \u03b1[t][k] as the probability of generating the partial phonemes c 1 , ..., c t of c using the last k phonemes in the case of bi-grams.",
"cite_spans": [
{
"start": 129,
"end": 142,
"text": "(Scott, 2002)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "\u03b1[t][k] = t\u2212k j=1 p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 )\u03b1[t \u2212 k][j],",
"eq_num": "(4)"
}
],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "where \u03b1[0][0] = 1 and c n , ..., c m = c m n . Backward sampling is achieved by drawing a phoneme segment w from the end of a sentence by using forward probability \u03b1[t] [k] . Because the end of sentence is represented by the special symbol E, we can start sampling a word with the probability proportional to p(E|c N N \u2212k ). The algorithm is summarized in Alg. 1.",
"cite_spans": [
{
"start": 169,
"end": 172,
"text": "[k]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "Note that we do not use the correction of phoneme-level N -gram probability based on the phoneme length using the Poisson distribution in the NPYLM. This is because the length property is embedded into our model naturally.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "2.1"
},
{
"text": "The PYHSMM, which is an extended model of NPYLM, estimates the parts of speech of each segmented phoneme. We expect that the performance of PYHSMM is better than that of NPYLM. The forward probability,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference for PYHSMM",
"sec_num": "2.3"
},
{
"text": "\u03b1[t][k][m]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference for PYHSMM",
"sec_num": "2.3"
},
{
"text": ", is newly introduced in the case of bi-grams, and the following equation denotes it as the probability of generating the partial phonemes c 1 , ..., c t with part-of-speech m from the last k phonemes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference for PYHSMM",
"sec_num": "2.3"
},
{
"text": "\u03b1[t][k][m] = t\u2212k j=1 M r=0 p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 , m) p(m|r)\u03b1[t \u2212 k][j][r] (5)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference for PYHSMM",
"sec_num": "2.3"
},
{
"text": "where p(m|r) is the transition probability of the latent parts of speech and assumed the hierarchical Pitman-Yor language model. The algorithm of the backward sampling is similar to that of NPYLM. The parts of speech are sampled as well as the segmentation label. Because the end of the sentence and its parts of speech are represented using the special symbol E, we can start sampling a word with the probability proportional to p(E|c N N \u2212k , E)p(E|m) like NPYLM. Note that the computational cost of PYHSMM is larger than that of NPYLM due to the search part-of-speech labels.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference for PYHSMM",
"sec_num": "2.3"
},
{
"text": "We focus on the distribution of phoneme length to distinguish the confused contexts. If we have two different words with the same pronunciation, we can sometimes distinguish the phoneme representations of them on the basis of the lenght of the preceding or succeeding phoneme segments. The phoneme-length context will capture the tendency that the length of the adposition is usually short and the length of the succeeding segment will be relatively long. Figure 4 illustrates the real phoneme-length distribution in the English and Japanese spokendialogue transcriptions used in our evaluation (Sec. 5.2). Given that the function len(w) returns the phoneme length of word w, the matrices represent the bi-gram length probability p(len(w n )|len(w n\u22121 )), and the horizontal axis is len(w n\u22121 ) and the vertical axis is len(w n ). w n represents the n-th word in each sentences. The line graphs represent the uni-gram length probability p(len(w n )). These probabilities were calculated on the basis of maximum likelihood estimation. Verb and Noun represent the phoneme-length probability of verbs and nouns in Japanese data, respectively. The definitions of bi-gram and uni-gram probability for Verb and Noun are p(len(w n )|len(w n\u22121 ), pos(w n )) and p(len(w n |pos(w n )), where pos(w) is a function that returns a part-of-speech tag of the word w.",
"cite_spans": [],
"ref_spans": [
{
"start": 456,
"end": 464,
"text": "Figure 4",
"ref_id": "FIGREF4"
}
],
"eq_spans": [],
"section": "Analysis and Our Approach",
"sec_num": "3"
},
{
"text": "We determined that the phoneme-length probability depends on 1) language, 2) context, and 3) parts of speech. The bi-gram phoneme-length probabilities in English are relatively similar to each other but different from those in Japanese. Some bi-gram probabilities have several peaks, and they vary in accordance with parts of speech. If we utilize this information, we will achieve an accurate segmentation. The straightforward approach to exploit phoneme-length information is to utilize the prior distribution of the segmentation labels z that is not used in either NPYLM and PYSHMM. Because the prior probability is considered to be the source that determines the length of each phoneme segment, embedding this prior into a model is expected to improve the segmentation performance. Therefore, we need to construct a model that considers the prior of the segmentation labels and should also reveal the performance of these models for phoneme-level word segmentation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Analysis and Our Approach",
"sec_num": "3"
},
{
"text": "Pitman-Yor Semi-Markov Models",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Phoneme-Length Context Model for",
"sec_num": "4"
},
{
"text": "We extend the NPYLM and PYHSMM to exploit the phoneme-length patterns of each phoneme segment. First, we explain our problem statement for unsupervised segmentation of phoneme sequences. Next, we derive the context model of the phoneme length and show the forwardbackward algorithms for our extended NPYLM and PYHSMM.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Phoneme-Length Context Model for",
"sec_num": "4"
},
{
"text": "We exploit the probability of phoneme length in estimating latent segmentation labels z and latent part-of-speech labels m. The parameters are estimated by maximizing the following probabilities:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "arg max z p(z|c) \u221d p(c|z)p(z) or (6) arg max z,m p(z, m|c) \u221d p(c|z, m)p(z|m)p(m). (7)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "The former objective function is for NPYLM, and the latter is for PYHSMM. The probabilities of segmentation labels p(z) in Eq. (6) and p(z|m) in Eq. 7are used in our objective functions. p(z) is a prior probability distribution of segmentation labels z in Eq. (6). We decompose each joint probability into Ngram probabilities. For an easy explanation of this decomposition, here we use the length of partof-speech labels L m and the correct segmentation labels as if these are given, which are actually searched for during training. The non-zero indices of segmentation labels z are represented by g = [g 1 , ..., g W ], where W is the number of \"true\" phoneme segments. W equals L m in the case of part-of-speech estimation. We also define g i = g i + 1. The factorized models in the case of bi-grams for NPYLM and PYHSMM are represented as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "p(c|z) = i p(c g i g i\u22121 |c g i\u22121 g i\u22122 , z g i g i\u22121 , z g i\u22121 g i\u22122 ),",
"eq_num": "(8)"
}
],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "p(z) = i p(z g i g i\u22121 |z g i\u22121 g i\u22122 ),",
"eq_num": "(9)"
}
],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "p(c|z, m)= i p(c g i g i\u22121 |c g i\u22121 g i\u22122 , z g i g i\u22121",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": ", z",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "g i\u22121 g i\u22122 , m i ),(10) p(z|m) = i p(z g i g i\u22121 |z g i\u22121 g i\u22122 , m i ),",
"eq_num": "(11)"
}
],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "p(m) = i p(m i |m i\u22121 ),",
"eq_num": "(12)"
}
],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "where p(m i |m i\u22121 ) is a transition probability of latent part-of-speech labels, z",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "g i g i\u22121 = z g i\u22121 +1 , ..., z g i and p(z g i g i\u22121 |z g i\u22121 g i\u22122",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": ") and p(z",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "g i g i\u22121 |z g i\u22121 g i\u22122",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": ", m i ) are transition probabilities of the segmentation labels. The transition probability of segmentation labels is derived naturally. The latent variables for the seating arrangement of N -gram probability in Eq. 3are omitted in these equations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "We design the transition probability of segmentation labels, such as p(z",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "g i g i\u22121 |z g i\u22121 g i\u22122",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "), to depend on the length of each phoneme segment. Because the length of each segment can be represented using the non-zero indices g, the bi-gram transition probability is rewritten as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "p(z g i g i\u22121 |z g i\u22121 g i\u22122 ) = p(g i \u2212 g i\u22121 |g i\u22121 \u2212 g i\u22122 ) (13)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "where m g i is omitted in the case of PYHSMM, and each integer, such as g i \u2212 g i\u22121 , is considered as a symbol or label. This transition probability is the phoneme-length bi-gram probability as mentioned in Sec. 3, and it is also modeled by the hierarchical Pitman-Yor language model (HPYLM) not by a Poisson distribution (Mochihashi et al., 2009) because HPYLM is a count-based representation, which is appropriate for multimodal distribution. Such probability for duration modeling is also seen in (Kuo et al., 2007) .",
"cite_spans": [
{
"start": 323,
"end": 348,
"text": "(Mochihashi et al., 2009)",
"ref_id": "BIBREF11"
},
{
"start": 501,
"end": 519,
"text": "(Kuo et al., 2007)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Model",
"sec_num": "4.1"
},
{
"text": "We derived the forward-backward algorithms to estimate the segmentation labels and part-ofspeech labels. The inference for NPYLM is introduced first; then, the inference of PYHSMM is explained. Note that the segmentation label z and part-of-speech labels m are estimated simultaneously.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference",
"sec_num": "4.2"
},
{
"text": "The forward probability \u03b1[t][k] of NPYLM with phoneme-length context is modified as follows.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference",
"sec_num": "4.2"
},
{
"text": "\u03b1[t][k] = t\u2212k j=1 p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 , k, j) p(k|j)\u03b1[t \u2212 k][j] (14)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference",
"sec_num": "4.2"
},
{
"text": "where p(k|j) is a transition probability of the length of each phoneme segment. The forward probability is modified by the bi-gram probability of lengths. We can use p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 , k) instead of p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 , k, j) because information of length j is included in the phoneme sequence representation, c t\u2212k t\u2212k\u2212j+1 . As with NPYLM, the context of phoneme lengths can be embedded into PYHSMM. The forward probability is also represented as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference",
"sec_num": "4.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "\u03b1[t][k][m] = t\u2212k j=1 M r=0 p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 , k, j, m) p(k|j, m)p(m|r)\u03b1[t \u2212 k][j][r]",
"eq_num": "(15)"
}
],
"section": "Inference",
"sec_num": "4.2"
},
{
"text": "where m represents a part of speech. The forward probability is also biased by a transition probability of the length of each phoneme segment p(k|j, m). We can also use p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 , k, m). Because the number of parameters is large in this case of latent parts of speech, the convergence speed will degrade compared with NPYLM. Backward sampling of both cases is achieved in the same way as in NPYLM. The details are omitted due to space limitation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference",
"sec_num": "4.2"
},
{
"text": "We substitute the conditional probability into simpler one by ignoring the dependency on length k in this work as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Substitution",
"sec_num": "4.3"
},
{
"text": "p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 , k):=p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 ).(16)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Substitution",
"sec_num": "4.3"
},
{
"text": "The probability should be ideally normalized only on the tokens that have length k, and this substitution makes a double count of the length information of token c t t\u2212k+1 . On the other hand, the difference between NPYLM and our proposed model in the inference is clear. The transition probability p(k|j) is added in our model, and its implementation becomes simple. Our strict model will be evaluated in the future work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Substitution",
"sec_num": "4.3"
},
{
"text": "We also use p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 , m) instead of p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 , k, m). Note that there are several options on the back-off structure of the conditional probability p(c t t\u2212k+1 |c t\u2212k t\u2212k\u2212j+1 , k). For example, the word uni-gram p(c t t\u2212k+1 |k) might be smoothed by un-conditioned word uni-gram or by the kconditioned character N -gram. If the amount of data is limited, the parameter estimation of the conditional character N -gram may fail. We adopt the existing model, NPYLM, as the structure in this work. The optimal structure should also be investigated in the future work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Substitution",
"sec_num": "4.3"
},
{
"text": "We evaluated each model by comparing the estimated segmented labels with the correct segmented original phoneme text (transcription of speech corpus). Utterances in the corpus were divided manually, and each utterance was treated as one sentence. The unsegmented phoneme text is generated by replacing the word-segmented transcription text into phoneme text with a dictionary and by removing whitespaces.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Procedure",
"sec_num": "5.1"
},
{
"text": "The criteria for the evaluations were the Fmeasures of the estimated lexicon set and segmentation label set. These F-measures are the harmonic mean of recall and precision; therefore, we could consider the recall and precision at the same time. The lexicon set after unsupervised segmentation was compared with that of the original segmented phoneme text. The estimated set of segmentation labels was also compared with that of the original phoneme text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Procedure",
"sec_num": "5.1"
},
{
"text": "We used a development set to monitor the maximum performance of segmentation methods. The 1% data set was randomly selected from each test set, and its F-measure of segmentation labels was used to determine the epochs for calculating F-measures. Since we can obtain some correctly-transcribed text in a real situation, this evaluation process is reasonable. First, we ran each method over a sufficient number of epochs. Next, we calculated the F-measure of each development set's segmentation label and identified the 20-epoch section where the averaged F-measure was the highest. We calculated the F-measures of test sets that averaged over 20 epochs corresponding to the identified 20-epoch section. Note that each method is based on sampling and the max- imum likelihood estimation sometimes does not match the segmentation on the basis of linguistic definitions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Procedure",
"sec_num": "5.1"
},
{
"text": "We used two types of speech transcription in English and Japanese for evaluation. This is because the distribution of phoneme length also differs in languages as mentioned in Sec. 3. We used the Switchboard-1 Telephone Speech Corpus (Godfrey et al., 1992) for the English set, which includes the transcription of conversational dialogue speech 1 . We selected 5,239 sentences from the session \"ID 20,\" which included 88,127 word segments with 6,203 unique words. These words were converted into phonemes, totaling 276,329 phoneme characters. The vocabulary size in terms of phoneme representation was 5,422, and this was a unique number of phoneme sequences of words. For example, because the pronunciation of the words \"see\" and \"sea\" is the same \"si:\", the phoneme sequence \"si:\" is considered to be a unique vocabulary item. The phoneme set used in the English corpus included 43 phonemes in total including end-of-sentence symbols. The properties of the corpus are summarized in Table 1 .",
"cite_spans": [
{
"start": 233,
"end": 255,
"text": "(Godfrey et al., 1992)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [
{
"start": 983,
"end": 990,
"text": "Table 1",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "Data",
"sec_num": "5.2"
},
{
"text": "We used the Corpus of Spontaneous Japanese (CSJ) for the Japanese set, which is a collection of spoken dialogue recordings and their transcriptions (Maekawa, 2003) . We used 17,493 sentences, including 132,900 word segments with 8,325 of them being unique words. The phoneme set for Japanese includes the combination of consonants and vowels and almost completely corresponds to \"katakana\" in Japanese to remove redundancy. The words were also transformed into phonemes (\"katakana\"), resulting in 264,544 of them. The vocabulary size in terms of phoneme representation was 6,589, and this was the unique number of phoneme sequences of words. The phoneme set used in the Japanese corpus included 79 phonemes in total including end-of-sentence symbols. The properties of the corpus are also summarized in Table 1 .",
"cite_spans": [
{
"start": 148,
"end": 163,
"text": "(Maekawa, 2003)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [
{
"start": 803,
"end": 810,
"text": "Table 1",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "Data",
"sec_num": "5.2"
},
{
"text": "The parameters of NPYLM were the same for all models. The hyper parameters of the word language model were initialized as \u03b8 |h| = 2.0, d |h| = 0.5, and the other parameters of prior probability distribution were all set to 1.0, such as the parameters of the beta distribution in NPYLM.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameter Settings",
"sec_num": "5.3"
},
{
"text": "The hyper parameters of the phoneme (character) language, part-of-speech model and length model were the same as those in the language model. We set the maximum length of the phoneme sequence L c to 10 due to the computational complexity. The number of classes of part of speech label, M , was set to 4 due to the small corpus size and computational cost. The initial labels of parts of speech were initialized randomly within the number of classes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameter Settings",
"sec_num": "5.3"
},
{
"text": "The maximum F-measures of the lexicon and segmentation are listed in Tables 2 and 3 for the English and Japanese test sets. The notations Lex. and Seg. represent the F-measures of the lexicon and segmentation, respectively. NPYLM-D denotes the proposed NPYLM with our phonemelength context model in Table 2 , and PYHSMM-D denotes the proposed PYHSMM with our context model in Table 3 .",
"cite_spans": [],
"ref_spans": [
{
"start": 69,
"end": 83,
"text": "Tables 2 and 3",
"ref_id": "TABREF3"
},
{
"start": 299,
"end": 306,
"text": "Table 2",
"ref_id": "TABREF3"
},
{
"start": 376,
"end": 383,
"text": "Table 3",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "5.4"
},
{
"text": "The F-measures of the proposed NPYLM-D outperformed the NPYLM for both the English and Japanese test sets as shown in Table 2 . The improvements in the Japanese corpus, 0.067 (Lex.) and 0.045 (Seg.), were larger than those in the English corpus, 0.003 (Lex.) and 0.01 (Seg.). This is because the bi-gram probability of phoneme length varies more in Japanese than in English, and the NPYLM-D could capture such tendencies. The NPYLM does not use any information other than the context of a segmented phoneme sequence. Therefore, the length model is useful to model the phoneme-level features. The lower performance of NPYLM-D after convergence might be caused by the conditional probability substitution and its double-count of length information.",
"cite_spans": [],
"ref_spans": [
{
"start": 118,
"end": 125,
"text": "Table 2",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "5.4"
},
{
"text": "The F-measures of the proposed PYHSMM-D were worse than those of PYHSMM for both the English and Japanese test sets as shown in Table 3. The performances of these methods were worse than those of NPYLM and NPYLM-D. The reasons for this are due to 1) the smaller amount of data to treat latent context variable m and 2) the overlap of contextual information between the phoneme length and the latent variable m. Since the latent variable m represents the class of context, a sufficient amount of data will be required for achieving stable performance compared with NPYLM. Moreover, the context information represented by the latent variable m possibly includes our phoneme length context. Thus, it might be difficult for the PYHSMM-D to separate these two contexts in the case of completely unsupervised training. These problems may be solved in the semi-supervised case where we exploit prelabeled data with already segmented words and their tagged parts of speech. The F-measures of segmentation during training for the English and Japanese test sets are shown in Figures 5 and 6 , respectively. The horizontal axis represents the epoch of Gibbs sampling, and the vertical axis represents the F-measures for the segmentation label set. The Gibbs sampling was stopped after at least ten days. Note that the Fmeasure of segmentation does not necessarily correlate with the likelihood and all methods were based on stochastic segmentation.",
"cite_spans": [],
"ref_spans": [
{
"start": 1065,
"end": 1080,
"text": "Figures 5 and 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "5.4"
},
{
"text": "The F-measures of NPYLM and PYHSMM for the English and Japanese corpora improved in proportion to the number of epochs, and those of PYHSMM and PYHSMM-D did not converge as shown in Figures 5 and 6 . Because the number of hidden parameters of PYHSMM and PYHSMM-D was large, their convergence speeds were slow. The proposed NPYLM-D had peak F-measures at 100-200 epochs, and they went down and converged as the number of epochs increased. This was mainly because the phoneme-length context model accelerated the segmentation in the early epochs, and the small number of observations and un-supervised condition caused over-fitting. Therefore, the performance of the NPYLM-D is expected to be improved by using a larger corpus or by optimizing hyper parameters to match the actual prior probability of phoneme length.",
"cite_spans": [],
"ref_spans": [
{
"start": 182,
"end": 197,
"text": "Figures 5 and 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "5.4"
},
{
"text": "The semi-supervised training would be effective for segmentation in practical use because it matches the actual use case. Evaluating the performance under such a condition is planned for future work. We expect the PYHSMM-D to work well more after 1000 epochs, but it requires a large computational cost. Its results could also be improved with a larger corpus and semi-supervised condition.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "5.4"
},
{
"text": "Unsupervised segmentation of phoneme sequences is an essential process to obtain unknown words during spoken dialogues with users. The PYSMM is a promising model to achieve unsupervised segmentation, but its performance degrades when it is applied to phoneme-level word segmentation. We proposed a phoneme-length context model for PYSMM to give a helpful cue at the phoneme-level and to predict succeeding phoneme segmentation more accurately. Our experiments showed that the peak performances with our context model outperformed those without such a context model by 0.045 at most in terms of Fmeasures of estimated segmentation labels.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "6"
},
{
"text": "There are the several future works on 1) optimization of parameters, 2) evaluation of semisupervised training and other languages, and 3) improvement of our model and inference method. To further improve our method, we must investigate the hyper parameters setting for the estimation of segmentation labels to operate efficiently. The semi-supervised training will also improve the performance of our method. We will evaluate our method not only for English and Japanese but also other languages, such as African languages because the rhythmic information might be vivid. The performance of our strict model and the optimal back-off structure should be investigated to reveal the limitation of our model. The modification of inference algorithm will be required due to the computational efficiency when we use longer context information more than tri-gram. Since the rhythm information of latent segmentation might not be captured well by bi-grams, the challenge of using longer context is one of the important issues for our purpose.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "6"
},
{
"text": "http://www.isip.msstate.edu/projects/switchboard/releases/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We thank anonymous reviewers for their insightful comments. This work was supported partly by JSPS KAKENHI Grant Number JP16H02869.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Context-dependent pre-trained deep neural networks for large-vocabulary speech recognition",
"authors": [
{
"first": "E",
"middle": [],
"last": "George",
"suffix": ""
},
{
"first": "Dong",
"middle": [],
"last": "Dahl",
"suffix": ""
},
{
"first": "Li",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Alex",
"middle": [],
"last": "Deng",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Acero",
"suffix": ""
}
],
"year": 2012,
"venue": "IEEE Transactions on Audio, Speech, and Language Processing",
"volume": "20",
"issue": "1",
"pages": "30--42",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "George E Dahl, Dong Yu, Li Deng, and Alex Acero. 2012. Context-dependent pre-trained deep neural networks for large-vocabulary speech recognition. IEEE Transactions on Audio, Speech, and Language Processing, 20(1):30-42.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "A joint learning model of word segmentation, lexical acquisition, and phonetic variability",
"authors": [
{
"first": "Micha",
"middle": [],
"last": "Elsner",
"suffix": ""
},
{
"first": "Sharon",
"middle": [],
"last": "Goldwater",
"suffix": ""
},
{
"first": "Naomi",
"middle": [],
"last": "Feldman",
"suffix": ""
},
{
"first": "Frank",
"middle": [],
"last": "Wood",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the Conference on Empirical Methods on Natural Language Processing",
"volume": "",
"issue": "",
"pages": "42--54",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Micha Elsner, Sharon Goldwater, Naomi Feldman, and Frank Wood. 2013. A joint learning model of word segmentation, lexical acquisition, and phonetic vari- ability. In Proceedings of the Conference on Em- pirical Methods on Natural Language Processing, pages 42-54.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Switchboard: Telephone speech corpus for research and development",
"authors": [
{
"first": "J",
"middle": [],
"last": "John",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Godfrey",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Edward",
"suffix": ""
},
{
"first": "Jane",
"middle": [],
"last": "Holliman",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mc-Daniel",
"suffix": ""
}
],
"year": 1992,
"venue": "Proceesings of IEEE International Conference on Acoustics, Speech, and Signal Processing",
"volume": "1",
"issue": "",
"pages": "517--520",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "John J Godfrey, Edward C Holliman, and Jane Mc- Daniel. 1992. Switchboard: Telephone speech cor- pus for research and development. In Proceesings of IEEE International Conference on Acoustics, Speech, and Signal Processing, volume 1, pages 517-520.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Contextual dependencies in unsupervised word segmentation",
"authors": [
{
"first": "Sharon",
"middle": [],
"last": "Goldwater",
"suffix": ""
},
{
"first": "L",
"middle": [],
"last": "Thomas",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Griffiths",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Johnson",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "673--680",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sharon Goldwater, Thomas L Griffiths, and Mark John- son. 2006. Contextual dependencies in unsuper- vised word segmentation. In Proceedings of the 21st International Conference on Computational Lin- guistics and the 44th annual meeting of the Associa- tion for Computational Linguistics, pages 673-680.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "A bayesian framework for word segmentation: Exploring the effects of context",
"authors": [
{
"first": "Sharon",
"middle": [],
"last": "Goldwater",
"suffix": ""
},
{
"first": "L",
"middle": [],
"last": "Thomas",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Griffiths",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Johnson",
"suffix": ""
}
],
"year": 2009,
"venue": "Cognition",
"volume": "112",
"issue": "1",
"pages": "21--54",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sharon Goldwater, Thomas L Griffiths, and Mark John- son. 2009. A bayesian framework for word segmen- tation: Exploring the effects of context. Cognition, 112(1):21-54.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A bit of progress in language modeling",
"authors": [
{
"first": "Joshua",
"middle": [
"T"
],
"last": "Goodman",
"suffix": ""
}
],
"year": 2001,
"venue": "Computer Speech & Language",
"volume": "15",
"issue": "4",
"pages": "403--434",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joshua T. Goodman. 2001. A bit of progress in lan- guage modeling. Computer Speech & Language, 15(4):403-434.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups",
"authors": [
{
"first": "Geoffrey",
"middle": [],
"last": "Hinton",
"suffix": ""
},
{
"first": "Li",
"middle": [],
"last": "Deng",
"suffix": ""
},
{
"first": "Dong",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "George",
"middle": [
"E"
],
"last": "Dahl",
"suffix": ""
},
{
"first": "Abdel-Rahman",
"middle": [],
"last": "Mohamed",
"suffix": ""
},
{
"first": "Navdeep",
"middle": [],
"last": "Jaitly",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Senior",
"suffix": ""
},
{
"first": "Vincent",
"middle": [],
"last": "Vanhoucke",
"suffix": ""
},
{
"first": "Patrick",
"middle": [],
"last": "Nguyen",
"suffix": ""
},
{
"first": "Tara",
"middle": [
"N"
],
"last": "Sainath",
"suffix": ""
}
],
"year": 2012,
"venue": "Signal Processing Magazine",
"volume": "29",
"issue": "6",
"pages": "82--97",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Geoffrey Hinton, Li Deng, Dong Yu, George E Dahl, Abdel-rahman Mohamed, Navdeep Jaitly, Andrew Senior, Vincent Vanhoucke, Patrick Nguyen, Tara N Sainath, et al. 2012. Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups. Signal Processing Magazine, 29(6):82-97.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Unsupervised word segmentation and lexicon discovery using acoustic word embeddings",
"authors": [
{
"first": "Herman",
"middle": [],
"last": "Kamper",
"suffix": ""
},
{
"first": "Aren",
"middle": [],
"last": "Jansen",
"suffix": ""
},
{
"first": "Sharon",
"middle": [],
"last": "Goldwater",
"suffix": ""
}
],
"year": 2016,
"venue": "IEEE/ACM Trans. on Audio, Speech, and Language Processing",
"volume": "24",
"issue": "4",
"pages": "669--679",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Herman Kamper, Aren Jansen, and Sharon Goldwa- ter. 2016. Unsupervised word segmentation and lexicon discovery using acoustic word embeddings. IEEE/ACM Trans. on Audio, Speech, and Language Processing, 24(4):669-679.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Improved HMM/SVM methods for automatic phoneme segmentation",
"authors": [
{
"first": "Jen-Wei",
"middle": [],
"last": "Kuo",
"suffix": ""
},
{
"first": "Hung-Yi",
"middle": [],
"last": "Lo",
"suffix": ""
},
{
"first": "Hsin-Min",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of Interspeech",
"volume": "",
"issue": "",
"pages": "2057--2060",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jen-Wei Kuo, Hung-Yi Lo, and Hsin-Min Wang. 2007. Improved HMM/SVM methods for automatic phoneme segmentation. In Proceedings of Inter- speech, pages 2057-2060.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "A nonparametric bayesian approach to acoustic model discovery",
"authors": [
{
"first": "Chia-Ying",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "Glass",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers",
"volume": "1",
"issue": "",
"pages": "40--49",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chia-ying Lee and James Glass. 2012. A nonpara- metric bayesian approach to acoustic model discov- ery. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers-Volume 1, pages 40-49. Association for Computational Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Corpus of spontaneous Japanese: Its design and evaluation",
"authors": [
{
"first": "Kikuo",
"middle": [],
"last": "Maekawa",
"suffix": ""
}
],
"year": 2003,
"venue": "Inproceedings of the ISCA & IEEE Workshop on Spontaneous Speech Processing and Recognition",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kikuo Maekawa. 2003. Corpus of spontaneous Japanese: Its design and evaluation. In Inproceed- ings of the ISCA & IEEE Workshop on Spontaneous Speech Processing and Recognition.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Bayesian unsupervised word segmentation with nested Pitman-Yor language modeling",
"authors": [
{
"first": "Daichi",
"middle": [],
"last": "Mochihashi",
"suffix": ""
},
{
"first": "Takeshi",
"middle": [],
"last": "Yamada",
"suffix": ""
},
{
"first": "Naonori",
"middle": [],
"last": "Ueda",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the Joint Conference of the 47th",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daichi Mochihashi, Takeshi Yamada, and Naonori Ueda. 2009. Bayesian unsupervised word segmen- tation with nested Pitman-Yor language modeling. In Proceedings of the Joint Conference of the 47th",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP",
"authors": [],
"year": null,
"venue": "",
"volume": "1",
"issue": "",
"pages": "100--108",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1-Volume 1, pages 100-108.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Hidden semi-Markov models",
"authors": [
{
"first": "P",
"middle": [],
"last": "Kevin",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Murphy",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kevin P Murphy. 2002. Hidden semi-Markov models.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Learning a language model from continuous speech",
"authors": [
{
"first": "Graham",
"middle": [],
"last": "Neubig",
"suffix": ""
},
{
"first": "Masato",
"middle": [],
"last": "Mimura",
"suffix": ""
},
{
"first": "Shinsuke",
"middle": [],
"last": "Mori",
"suffix": ""
},
{
"first": "Tatsuya",
"middle": [],
"last": "Kawahara",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceesings of Interspeech",
"volume": "",
"issue": "",
"pages": "1053--1056",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Graham Neubig, Masato Mimura, Shinsuke Mori, and Tatsuya Kawahara. 2010. Learning a language model from continuous speech. In Proceesings of Interspeech, pages 1053-1056.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Toward lexical acquisition during dialogues through implicit confirmation for closed-domain chatbots",
"authors": [
{
"first": "Kohei",
"middle": [],
"last": "Ono",
"suffix": ""
},
{
"first": "Ryu",
"middle": [],
"last": "Takeda",
"suffix": ""
},
{
"first": "Eric",
"middle": [],
"last": "Nichols",
"suffix": ""
},
{
"first": "Mikio",
"middle": [],
"last": "Nakano",
"suffix": ""
},
{
"first": "Kazunori",
"middle": [],
"last": "Komatani",
"suffix": ""
}
],
"year": 2016,
"venue": "Second Workshop on Chatbots and Conversational Agent Technologies",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kohei Ono, Ryu Takeda, Eric Nichols, Mikio Nakano, and Kazunori Komatani. 2016. Toward lexical acquisition during dialogues through implicit con- firmation for closed-domain chatbots. In Second Workshop on Chatbots and Conversational Agent Technologies.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Unsupervised word discovery from speech using automatic segmentation into syllable-like units",
"authors": [
{
"first": "Okko",
"middle": [],
"last": "R\u00e4s\u00e4nen",
"suffix": ""
},
{
"first": "Gabriel",
"middle": [],
"last": "Doyle",
"suffix": ""
},
{
"first": "Michael C",
"middle": [],
"last": "Frank",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of Interspeech",
"volume": "",
"issue": "",
"pages": "3204--3208",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Okko R\u00e4s\u00e4nen, Gabriel Doyle, and Michael C Frank. 2015. Unsupervised word discovery from speech using automatic segmentation into syllable-like units. In Proceedings of Interspeech, pages 3204- 3208.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Bayesian methods for hidden markov models: Recursive computing in the 21st century",
"authors": [
{
"first": "L",
"middle": [],
"last": "Steven",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Scott",
"suffix": ""
}
],
"year": 2002,
"venue": "Journal of the American Statistical Association",
"volume": "97",
"issue": "457",
"pages": "337--351",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Steven L Scott. 2002. Bayesian methods for hidden markov models: Recursive computing in the 21st century. Journal of the American Statistical Asso- ciation, 97(457):337-351.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Feature engineering in context-dependent deep neural networks for conversational speech transaction",
"authors": [
{
"first": "Frank",
"middle": [],
"last": "Seide",
"suffix": ""
},
{
"first": "Gang",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Xie",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Dong",
"middle": [],
"last": "Yu",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the IEEE Workshop on Automatic Speech Recognition and Understanding",
"volume": "",
"issue": "",
"pages": "24--29",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Frank Seide, Gang Li, Xie Chen, and Dong Yu. 2011a. Feature engineering in context-dependent deep neu- ral networks for conversational speech transaction. In Proceedings of the IEEE Workshop on Automatic Speech Recognition and Understanding, pages 24- 29.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Conversational speech transcription using context-dependent deep neural network",
"authors": [
{
"first": "Frank",
"middle": [],
"last": "Seide",
"suffix": ""
},
{
"first": "Gang",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Dong",
"middle": [],
"last": "Yu",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of Interspeech",
"volume": "",
"issue": "",
"pages": "437--440",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Frank Seide, Gang Li, and Dong Yu. 2011b. Conversa- tional speech transcription using context-dependent deep neural network. In Proceedings of Interspeech, pages 437-440.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Nonparametric bayesian double articulation analyzer for direct language acquisition from continuous speech signals",
"authors": [
{
"first": "Tadahiro",
"middle": [],
"last": "Taniguchi",
"suffix": ""
},
{
"first": "Shogo",
"middle": [],
"last": "Nagasaka",
"suffix": ""
},
{
"first": "Ryo",
"middle": [],
"last": "Nakashima",
"suffix": ""
}
],
"year": 2016,
"venue": "IEEE Transactions on Cognitive and Developmental Systems",
"volume": "8",
"issue": "3",
"pages": "171--185",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tadahiro Taniguchi, Shogo Nagasaka, and Ryo Nakashima. 2016. Nonparametric bayesian double articulation analyzer for direct language acquisition from continuous speech signals. IEEE Transactions on Cognitive and Developmental Systems, 8(3):171- 185.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "A bayesian interpretation of interpolated kneser-ney",
"authors": [
{
"first": "Yee Whey",
"middle": [],
"last": "Teh",
"suffix": ""
}
],
"year": 2006,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yee Whey Teh. 2006. A bayesian interpretation of in- terpolated kneser-ney. Technical Report TRA2/06, School of Computing, NUS.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Inducing word and part-of-speech with Pitman-Yor hidden semi-Markov models",
"authors": [
{
"first": "Kei",
"middle": [],
"last": "Uchiumi",
"suffix": ""
},
{
"first": "Hiroshi",
"middle": [],
"last": "Tsukahara",
"suffix": ""
},
{
"first": "Daichi",
"middle": [],
"last": "Mochihashi",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing",
"volume": "1",
"issue": "",
"pages": "1774--1782",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kei Uchiumi, Hiroshi Tsukahara, and Daichi Mochi- hashi. 2015. Inducing word and part-of-speech with Pitman-Yor hidden semi-Markov models. In Pro- ceedings of the 53rd Annual Meeting of the Associ- ation for Computational Linguistics and the 7th In- ternational Joint Conference on Natural Language Processing, volume 1, pages 1774-1782.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Our target problem",
"uris": null,
"type_str": "figure",
"num": null
},
"FIGREF2": {
"text": "Word segmentation",
"uris": null,
"type_str": "figure",
"num": null
},
"FIGREF3": {
"text": "Figure 3 illustrates the role of z. Other latent parameters m = [m 1 , ..., m Lm ] with length L m are also introduced to represent part of speech labels for each segmented phoneme sequences if necessary. The number of classes of part of speech label, M , is defined in advance of this study. The latent parameters are estimated by maximizing the follow-ing probabilities:",
"uris": null,
"type_str": "figure",
"num": null
},
"FIGREF4": {
"text": "Real phoneme-length distribution",
"uris": null,
"type_str": "figure",
"num": null
},
"FIGREF5": {
"text": "Figure 5: F-measures of segmentation for English test set",
"uris": null,
"type_str": "figure",
"num": null
},
"TABREF0": {
"html": null,
"text": "These methods estimate the segmentation labels of",
"content": "<table><tr><td colspan=\"3\">\u1f71\u026a \u00e9\u026at (character) Phoneme Phoneme I ate Word length 2 3</td><td>Word Phoneme Length</td><td>I \u1f71\u026a si: h\u00edm [EOS] see him [EOS] 0 2 2 3 0</td></tr><tr><td>yesterday</td><td>j\u00e9st\u025ad\u00e8\u026a</td><td>8</td></tr><tr><td>see</td><td>si:</td><td>2</td></tr><tr><td>sea</td><td>si:</td><td>2</td></tr></table>",
"num": null,
"type_str": "table"
},
"TABREF2": {
"html": null,
"text": "Parameters of experiment",
"content": "<table><tr><td/><td colspan=\"2\">English Japanese</td></tr><tr><td>Target text</td><td>SwitchBoard</td><td>CSJ</td></tr><tr><td># of sentences</td><td>5,239</td><td>17,493</td></tr><tr><td># of segments</td><td>88,127</td><td>132,900</td></tr><tr><td># of phonemes</td><td>276,329</td><td>264,544</td></tr><tr><td>Vocab. size (word)</td><td>6,203</td><td>8,325</td></tr><tr><td>Vocab. size (phoneme)</td><td>5,422</td><td>6,589</td></tr><tr><td>Phoneme set</td><td>43</td><td>79</td></tr></table>",
"num": null,
"type_str": "table"
},
"TABREF3": {
"html": null,
"text": "F-measures of segmentation by NPYLM and NPYLM-D",
"content": "<table><tr><td/><td>NPYLM</td><td>NPYLM-D</td></tr><tr><td/><td>(baseline)</td><td>(proposed)</td></tr><tr><td>English</td><td>Lex. 0.602 Seg. 0.897</td><td>0.605 0.907</td></tr><tr><td>Japanese</td><td>Lex. 0.344 Seg. 0.748</td><td>0.411 0.793</td></tr></table>",
"num": null,
"type_str": "table"
},
"TABREF4": {
"html": null,
"text": "",
"content": "<table><tr><td>:</td><td colspan=\"2\">F-measures of segmentation by</td></tr><tr><td colspan=\"2\">PYHSMM and PYHSMM-D</td><td/></tr><tr><td/><td>PYHSMM</td><td>PYHSMM-D</td></tr><tr><td/><td>(baseline)</td><td>(proposed)</td></tr><tr><td>English</td><td>Lex. 0.528 Seg. 0.825</td><td>0.471 0.788</td></tr><tr><td>Japanese</td><td>Lex. 0.202 Seg. 0.499</td><td>0.158 0.437</td></tr></table>",
"num": null,
"type_str": "table"
}
}
}
} |