File size: 90,289 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 | {
"paper_id": "P01-1003",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:30:05.380092Z"
},
"title": "Improvement of a Whole Sentence Maximum Entropy Language Model Using Grammatical Features",
"authors": [
{
"first": "Fredy",
"middle": [],
"last": "Amaya",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Universidad Polit\u00e9cnica de Valencia",
"location": {}
},
"email": "famaya@dsic.upv.es"
},
{
"first": "Jos\u00e9",
"middle": [
"Miguel"
],
"last": "Bened\u00ed",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Universidad Polit\u00e9cnica de Valencia",
"location": {}
},
"email": "jbenedi\u00a3@dsic.upv.es"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "In this paper, we propose adding long-term grammatical information in a Whole Sentence Maximun Entropy Language Model (WSME) in order to improve the performance of the model. The grammatical information was added to the WSME model as features and were obtained from a Stochastic Context-Free grammar. Finally, experiments using a part of the Penn Treebank corpus were carried out and significant improvements were acheived.",
"pdf_parse": {
"paper_id": "P01-1003",
"_pdf_hash": "",
"abstract": [
{
"text": "In this paper, we propose adding long-term grammatical information in a Whole Sentence Maximun Entropy Language Model (WSME) in order to improve the performance of the model. The grammatical information was added to the WSME model as features and were obtained from a Stochastic Context-Free grammar. Finally, experiments using a part of the Penn Treebank corpus were carried out and significant improvements were acheived.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Language modeling is an important component in computational applications such as speech recognition, automatic translation, optical character recognition, information retrieval etc. (Jelinek, 1997; Borthwick, 1997) . Statistical language models have gained considerable acceptance due to the efficiency demonstrated in the fields in which they have been applied (Bahal et al., 1983; Ratnapharkhi, 1998; Borthwick, 1999) .",
"cite_spans": [
{
"start": 183,
"end": 198,
"text": "(Jelinek, 1997;",
"ref_id": "BIBREF14"
},
{
"start": 199,
"end": 215,
"text": "Borthwick, 1997)",
"ref_id": "BIBREF6"
},
{
"start": 363,
"end": 383,
"text": "(Bahal et al., 1983;",
"ref_id": "BIBREF2"
},
{
"start": 384,
"end": 403,
"text": "Ratnapharkhi, 1998;",
"ref_id": "BIBREF22"
},
{
"start": 404,
"end": 420,
"text": "Borthwick, 1999)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Traditional statistical language models calculate the probability of a sentence \u00a4 using the chain rule:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u00a5 \u00a7 \u00a6 \u00a4 \u00a9 \u00a5 \u00a7 \u00a6 ! ! \" $ # # % & ( ' \u00a5 \u00a7 \u00a6 & )0 1 &\u00a8 ( 1) 2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This work has been partially supported by the Spanish CYCIT under contract (TIC98/0423-C06). i s named the conditional language model. In principle, the determination of the conditional probability in (1) is expensive, because the possible number of word sequences is very great. Traditional conditional language models assume that the probability of the word & does not depend on the entire history, and the history is limited by an equivalence relation",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": ", and (1) is rewritten as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "\u00a5 \u00a7 \u00a6 \u00a4 \u00a9 8 \u00a5 \u00a7 \u00a6 ! ! \" # 8 9 # % & @ ' \u00a5 \u00a7 \u00a6 &) 7 \u00a6 0 &\u00a8",
"eq_num": "(2)"
}
],
"section": "7",
"sec_num": null
},
{
"text": "The most commonly used conditional language model is the n-gram model. In the n-gram model, the history is reduced (by the equivalence relation) to the last",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7",
"sec_num": null
},
{
"text": "words. The power of the n-gram model resides in: its consistence with the training data, its simple formulation, and its easy implementation. However, the n-gram model only uses the information provided by the last",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A C B E D",
"sec_num": null
},
{
"text": "words to predict the next word and so only makes use of local information. In addition, the value of n must be low (H",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A F B G D",
"sec_num": null
},
{
"text": ") because for",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "P I",
"sec_num": null
},
{
"text": "there are problems with the parameter estimation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A R Q E I",
"sec_num": null
},
{
"text": "Hybrid models have been proposed, in an attempt to supplement the local information with long-distance information. They combine different types of models, like n-grams, with longdistance information, generally by means of linear interpolation, as has been shown in (Belle-garda, 1998; Chelba and Jelinek, 2000; Bened\u00ed and S\u00e1nchez, 2000) .",
"cite_spans": [
{
"start": 266,
"end": 285,
"text": "(Belle-garda, 1998;",
"ref_id": null
},
{
"start": 286,
"end": 311,
"text": "Chelba and Jelinek, 2000;",
"ref_id": "BIBREF8"
},
{
"start": 312,
"end": 337,
"text": "Bened\u00ed and S\u00e1nchez, 2000)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A R Q E I",
"sec_num": null
},
{
"text": "A formal framework to include long-distance and local information in the same language model is based on the Maximum Entropy principle (ME). Using the ME principle, we can combine information from a variety of sources into the same language model (Berger et al., 1996; Rosenfeld, 1996) . The goal of the ME principle is that, given a set of features (pieces of desired information contained in the sentence), a set of functions",
"cite_spans": [
{
"start": 247,
"end": 268,
"text": "(Berger et al., 1996;",
"ref_id": "BIBREF5"
},
{
"start": 269,
"end": 285,
"text": "Rosenfeld, 1996)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A R Q E I",
"sec_num": null
},
{
"text": "S ! T ! ! ! S \u00a9 U",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A R Q E I",
"sec_num": null
},
{
"text": "(measuring the contribution of each feature to the model) and a set of constraints 1 , we have to find the probability distribution that satisfies the constraints and minimizes the relative entropy (Divergence of Kullback-Leibler)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A R Q E I",
"sec_num": null
},
{
"text": "V \u00a6 W \u00a5 ) @ ) \u00a5 Y \u1e8c , with respect to the distribution \u00a5 Y X .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A R Q E I",
"sec_num": null
},
{
"text": "The general Maximum Entropy probability distribution relative to a prior distribution \u00a5 X is given by the expression:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A R Q E I",
"sec_num": null
},
{
"text": "\u00a5 \u00a7 \u00a6 \u00a4 ` 8 D a \u00a5 Y X b \u00a6 \u00a4 ` d c f e h g i W p r q \u00a9 s i u t v i x w @ y (3)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A R Q E I",
"sec_num": null
},
{
"text": "where a is the normalization constant and & are parameters to be found. The & represent the contribution of each feature to the distribution.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A R Q E I",
"sec_num": null
},
{
"text": "From 3it is easy to derive the Maximum Entropy conditional language model (Rosenfeld, 1996) : if is the context space and is the vocabulary, then",
"cite_spans": [
{
"start": 74,
"end": 91,
"text": "(Rosenfeld, 1996)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A R Q E I",
"sec_num": null
},
{
"text": "x is the states space, and if",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A R Q E I",
"sec_num": null
},
{
"text": "x then:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "\u00a5 \u00a7 \u00a6 ) D a \u00a6 c f e h g i W p 4 q f s i u t v i x w",
"eq_num": "(4)"
}
],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": "and a \u00a6",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": ":",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "\u00a6 P c f e h d i W p 4 q f s i t i e w W",
"eq_num": "(5)"
}
],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": "where \u00a6",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": "is the normalization constant depending on the context . Although the conditional ME language model is more flexible than n-gram models, there is an important obstacle to its general use: conditional ME language models have a high computational cost (Rosenfeld, 1996) , specially the evaluation of the normalization constant (5).",
"cite_spans": [
{
"start": 250,
"end": 267,
"text": "(Rosenfeld, 1996)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": "1 The constraints usually involve the equality between theoretical expectation and the empirical expectation over the training corpus.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": "Although we can incorporate local information (like n-grams) and some kinds of long-distance information (like triggers) within the conditional ME model, the global information contained in the sentence is poorly encoded in the ME model, as happens with the other conditional models.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": "There is a language model which is able to take advantage of the local information and at the same time allows for the use of the global properties of the sentence: the Whole Sentence Maximum Entropy model (WSME) (Rosenfeld, 1997) . We can include classical information such us n-grams, distance n-grams or triggers and global properties of the sentence, as features into the WSME framework. Besides the fact that the WSME model training procedure is less expensive than the conditional ME model, the most important training step is based on well-developed statistical sampling techniques. In recent works (Chen and Rosenfeld, 1999a) , WSME models have been successfully trained using features of n-grams and distance n-grams.",
"cite_spans": [
{
"start": 213,
"end": 230,
"text": "(Rosenfeld, 1997)",
"ref_id": "BIBREF24"
},
{
"start": 606,
"end": 633,
"text": "(Chen and Rosenfeld, 1999a)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": "In this work, we propose adding information to the WSME model which is provided by the grammatical structure of the sentence. The information is added in the form of features by means of a Stochastic Context-Free Grammar (SCFG). The grammatical information is combined with features of n-grams and triggers.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": "In section 2, we describe the WSME model and the training procedure in order to estimate the parameters of the model. In section 3, we define the grammatical features and the way of obtaining them from the SCFG. Finally, section 4 presents the experiments carried out using a part of the Wall Street Journal in order evalute the behavior of this proposal.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a6 T",
"sec_num": null
},
{
"text": "The whole sentence Maximum Entropy model directly models the probability distribution of the complete sentence 2 . The WSME language model has the form of (3). In order to simplify the notation we write",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Whole Sentence Maximum Entropy Model",
"sec_num": "2"
},
{
"text": "f & 5 g c s i",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Whole Sentence Maximum Entropy Model",
"sec_num": "2"
},
{
"text": ", and define:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Whole Sentence Maximum Entropy Model",
"sec_num": "2"
},
{
"text": "h \u00a6 \u00a4 ` U % & ( ' f t v i x w i y v & (6) so",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Whole Sentence Maximum Entropy Model",
"sec_num": "2"
},
{
"text": "(3) is written as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Whole Sentence Maximum Entropy Model",
"sec_num": "2"
},
{
"text": "\u00a5 \u00a7 \u00a6 \u00a4 ` D a \u00a5 Y X j \u00a6 \u00a4 h \u00a6 \u00a4 \u00a9 (7)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Whole Sentence Maximum Entropy Model",
"sec_num": "2"
},
{
"text": "where \u00a4 is a sentence and the",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Whole Sentence Maximum Entropy Model",
"sec_num": "2"
},
{
"text": "are now the parameters to be learned.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": "The training procedure to estimate the parameters of the model is the Improved Iterative Scaling algorithmn (IIS) (Della Pietra et al., 1995) . IIS is based on the change of the log-likelihood over the training corpus k , when each of the parameters changes from &",
"cite_spans": [
{
"start": 121,
"end": 141,
"text": "Pietra et al., 1995)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": "to & m l F n & , n & F o",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": ". Mathematical considerations on the change in the log-likelihood give the training equation: y",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": "\u00a5 \u00a7 \u00a6 \u00a4 S & \u00a6 \u00a4 \u00a9 d c m p i u t r q w @ y B s t \u00f9 w v \u00a5 \u00a7 \u00a6 \u00a4 S & \u00a6 \u00a4 ` y x (8) where S { z \u00a6 \u00a4 ` e U & ( ' S & \u00a6 \u00a4 `",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": ". In each iteration of the IIS, we have to find the value of the improvement",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": "n & in the parameters, solving (8) with respect to n & for each | } D ! ! m T",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": ". The main obstacle in the WSME training process resides in the calculation of the first sum in (8). The sum extends over all the sentences of a given length. The great number of such sentences makes it impossible, from computing perspective, to calculate the sum, even for a moderate length 3 . Nevertheless, such a sum is the statistical expected value of a function of with respect to the distribution",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": "\u00a5 : S & c p i u t q .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": "As is well known, it could be estimated using the sampling expectation as: (Neal, 1993) . MCMC are based on the convergence of certain Markov Chains to a target distribution \u00a5 . In MCMC, a path of the Markov chain is ran for a long time, after which the visited states are considered as a sampling element. The MCMC sampling methods have been used in the parameter estimation of the WSME language models, specially the Independence Metropolis-Hasting (IMH) and the Gibb's sampling algorithms (Chen and Rosenfeld, 1999a; Rosenfeld, 1997) . The best results have been obtainded using the (IMH) algorithm.",
"cite_spans": [
{
"start": 75,
"end": 87,
"text": "(Neal, 1993)",
"ref_id": "BIBREF18"
},
{
"start": 492,
"end": 519,
"text": "(Chen and Rosenfeld, 1999a;",
"ref_id": "BIBREF9"
},
{
"start": 520,
"end": 536,
"text": "Rosenfeld, 1997)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": "S & c p i t q 9 D ' S & \u00a6 \u00a4 t r q w i y & (9) where \u00a4 5 ! ! r T \u00a4 is a",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": "Although MCMC performs well, the distribution from which the sample is obtained is only an approximation of the target sampling distribution. Therefore samples obtained from such distributions may produce some bias in sample statistics, like sampling mean. Recently, another sampling technique which is also based on Markov Chains has been developed by Propp and Wilson (Propp and Wilson, 1996) , the Perfect Sampling (PS) technique. PS is based on the concept of Coupling From the Past. In PS, several paths of the Markov chain are running from the past (one path in each state of the chain). In all the paths, the transition rule of the Markov chain uses the same set of random numbers to transit from one state to another. Thus if two paths coincide in the same state in time , they will remain in the same states the rest of the time. In such a case, we say that the two paths are collapsed. Now, if all the paths collapse at any given time, from that point in time, we are sure that we are sampling from the true target distribution \u00a5 . The Coupling From the Past algorithm, systematically goes to the past and then runs paths in all states and repeats this procedure until a time has been found. Once has been found, the paths that begin in time B all paths collapse at time x . Then we run a path of the chain from the state at time B $ to the actual time ( x ), and the last state arrived is a sample from the target distribution. The reason for going from past to current time is technical, and is detailed in (Propp and Wilson, 1996) . If the state space is huge (as is the case where the state space is the set of all sentences), we must define a stochastic order over the state space and then run only two paths: one beginning in the minimum state and the other in the maximum state, following the same mechanism described above for the two paths until they collapse. In this way, it is proved that we get a sample from the exact target distribution and not from an approximate distribution as in MCMC algorithms (Propp and Wilson, 1996) . Thus, we hope that in samples generated with perfect sampling, statistical parameter estimators may be less biased than those generated with MCMC.",
"cite_spans": [
{
"start": 353,
"end": 394,
"text": "Propp and Wilson (Propp and Wilson, 1996)",
"ref_id": "BIBREF21"
},
{
"start": 1519,
"end": 1543,
"text": "(Propp and Wilson, 1996)",
"ref_id": "BIBREF21"
},
{
"start": 2025,
"end": 2049,
"text": "(Propp and Wilson, 1996)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": "Recently (Amaya and Bened\u00ed, 2000) , the PS was successfully used to estimate the parameters of a WSME language model . In that work, a comparison was made between the performance of WSME models trained using MCMC and WSME models trained using PS. Features of n-grams and features of triggers were used In both kinds of models, and the WSME model trained with PS had better performance. We then considered it appropriate to use PS in the training procedure of the WSME.",
"cite_spans": [
{
"start": 9,
"end": 33,
"text": "(Amaya and Bened\u00ed, 2000)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": "The model parameters were completed with the estimation of the global normalization constant a . Using 7 ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "f &",
"sec_num": null
},
{
"text": ", is easy to sample from it in the traditional way.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a5 Y X",
"sec_num": null
},
{
"text": "The main goal of this paper is the incorporation of gramatical features to the WSME. Grammatical information may be helpful in many aplications of computational linguistics. The grammatical structure of the sentence provides long-distance information to the model, thereby complementing the information provided by other sources and improving the performance of the model. Grammatical features give a better weight to such parameters in grammatically correct sentences than in grammatically incorrect sentences, thereby helping the model to assign better probabilities to correct sentences from the language of the applica-tion. To capture the grammatical information, we use Stochastic Context-Free Grammars (SCFG).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "Over the last decade, there has been an increasing interest in Stochastic Context-Free Grammars (SCFGs) for use in different tasks (K., 1979; Jelinek, 1991; Ney, 1992; Sakakibara, 1990) . The reason for this can be found in the capability of SCFGs to model the long-term dependencies established between the different lexical units of a sentence, and the possibility to incorporate the stochastic information that allows for an adequate modeling of the variability phenomena. Thus, SCFGs have been successfully used on limited-domain tasks of low perplexity. However, SCFGs work poorly for large vocabulary, generalpurpose tasks, because the parameter learning and the computation of word transition probabilities present serious problems for complex real tasks.",
"cite_spans": [
{
"start": 131,
"end": 141,
"text": "(K., 1979;",
"ref_id": "BIBREF16"
},
{
"start": 142,
"end": 156,
"text": "Jelinek, 1991;",
"ref_id": "BIBREF13"
},
{
"start": 157,
"end": 167,
"text": "Ney, 1992;",
"ref_id": "BIBREF19"
},
{
"start": 168,
"end": 185,
"text": "Sakakibara, 1990)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "To capture the long-term relations and to solve the main problem derived from the use of SCFGs in large-vocabulary complex tasks,we consider the proposal in (Bened\u00ed and S\u00e1nchez, 2000) : define a category-based SCFG and a probabilistic model of word distribution in the categories. The use of categories as terminal of the grammar reduces the number of rules to take into account and thus, the time complexity of the SCFG learning procedure. The use of the probabilistic model of word distribution in the categories, allows us to obtain the best derivation of the sentences in the application.",
"cite_spans": [
{
"start": 157,
"end": 183,
"text": "(Bened\u00ed and S\u00e1nchez, 2000)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "Actually, we have to solve two problems: the estimation of the parameters of the models and their integration to obtain the best derivation of a sentence.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "The parameters of the two models are estimated from a training sample. Each word in the training sample has a part-of-speech tag (POStag) associated to it. These POStags are considered as word categories and are the terminal symbols of our SCFG.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "Given a category, the probability distribution of a word is estimated by means of the relative frequency of the word in the category, i.e. the relative frequency which the word has been labeled with a POStag (a word may belong to different categories).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "To estimate the SCFG parameters, several algorithms have been presented (K. and S.J., 1991; Pereira and Shabes, 1992; Amaya et al., 1999; . Taking into account the good results achieved on real tasks , we used them to learn our category-based SCFG.",
"cite_spans": [
{
"start": 72,
"end": 91,
"text": "(K. and S.J., 1991;",
"ref_id": "BIBREF15"
},
{
"start": 92,
"end": 117,
"text": "Pereira and Shabes, 1992;",
"ref_id": "BIBREF20"
},
{
"start": 118,
"end": 137,
"text": "Amaya et al., 1999;",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "To solve the integration problem, we used an algorithm that computes the probability of the best derivation that generates a sentence, given the category-based grammar and the model of word distribution into categories (Bened\u00ed and S\u00e1nchez, 2000) . This algorithm is based on the well-known Viterbi-like scheme for SCFGs.",
"cite_spans": [
{
"start": 219,
"end": 245,
"text": "(Bened\u00ed and S\u00e1nchez, 2000)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "Once the grammatical framework is defined, we are in position to make use of the information provided by the SCFG. In order to define the grammatical features, we first introduce some notation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "A Context-Free Grammar G is a four-tuple ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "\u00a6 x T \u00a2 \u00a1 T \" \u00a3 $ T \u00a2 \u00a4 ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "\u00a4 \u00b5 ! ! \u00a2 $ #",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": ", a sentence of the training set. As mentioned above, we can compute the best derivation of the sentence \u00a4 , using the defined SCFG and obtain the parse tree of the sentence.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "Once we have the parse tree of all the sentences in the training corpus, we can collect the set of all the production rules used in the derivation of the sentences in the corpus.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "Formally: we define the set is the set representation of the grammatical information contained in the derivation trees of the sentences and may be incorporated to the WSME model by means of the characteristic functions defined as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "\u00a6 \u00a4 \u00a9 \u00b6 \u00a6 x T \u2022 T \" ) \u00a9 Y , where T \u2022 T \" \u00a1 \u00b9 \u00ac $ . \u00a6 \u00a4 ` i s",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "S w r \u00c0 \u00a6 \u00a4 \u00a9 8 \u00bf \u00c1 D if \u00a6 T Y T \" $ F \u00a6 \u00a4 \u00a9 x Othewise",
"eq_num": "(10)"
}
],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "Thus, whenever the WSME model processes a sentence \u00a4 , if it is looking for a specific grammatial feature, say",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "\u00a6 x \u00c2 Y T \u00c3 f T \" \u00c4",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": ", we get the derivation tree for \u00a4 and the set \u00a6 \u00a4 `",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "i s calculated from the derivation tree. Finally, the model asks if the the tuple",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "\u00a6 x \u00c2 Y T \u00c3 f T \" \u00c4",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "is an element of \u00a6 \u00a4 \u00a9",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": ". If it is, the feature is active; if not, the feature",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "\u00a6 x \u00c2 Y T \u00c3 f T \" \u00c4",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "does not contribute to the sentence probability. Therefore, a sentence may be a grammatically incorrect sentence (relative to the SCFG used), if derivations with low frequency appears.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The grammatical features",
"sec_num": "3"
},
{
"text": "A part of the Wall Street Journal (WSJ) which had been processed in the Penn Treebanck Project (Marcus et al., 1993) was used in the experiments. This corpus was automatically labelled and manually checked. There were two kinds of labelling: POStag labelling and syntactic labelling. The POStag vocabulary was composed of 45 labels. The syntactic labels are 14. The corpus was divided into sentences according to the bracketing.",
"cite_spans": [
{
"start": 95,
"end": 116,
"text": "(Marcus et al., 1993)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Work",
"sec_num": "4"
},
{
"text": "We selected 12 sections of the corpus at random. Six were used as training corpus, three as test set and the other three sections were used as held-out for tuning the smoothing WSME model. The sets are described as follow: the training corpus has 11,201 sentences; the test set has 6,350 sentences and the held-out set has 5,796 sentences.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Work",
"sec_num": "4"
},
{
"text": "A base-line Katz back-off smoothed trigram model was trained using the CMU-Cambridge statistical Language Modeling Toolkit 4 and used as prior distribution in (3) i.e.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Work",
"sec_num": "4"
},
{
"text": ". The vocabulary generated by the trigram model was used as vocabulary of the WSME model. The size of the vocabulary was 19,997 words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a5 Y X",
"sec_num": null
},
{
"text": "The estimation of the word-category probability distribution was computed from the training corpus. In order to avoid null values, the unseen events were labeled with a special \"unknown\" symbol which did not appear in the vocabulary, so that the probabilitie of the unseen envent were positive for all the categories.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a5 Y X",
"sec_num": null
},
{
"text": "The SCFG had the maximum number of rules which can be composed of 45 terminal symbols (the number of POStags) and 14 non-terminal symbols (the number of syntactic labels). The initial probabilities were randomly generated and three different seeds were tested. However, only one of them is here given that the results were very similar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a5 Y X",
"sec_num": null
},
{
"text": "The size of the sample used in the ISS was estimated by means of an experimental procedure and was set at 10,000 elements. The procedure used to generate the sample made use of the \"diagnosis of convergence\" (Neal, 1993) , a method by means of which an inicial portion of each run of the Markov chain of sufficient length is discarded. Thus, the states in the remaining portion come from the desired equilibrium distribution. In this work, a discarded portion of 3,000 elements was establiched. Thus in practice, we have to generate 13,000 instances of the Markov chain.",
"cite_spans": [
{
"start": 208,
"end": 220,
"text": "(Neal, 1993)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a5 Y X",
"sec_num": null
},
{
"text": "During the IIS, every sample was tagged using the grammar estimated above, and then the grammatical features were extracted, before combining them with other kinds of features. The adequate number of iterations of the IIS was established experimentally in 13.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a5 Y X",
"sec_num": null
},
{
"text": "We trained several WSME models using the Perfect Sampling algorithm in the IIS and a different set of features (including the grammatical features) for each model. The different sets of features used in the models were: n-grams (1grams,2-grams,3-grams); triggers; n-grams and grammatical features; triggers and grammatical feautres; n-grams, triggers and grammatical features. The A -gram features,(N), was selected by means of its frequency in the corpus. We select all the unigrams, the bigrams with frequency greater than 5 and the trigrams with frequency greater than 10, in order to mantain the proportion of each type of A -gram in the corpus. The triggers, (T), were generated using a trig- Adam Berger 5 . The triggers were selected in acordance with de mutual information. The triggers selected were those with mutual information greater than 0.0001.",
"cite_spans": [
{
"start": 698,
"end": 711,
"text": "Adam Berger 5",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a5 Y X",
"sec_num": null
},
{
"text": "The grammatical features, (G), were selected using the parser tree of all the sentences in the training corpus to obtain the sets \u00a6 and, so, we smooth the model. We smoothed it using a gaussian prior technique. In the gaussian technique, we assumed that the f & paramters had a gaussian (normal) prior probability distribution (Chen and Rosenfeld, 1999b) and found the maximum aposteriori parameter distribution. The prior distribution was",
"cite_spans": [
{
"start": 327,
"end": 354,
"text": "(Chen and Rosenfeld, 1999b)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a5 Y X",
"sec_num": null
},
{
"text": "f & 5 \u00c5 AE \u00a6 x T \" \u00c7 &",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a5 Y X",
"sec_num": null
},
{
"text": ", and we used the held-out data to find the \u00c7 & parameters. Table 1 shows the experimental results: the first row represents the set of features used. The second row shows the perplexity of the models without using grammatical features. The third row shows the perplexity of the models using grammatical features and the fourth row shows the improvement in perplexity of each model using grammatical features over the corresponding model without grammatical features. As can be seen in Table 1 , we see that all the models using grammatical features perform better than the models that do not use it. Since the training procedure was the same for all the models described and since the only difference between the two kinds of models compared were the grammatical features, then we conclude that the improvement must be due to the inclusion of such features into the set of features. The average percentage of improvement was about 13%.",
"cite_spans": [],
"ref_spans": [
{
"start": 60,
"end": 67,
"text": "Table 1",
"ref_id": "TABREF4"
},
{
"start": 486,
"end": 493,
"text": "Table 1",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "\u00a5 Y X",
"sec_num": null
},
{
"text": "Also, although the model N+T performs better than the other model without grammatical features (N,T), it behaves worse than all the models with grammatical features ( N+G improved 2.9% and T+G improvd 5.9% over N+T).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a5 Y X",
"sec_num": null
},
{
"text": "In this work, we have sucessfully added grammatical features to a WSME language model using a SCFG to extract the grammatical information. We have shown that the the use of grammatical features in a WSME model improves the performance of the model. Adding grammatical features to the WSME model we have obtained a reduction in perplexity of 13% on average over models that do not use grammatical features. Also a reduction in perplexity between approximately 22% and 28% over the n-gram model has been obtained.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions and future work",
"sec_num": "5"
},
{
"text": "We are working on the implementation of other kinds of grammatical features which are based on the POStags sentences obtained using the SCFG that we have defined. The prelimary experiments have shown promising results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions and future work",
"sec_num": "5"
},
{
"text": "We will also be working on the evaluation of the word-error rate (WER) of the WSME model. In the case of WSME model the WER may be evaluated in a type of post-procesing using the nbest utterances.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions and future work",
"sec_num": "5"
},
{
"text": "By sentence, we understand any sequence of linguistic units that belongs to a certain vocabulary.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Available at: http://svr-www.eng.cam.ac.uk/ prc14/toolkit.html",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Available at: htpp://www.cs.cmu.edu/afs/cs/user/aberger/www/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Using Perfect Sampling in Parameter Estimation of a Wole Sentence Maximum Entropy Language Model",
"authors": [
{
"first": "F",
"middle": [],
"last": "Amaya",
"suffix": ""
},
{
"first": "J",
"middle": [
"M"
],
"last": "Bened\u00ed",
"suffix": ""
}
],
"year": 2000,
"venue": "Proc. Fourth Computational Natural Language Learning Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "F. Amaya and J. M. Bened\u00ed. 2000. Using Perfect Sam- pling in Parameter Estimation of a Wole Sentence Maximum Entropy Language Model. Proc. Fourth Computational Natural Language Learning Work- shop, CoNLL-2000.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Learning stochastic context-free grammars from bracketed corpora by means of reestimation algorithms",
"authors": [
{
"first": "F",
"middle": [],
"last": "Amaya",
"suffix": ""
},
{
"first": "J",
"middle": [
"A"
],
"last": "S\u00e1nchez",
"suffix": ""
},
{
"first": "J",
"middle": [
"M"
],
"last": "Bened\u00ed",
"suffix": ""
}
],
"year": 1999,
"venue": "Proc. VIII Spanish Symposium on Pattern Recognition and Image Analysis",
"volume": "",
"issue": "",
"pages": "119--126",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "F. Amaya, J. A. S\u00e1nchez, and J. M. Bened\u00ed. 1999. Learning stochastic context-free grammars from bracketed corpora by means of reestimation algo- rithms. Proc. VIII Spanish Symposium on Pattern Recognition and Image Analysis, pages 119-126.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "A maximun likelihood approach to continuous speech recognition",
"authors": [
{
"first": "L",
"middle": [
"R"
],
"last": "Bahal",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "Jelinek",
"suffix": ""
},
{
"first": "R",
"middle": [
"L"
],
"last": "Mercer",
"suffix": ""
}
],
"year": 1983,
"venue": "IEEE Trans. on Pattern analysis and Machine Intelligence",
"volume": "5",
"issue": "2",
"pages": "179--190",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "L.R. Bahal, F.Jelinek, and R. L. Mercer. 1983. A maximun likelihood approach to continuous speech recognition. IEEE Trans. on Pattern analysis and Machine Intelligence, 5(2):179-190.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "A multispan language modeling framework for large vocabulary speech recognition",
"authors": [
{
"first": "J",
"middle": [
"R"
],
"last": "Bellegarda",
"suffix": ""
}
],
"year": 1998,
"venue": "IEEE Transactions on Speech and Audio Processing",
"volume": "6",
"issue": "5",
"pages": "456--467",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. R. Bellegarda. 1998. A multispan language model- ing framework for large vocabulary speech recogni- tion. IEEE Transactions on Speech and Audio Pro- cessing, 6 (5):456-467.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Combination of n-grams and stochastic context-free grammars for language modeling",
"authors": [
{
"first": "J",
"middle": [
"M"
],
"last": "Bened\u00ed",
"suffix": ""
},
{
"first": "J",
"middle": [
"A"
],
"last": "S\u00e1nchez",
"suffix": ""
}
],
"year": 2000,
"venue": "Porc. International conference on computational lingustics (COLING-ACL)",
"volume": "",
"issue": "",
"pages": "55--61",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J.M. Bened\u00ed and J.A. S\u00e1nchez. 2000. Combination of n-grams and stochastic context-free grammars for language modeling. Porc. International conference on computational lingustics (COLING-ACL), pages 55-61.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A Maximun Entropy aproach to natural languaje processing",
"authors": [
{
"first": "A",
"middle": [
"L"
],
"last": "Berger",
"suffix": ""
},
{
"first": "V",
"middle": [
"J"
],
"last": "Della Pietra",
"suffix": ""
},
{
"first": "S",
"middle": [
"A"
],
"last": "Della Pietra",
"suffix": ""
}
],
"year": 1996,
"venue": "Computational Linguistics",
"volume": "22",
"issue": "1",
"pages": "39--72",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A.L. Berger, V.J. Della Pietra, and S.A. Della Pietra. 1996. A Maximun Entropy aproach to natural languaje processing. Computational Linguistics, 22(1):39-72.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Survey paper on statistical language modeling",
"authors": [
{
"first": "A",
"middle": [],
"last": "Borthwick",
"suffix": ""
}
],
"year": 1997,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Borthwick. 1997. Survey paper on statistical lan- guage modeling. Technical report, New York Uni- versity.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "A Maximum Entropy Approach to Named Entity Recognition",
"authors": [
{
"first": "A",
"middle": [],
"last": "Borthwick",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Borthwick. 1999. A Maximum Entropy Approach to Named Entity Recognition. PhD Dissertation Proposal, New York University.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Structured language modeling",
"authors": [
{
"first": "C",
"middle": [],
"last": "Chelba",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "Jelinek",
"suffix": ""
}
],
"year": 2000,
"venue": "Computer Speech and Language",
"volume": "14",
"issue": "",
"pages": "283--332",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "C. Chelba and F. Jelinek. 2000. Structured lan- guage modeling. Computer Speech and Language, 14:283-332.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Efficient sampling and feature selection in whole sentence maximum entropy language models",
"authors": [
{
"first": "S",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Rosenfeld",
"suffix": ""
}
],
"year": 1999,
"venue": "Proc. IEEE Int. Conference on Acoustics, Speech and Signal Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Chen and R. Rosenfeld. 1999a. Efficient sampling and feature selection in whole sentence maximum entropy language models. Proc. IEEE Int. Confer- ence on Acoustics, Speech and Signal Processing (ICASSP).",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "A gaussian prior for smoothing maximum entropy models",
"authors": [
{
"first": "S",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Rosenfeld",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Chen and R. Rosenfeld. 1999b. A gaussian prior for smoothing maximum entropy models. Techni- cal Report CMU-CS-99-108, Carnegie Mellon Uni- versity.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Inducing features of random fields",
"authors": [
{
"first": "S",
"middle": [
"Della"
],
"last": "Pietra",
"suffix": ""
},
{
"first": "V",
"middle": [
"Della"
],
"last": "Pietra",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Lafferty",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Della Pietra, V. Della Pietra, and J. Lafferty. 1995. Inducing features of random fields. Technical Re- port CMU-CS-95-144, Carnegie Mellon University.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "A dynamic language model for speech recognition",
"authors": [
{
"first": "F",
"middle": [],
"last": "Jelinek",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Merialdo",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Roukos",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Strauss",
"suffix": ""
}
],
"year": 1991,
"venue": "Proc. of Speech and Natural Language DARPA Work Shop",
"volume": "",
"issue": "",
"pages": "293--295",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "F. Jelinek, B. Merialdo, S. Roukos, and M. Strauss. 1991. A dynamic language model for speech recog- nition. Proc. of Speech and Natural Language DARPA Work Shop, pages 293-295.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Up from trigrams! the struggle for improved language models",
"authors": [
{
"first": "F",
"middle": [],
"last": "Jelinek",
"suffix": ""
}
],
"year": 1991,
"venue": "Proc. of EU-ROSPEECH, European Conference on Speech Comunication and Technology",
"volume": "3",
"issue": "",
"pages": "1034--1040",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "F. Jelinek. 1991. Up from trigrams! the strug- gle for improved language models. Proc. of EU- ROSPEECH, European Conference on Speech Co- munication and Technology, 3:1034-1040.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Statistical Methods for Speech Recognition",
"authors": [
{
"first": "F",
"middle": [],
"last": "Jelinek",
"suffix": ""
}
],
"year": 1997,
"venue": "Massachusetts Institut of Technology",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "F. Jelinek. 1997. Statistical Methods for Speech Recognition. The MIT Press, Massachusetts Insti- tut of Technology. Cambridge, Massachusetts.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Applications of stochastic context-free grammars using the inside-outside algorithm",
"authors": [
{
"first": "K",
"middle": [],
"last": "Lari",
"suffix": ""
},
{
"first": "S",
"middle": [
"J"
],
"last": "Young",
"suffix": ""
}
],
"year": 1991,
"venue": "Computer Speech and Language",
"volume": "",
"issue": "",
"pages": "237--257",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lari K. and Young S.J. 1991. Applications of stochas- tic context-free grammars using the inside-outside algorithm. Computer Speech and Language, pages 237-257.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Trainable grammars for speech recognition. Speech comunications papers for the 97th meeting of the",
"authors": [
{
"first": "J",
"middle": [
"K"
],
"last": "Baker",
"suffix": ""
}
],
"year": 1979,
"venue": "",
"volume": "",
"issue": "",
"pages": "547--550",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Baker J. K. 1979. Trainable grammars for speech recognition. Speech comunications papers for the 97th meeting of the Acoustical Society of America, pages 547-550.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Building a large annotates corpus of english: the penn treebanck",
"authors": [
{
"first": "M",
"middle": [
"P"
],
"last": "Marcus",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Santorini",
"suffix": ""
},
{
"first": "M",
"middle": [
"A"
],
"last": "Marcinkiewicz",
"suffix": ""
}
],
"year": 1993,
"venue": "Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. P. Marcus, B. Santorini, and M.A. Marcinkiewicz. 1993. Building a large annotates corpus of english: the penn treebanck. Computational Linguistics, 19.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Probabilistic inference using markov chain monte carlo methods",
"authors": [
{
"first": "R",
"middle": [
"M"
],
"last": "Neal",
"suffix": ""
}
],
"year": 1993,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. M. Neal. 1993. Probabilistic inference using markov chain monte carlo methods. Technical Re- port CRG-TR-93-1, Departament of Computer Sci- ence, University of Toronto.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Stochastic grammars and pattern recognition",
"authors": [
{
"first": "H",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 1992,
"venue": "Speech Recognition and Understanding. Recent Advances",
"volume": "",
"issue": "",
"pages": "319--344",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H. Ney. 1992. Stochastic grammars and pattern recognition. In P. Laface and R. De Mori, editors, Speech Recognition and Understanding. Recent Ad- vances, pages 319-344. Springer Verlag.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Inside-outsude reestimation from partially bracketed corpora",
"authors": [
{
"first": "F",
"middle": [],
"last": "Pereira",
"suffix": ""
},
{
"first": "Y",
"middle": [],
"last": "Shabes",
"suffix": ""
}
],
"year": 1992,
"venue": "Proceedings of the 30th Annual Meeting of the Assotiation for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "128--135",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "F. Pereira and Y. Shabes. 1992. Inside-outsude reesti- mation from partially bracketed corpora. Proceed- ings of the 30th Annual Meeting of the Assotia- tion for Computational Linguistics, pages 128-135. University of Delaware.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Exact sampling with coupled markov chains and applications to statistical mechanics",
"authors": [
{
"first": "J",
"middle": [
"G"
],
"last": "Propp",
"suffix": ""
},
{
"first": "D",
"middle": [
"B"
],
"last": "Wilson",
"suffix": ""
}
],
"year": 1996,
"venue": "Random Structures and Algorithms",
"volume": "9",
"issue": "",
"pages": "223--252",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. G. Propp and D. B. Wilson. 1996. Exact sampling with coupled markov chains and applications to sta- tistical mechanics. Random Structures and Algo- rithms, 9:223-252.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Maximum Entropy models for natural language ambiguity resolution. PhD Dissertation Proposal",
"authors": [
{
"first": "A",
"middle": [],
"last": "Ratnapharkhi",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Ratnapharkhi. 1998. Maximum Entropy models for natural language ambiguity resolution. PhD Dis- sertation Proposal, University of Pensylvania.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "A Maximun Entropy approach to adaptive statistical language modeling",
"authors": [
{
"first": "R",
"middle": [],
"last": "Rosenfeld",
"suffix": ""
}
],
"year": 1996,
"venue": "Computer Speech and Language",
"volume": "10",
"issue": "",
"pages": "187--228",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Rosenfeld. 1996. A Maximun Entropy approach to adaptive statistical language modeling. Computer Speech and Language, 10:187-228.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "A whole sentence Maximim Entropy language model",
"authors": [
{
"first": "R",
"middle": [],
"last": "Rosenfeld",
"suffix": ""
}
],
"year": 1997,
"venue": "IEEE workshop on Speech Recognition and Understanding",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Rosenfeld. 1997. A whole sentence Maximim En- tropy language model. IEEE workshop on Speech Recognition and Understanding.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Learning context-free grammars from structural data in polinomila time",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Sakakibara",
"suffix": ""
}
],
"year": 1990,
"venue": "Theoretical Computer Science",
"volume": "76",
"issue": "",
"pages": "233--242",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Y. Sakakibara. 1990. Learning context-free grammars from structural data in polinomila time. Theoretical Computer Science, 76:233-242.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Learning of stochastic context-free grammars by means of estimation algorithms",
"authors": [
{
"first": "J",
"middle": [
"A"
],
"last": "S\u00e1nchez",
"suffix": ""
},
{
"first": "J",
"middle": [
"M"
],
"last": "Bened\u00ed",
"suffix": ""
}
],
"year": 1999,
"venue": "Proc. of EUROSPEECH, European Conference on Speech Comunication and Technology",
"volume": "4",
"issue": "",
"pages": "1799--1802",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. A. S\u00e1nchez and J. M. Bened\u00ed. 1999. Learning of stochastic context-free grammars by means of esti- mation algorithms. Proc. of EUROSPEECH, Eu- ropean Conference on Speech Comunication and Technology, 4:1799-1802.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Granted by Universidad del Cauca, Popay\u00e1n (Colombia)",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF1": {
"text": "and their union as defined in section 3. The size of the initial set of features was: 12,023 A -grams, 39,428 triggers and 258 gramatical features, in total 51,709 features. At the end of the training procedure, the number of active features was significantly reduced to 4,000 features on average.During the training procedure, some of the",
"type_str": "figure",
"num": null,
"uris": null
},
"TABREF4": {
"text": "Comparison of the perplexity between models with grammatical features and models without grammatical features for WSME models over part of the WSJ corpus. N means features of n-grams, T means features of Triggers.",
"content": "<table><tr><td>Feat.</td><td>N</td><td>T</td><td>N+T</td></tr><tr><td>Without</td><td colspan=\"3\">143.197 145.432 129.639</td></tr><tr><td>With</td><td colspan=\"3\">125.912 122.023 116.42</td></tr><tr><td colspan=\"4\">% Improv. 12.10% 16.10% 10.2 %</td></tr><tr><td colspan=\"4\">The perplexity of the trained n-gram model was</td></tr><tr><td>PP=162.049</td><td/><td/><td/></tr><tr><td colspan=\"2\">ger toolkit developed by</td><td/><td/></tr></table>",
"html": null,
"type_str": "table",
"num": null
},
"TABREF5": {
"text": ", all the WSME models performed better than the A -gram model, however that is natural because, in the worst case (if all",
"content": "<table><tr><td>WSME models perform like the In</td><td>f & \u00c8 D ), the -gram model. A</td></tr></table>",
"html": null,
"type_str": "table",
"num": null
}
}
}
} |