File size: 83,576 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 | {
"paper_id": "P05-1017",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:37:38.924941Z"
},
"title": "Extracting Semantic Orientations of Words using Spin Model",
"authors": [
{
"first": "Hiroya",
"middle": [],
"last": "Takamura",
"suffix": "",
"affiliation": {
"laboratory": "Precision and Intelligence Laboratory",
"institution": "Tokyo Institute of Technology",
"location": {
"addrLine": "4259 Nagatsuta Midori-ku Yokohama",
"postCode": "226-8503",
"country": "Japan"
}
},
"email": "takamura@pi.titech.ac.jp"
},
{
"first": "Takashi",
"middle": [],
"last": "Inui",
"suffix": "",
"affiliation": {
"laboratory": "Precision and Intelligence Laboratory",
"institution": "Tokyo Institute of Technology",
"location": {
"addrLine": "4259 Nagatsuta Midori-ku Yokohama",
"postCode": "226-8503",
"country": "Japan"
}
},
"email": "tinui@lr.pi.titech.ac.jp"
},
{
"first": "Manabu",
"middle": [],
"last": "Okumura",
"suffix": "",
"affiliation": {
"laboratory": "Precision and Intelligence Laboratory",
"institution": "Tokyo Institute of Technology",
"location": {
"addrLine": "4259 Nagatsuta Midori-ku Yokohama",
"postCode": "226-8503",
"country": "Japan"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We propose a method for extracting semantic orientations of words: desirable or undesirable. Regarding semantic orientations as spins of electrons, we use the mean field approximation to compute the approximate probability function of the system instead of the intractable actual probability function. We also propose a criterion for parameter selection on the basis of magnetization. Given only a small number of seed words, the proposed method extracts semantic orientations with high accuracy in the experiments on English lexicon. The result is comparable to the best value ever reported.",
"pdf_parse": {
"paper_id": "P05-1017",
"_pdf_hash": "",
"abstract": [
{
"text": "We propose a method for extracting semantic orientations of words: desirable or undesirable. Regarding semantic orientations as spins of electrons, we use the mean field approximation to compute the approximate probability function of the system instead of the intractable actual probability function. We also propose a criterion for parameter selection on the basis of magnetization. Given only a small number of seed words, the proposed method extracts semantic orientations with high accuracy in the experiments on English lexicon. The result is comparable to the best value ever reported.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Identification of emotions (including opinions and attitudes) in text is an important task which has a variety of possible applications. For example, we can efficiently collect opinions on a new product from the internet, if opinions in bulletin boards are automatically identified. We will also be able to grasp people's attitudes in questionnaire, without actually reading all the responds.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "An important resource in realizing such identification tasks is a list of words with semantic orientation: positive or negative (desirable or undesirable). Frequent appearance of positive words in a document implies that the writer of the document would have a positive attitude on the topic. The goal of this paper is to propose a method for automatically creating such a word list from glosses (i.e., definition or explanation sentences ) in a dictionary, as well as from a thesaurus and a corpus. For this purpose, we use spin model, which is a model for a set of electrons with spins. Just as each electron has a direction of spin (up or down), each word has a semantic orientation (positive or negative). We therefore regard words as a set of electrons and apply the mean field approximation to compute the average orientation of each word. We also propose a criterion for parameter selection on the basis of magnetization, a notion in statistical physics. Magnetization indicates the global tendency of polarization.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We empirically show that the proposed method works well even with a small number of seed words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Turney and Littman (2003) proposed two algorithms for extraction of semantic orientations of words. To calculate the association strength of a word with positive (negative) seed words, they used the number of hits returned by a search engine, with a query consisting of the word and one of seed words (e.g., \"word NEAR good\", \"word NEAR bad\"). They regarded the difference of two association strengths as a measure of semantic orientation. They also proposed to use Latent Semantic Analysis to compute the association strength with seed words. An empirical evaluation was conducted on 3596 words extracted from General Inquirer (Stone et al., 1966) . Hatzivassiloglou and McKeown (1997) focused on conjunctive expressions such as \"simple and well-received\" and \"simplistic but well-received\", where the former pair of words tend to have the same semantic orientation, and the latter tend to have the opposite orientation. They first classify each conjunctive expression into the same-orientation class or the different-orientation class. They then use the classified expressions to cluster words into the positive class and the negative class. The experiments were conducted with the dataset that they created on their own. Evaluation was limited to adjectives. Kobayashi et al. (2001) proposed a method for extracting semantic orientations of words with bootstrapping. The semantic orientation of a word is determined on the basis of its gloss, if any of their 52 hand-crafted rules is applicable to the sentence. Rules are applied iteratively in the bootstrapping framework. Although Kobayashi et al.'s work provided an accurate investigation on this task and inspired our work, it has drawbacks: low recall and language dependency. They reported that the semantic orientations of only 113 words are extracted with precision 84.1% (the low recall is due partly to their large set of seed words (1187 words)). The handcrafted rules are only for Japanese. Kamps et al. (2004) constructed a network by connecting each pair of synonymous words provided by WordNet (Fellbaum, 1998) , and then used the shortest paths to two seed words \"good\" and \"bad\" to obtain the semantic orientation of a word. Limitations of their method are that a synonymy dictionary is required, that antonym relations cannot be incorporated into the model. Their evaluation is restricted to adjectives. The method proposed by Hu and Liu (2004) is quite similar to the shortest-path method. Hu and Liu's method iteratively determines the semantic orientations of the words neighboring any of the seed words and enlarges the seed word set in a bootstrapping manner.",
"cite_spans": [
{
"start": 19,
"end": 25,
"text": "(2003)",
"ref_id": null
},
{
"start": 628,
"end": 648,
"text": "(Stone et al., 1966)",
"ref_id": "BIBREF15"
},
{
"start": 651,
"end": 686,
"text": "Hatzivassiloglou and McKeown (1997)",
"ref_id": "BIBREF5"
},
{
"start": 1262,
"end": 1285,
"text": "Kobayashi et al. (2001)",
"ref_id": "BIBREF10"
},
{
"start": 1586,
"end": 1618,
"text": "Kobayashi et al.'s work provided",
"ref_id": null
},
{
"start": 1956,
"end": 1975,
"text": "Kamps et al. (2004)",
"ref_id": "BIBREF9"
},
{
"start": 2062,
"end": 2078,
"text": "(Fellbaum, 1998)",
"ref_id": "BIBREF3"
},
{
"start": 2398,
"end": 2415,
"text": "Hu and Liu (2004)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Subjective words are often semantically oriented. Wiebe (2000) used a learning method to collect subjective adjectives from corpora. Riloff et al. (2003) focused on the collection of subjective nouns.",
"cite_spans": [
{
"start": 133,
"end": 153,
"text": "Riloff et al. (2003)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "We later compare our method with Turney and Littman's method and Kamps et al.'s method.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "The other pieces of research work mentioned above are related to ours, but their objectives are different from ours.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "We give a brief introduction to the spin model and the mean field approximation, which are wellstudied subjects both in the statistical mechanics and the machine learning communities (Geman and Geman, 1984; Inoue and Carlucci, 2001; Mackay, 2003) .",
"cite_spans": [
{
"start": 183,
"end": 206,
"text": "(Geman and Geman, 1984;",
"ref_id": "BIBREF4"
},
{
"start": 207,
"end": 232,
"text": "Inoue and Carlucci, 2001;",
"ref_id": "BIBREF8"
},
{
"start": 233,
"end": 246,
"text": "Mackay, 2003)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "A spin system is an array of N electrons, each of which has a spin with one of two values \"+1 (up)\" or \"\u22121 (down)\". Two electrons next to each other energetically tend to have the same spin. This model is called the Ising spin model, or simply the spin model (Chandler, 1987) . The energy function of a spin system can be represented as",
"cite_spans": [
{
"start": 259,
"end": 275,
"text": "(Chandler, 1987)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "E(x, W ) = \u2212 1 2 ij w ij x i x j ,",
"eq_num": "(1)"
}
],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "where x i and x j (\u2208 x) are spins of electrons i and j, matrix W = {w ij } represents weights between two electrons. In a spin system, the variable vector x follows the Boltzmann distribution :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P (x|W ) = exp(\u2212\u03b2E(x, W )) Z(W ) ,",
"eq_num": "(2)"
}
],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "where Z(W ) = x exp(\u2212\u03b2E(x, W )) is the normalization factor, which is called the partition function and \u03b2 is a constant called the inversetemperature. As this distribution function suggests, a configuration with a higher energy value has a smaller probability. Although we have a distribution function, computing various probability values is computationally difficult. The bottleneck is the evaluation of Z(W ), since there are 2 N configurations of spins in this system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "We therefore approximate P (x|W ) with a simple function Q(x; \u03b8). The set of parameters \u03b8 for Q, is determined such that Q(x; \u03b8) becomes as similar to P (x|W ) as possible. As a measure for the distance between P and Q, the variational free energy F is often used, which is defined as the difference between the mean energy with respect to Q and the entropy of Q :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "F (\u03b8) = \u03b2 x Q(x; \u03b8)E(x; W ) \u2212 \u2212 x Q(x; \u03b8) log Q(x; \u03b8) . (3)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "The parameters \u03b8 that minimizes the variational free energy will be chosen. It has been shown that minimizing F is equivalent to minimizing the Kullback-Leibler divergence between P and Q (Mackay, 2003) . We next assume that the function Q(x; \u03b8) has the factorial form :",
"cite_spans": [
{
"start": 188,
"end": 202,
"text": "(Mackay, 2003)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "Q(x; \u03b8) = i Q(x i ; \u03b8 i ).",
"eq_num": "(4)"
}
],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "Simple substitution and transformation leads us to the following variational free energy :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "F (\u03b8) = \u2212 \u03b2 2 ij w ijxixj \u2212 i \u2212 x i Q(x i ; \u03b8 i ) log Q(x i ; \u03b8 i ) .",
"eq_num": "(5)"
}
],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "With the usual method of Lagrange multipliers, we obtain the mean field equation :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "x i = x i x i exp \u03b2x i j w ijxj x i exp \u03b2x i j w ijxj .",
"eq_num": "(6)"
}
],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "This equation is solved by the iterative update rule :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "x new i = x i x i exp \u03b2x i j w ijx old j x i exp \u03b2x i j w ijx old j . (7)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Spin Model and Mean Field Approximation",
"sec_num": "3"
},
{
"text": "We use the spin model to extract semantic orientations of words. Each spin has a direction taking one of two values: up or down. Two neighboring spins tend to have the same direction from a energetic reason. Regarding each word as an electron and its semantic orientation as the spin of the electron, we construct a lexical network by connecting two words if, for example, one word appears in the gloss of the other word. Intuition behind this is that if a word is semantically oriented in one direction, then the words in its gloss tend to be oriented in the same direction.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extraction of Semantic Orientation of Words with Spin Model",
"sec_num": "4"
},
{
"text": "Using the mean-field method developed in statistical mechanics, we determine the semantic orientations on the network in a global manner. The global optimization enables the incorporation of possibly noisy resources such as glosses and corpora, while existing simple methods such as the shortest-path method and the bootstrapping method cannot work in the presence of such noisy evidences. Those methods depend on less-noisy data such as a thesaurus.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extraction of Semantic Orientation of Words with Spin Model",
"sec_num": "4"
},
{
"text": "We construct a lexical network by linking two words if one word appears in the gloss of the other word. Each link belongs to one of two groups: the sameorientation links SL and the different-orientation links DL. If at least one word precedes a negation word (e.g., not) in the gloss of the other word, the link is a different-orientation link. Otherwise the links is a same-orientation link.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Construction of Lexical Networks",
"sec_num": "4.1"
},
{
"text": "We next set weights W = (w ij ) to links :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Construction of Lexical Networks",
"sec_num": "4.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "w ij = \uf8f1 \uf8f4 \uf8f4 \uf8f2 \uf8f4 \uf8f4 \uf8f3 1 \u221a d(i)d(j) (l ij \u2208 SL) \u2212 1 \u221a d(i)d(j) (l ij \u2208 DL) 0 otherwise ,",
"eq_num": "(8)"
}
],
"section": "Construction of Lexical Networks",
"sec_num": "4.1"
},
{
"text": "where l ij denotes the link between word i and word j, and d(i) denotes the degree of word i, which means the number of words linked with word i. Two words without connections are regarded as being connected by a link of weight 0. We call this network the gloss network (G). We construct another network, the glossthesaurus network (GT), by linking synonyms, antonyms and hypernyms, in addition to the the above linked words. Only antonym links are in DL.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Construction of Lexical Networks",
"sec_num": "4.1"
},
{
"text": "We enhance the gloss-thesaurus network with cooccurrence information extracted from corpus. As mentioned in Section 2, Hatzivassiloglou and McKeown (1997) used conjunctive expressions in corpus. Following their method, we connect two adjectives if the adjectives appear in a conjunctive form in the corpus. If the adjectives are connected by \"and\", the link belongs to SL. If they are connected by \"but\", the link belongs to DL. We call this network the gloss-thesaurus-corpus network (GTC).",
"cite_spans": [
{
"start": 119,
"end": 154,
"text": "Hatzivassiloglou and McKeown (1997)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Construction of Lexical Networks",
"sec_num": "4.1"
},
{
"text": "We suppose that a small number of seed words are given. In other words, we know beforehand the semantic orientations of those given words. We incorporate this small labeled dataset by modifying the previous update rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extraction of Orientations",
"sec_num": "4.2"
},
{
"text": "Instead of \u03b2E(x, W ) in Equation 2, we use the following function H(\u03b2, x, W ) :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extraction of Orientations",
"sec_num": "4.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "H(\u03b2, x, W ) = \u2212 \u03b2 2 ij w ij x i x j + \u03b1 i\u2208L (x i \u2212 a i ) 2 ,",
"eq_num": "(9)"
}
],
"section": "Extraction of Orientations",
"sec_num": "4.2"
},
{
"text": "where L is the set of seed words, a i is the orientation of seed word i, and \u03b1 is a positive constant. This expression means that if x i (i \u2208 L) is different from a i , the state is penalized.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extraction of Orientations",
"sec_num": "4.2"
},
{
"text": "Using function H, we obtain the new update rule for x i (i \u2208 L) : Inoue and Carlucci (2001) , in which they applied the spin glass model to image restoration.",
"cite_spans": [
{
"start": 66,
"end": 91,
"text": "Inoue and Carlucci (2001)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Extraction of Orientations",
"sec_num": "4.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "x new i = x i x i exp \u03b2x i s old i \u2212 \u03b1(x i \u2212 a i ) 2 x i exp \u03b2x i s old i \u2212 \u03b1(x i \u2212 a i ) 2 ,",
"eq_num": "(10)"
}
],
"section": "Extraction of Orientations",
"sec_num": "4.2"
},
{
"text": "Initially, the averages of the seed words are set according to their given orientations. The other averages are set to 0.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extraction of Orientations",
"sec_num": "4.2"
},
{
"text": "When the difference in the value of the variational free energy is smaller than a threshold before and after update, we regard computation converged.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extraction of Orientations",
"sec_num": "4.2"
},
{
"text": "The words with high final average values are classified as positive words. The words with low final average values are classified as negative words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extraction of Orientations",
"sec_num": "4.2"
},
{
"text": "The performance of the proposed method largely depends on the value of hyper-parameter \u03b2. In order to make the method more practical, we propose criteria for determining its value.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Hyper-parameter Prediction",
"sec_num": "4.3"
},
{
"text": "When a large labeled dataset is available, we can obtain a reliable pseudo leave-one-out error rate :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Hyper-parameter Prediction",
"sec_num": "4.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "1 |L| i\u2208L [a ix i ],",
"eq_num": "(11)"
}
],
"section": "Hyper-parameter Prediction",
"sec_num": "4.3"
},
{
"text": "where [t] is 1 if t is negative, otherwise 0, andx i is calculated with the right-hand-side of Equation 6, where the penalty term \u03b1(x i \u2212 a i ) 2 in Equation 10is ignored. We choose \u03b2 that minimizes this value. However, when a large amount of labeled data is unavailable, the value of pseudo leave-one-out error rate is not reliable. In such cases, we use magnetization m for hyper-parameter prediction :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Hyper-parameter Prediction",
"sec_num": "4.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "m = 1 N ix i .",
"eq_num": "(12)"
}
],
"section": "Hyper-parameter Prediction",
"sec_num": "4.3"
},
{
"text": "At a high temperature, spins are randomly oriented (paramagnetic phase, m \u2248 0). At a low temperature, most of the spins have the same direction (ferromagnetic phase, m = 0). It is known that at some intermediate temperature, ferromagnetic phase suddenly changes to paramagnetic phase. This phenomenon is called phase transition. Slightly before the phase transition, spins are locally polarized; strongly connected spins have the same polarity, but not in a global way.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Hyper-parameter Prediction",
"sec_num": "4.3"
},
{
"text": "Intuitively, the state of the lexical network is locally polarized. Therefore, we calculate values of m with several different values of \u03b2 and select the value just before the phase transition.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Hyper-parameter Prediction",
"sec_num": "4.3"
},
{
"text": "In our model, the semantic orientations of words are determined according to the averages values of the spins. Despite the heuristic flavor of this decision rule, it has a theoretical background related to maximizer of posterior marginal (MPM) estimation, or 'finite-temperature decoding' (Iba, 1999; Marroquin, 1985) . In MPM, the average is the marginal distribution over x i obtained from the distribution over x. We should note that the finite-temperature decoding is quite different from annealing type algorithms or 'zero-temperature decoding', which correspond to maximum a posteriori (MAP) estimation and also often used in natural language processing (Cowie et al., 1992 ).",
"cite_spans": [
{
"start": 289,
"end": 300,
"text": "(Iba, 1999;",
"ref_id": "BIBREF7"
},
{
"start": 301,
"end": 317,
"text": "Marroquin, 1985)",
"ref_id": "BIBREF12"
},
{
"start": 660,
"end": 679,
"text": "(Cowie et al., 1992",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion on the Model",
"sec_num": "4.4"
},
{
"text": "Since the model estimation has been reduced to simple update calculations, the proposed model is similar to conventional spreading activation approaches, which have been applied, for example, to word sense disambiguation (Veronis and Ide, 1990) . Actually, the proposed model can be regarded as a spreading activation model with a specific update rule, as long as we are dealing with 2-class model (2-Ising model).",
"cite_spans": [
{
"start": 221,
"end": 244,
"text": "(Veronis and Ide, 1990)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion on the Model",
"sec_num": "4.4"
},
{
"text": "However, there are some advantages in our modelling. The largest advantage is its theoretical background. We have an objective function and its approximation method. We thus have a measure of goodness in model estimation and can use another better approximation method, such as Bethe approximation (Tanaka et al., 2003) . The theory tells us which update rule to use. We also have a notion of magnetization, which can be used for hyperparameter estimation. We can use a plenty of knowledge, methods and algorithms developed in the field of statistical mechanics. We can also extend our model to a multiclass model (Q-Ising model).",
"cite_spans": [
{
"start": 298,
"end": 319,
"text": "(Tanaka et al., 2003)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion on the Model",
"sec_num": "4.4"
},
{
"text": "Another interesting point is the relation to maximum entropy model (Berger et al., 1996) , which is popular in the natural language processing community. Our model can be obtained by maximizing the entropy of the probability distribution Q(x) under constraints regarding the energy function.",
"cite_spans": [
{
"start": 67,
"end": 88,
"text": "(Berger et al., 1996)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion on the Model",
"sec_num": "4.4"
},
{
"text": "We used glosses, synonyms, antonyms and hypernyms of WordNet (Fellbaum, 1998) to construct an English lexical network. For part-of-speech tagging and lemmatization of glosses, we used Tree-Tagger (Schmid, 1994) . 35 stopwords (quite frequent words such as \"be\" and \"have\") are removed from the lexical network. Negation words include 33 words. In addition to usual negation words such as \"not\" and \"never\", we include words and phrases which mean negation in a general sense, such as \"free from\" and \"lack of\". The whole network consists of approximately 88,000 words. We collected 804 conjunctive expressions from Wall Street Journal and Brown corpus as described in Section 4.2.",
"cite_spans": [
{
"start": 61,
"end": 77,
"text": "(Fellbaum, 1998)",
"ref_id": "BIBREF3"
},
{
"start": 196,
"end": 210,
"text": "(Schmid, 1994)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "5"
},
{
"text": "The labeled dataset used as a gold standard is General Inquirer lexicon (Stone et al., 1966) as in the work by Turney and Littman (2003) . We extracted the words tagged with \"Positiv\" or \"Negativ\", and reduced multiple-entry words to single entries. As a result, we obtained 3596 words (1616 positive words and 1980 negative words) 1 . In the computation of Table 1 : Classification accuracy (%) with various networks and four different sets of seed words. In the parentheses, the predicted value of \u03b2 is written. For cv, no value is written for \u03b2, since 10 different values are obtained. seeds GTC GT G cv 90.8 (-) 90.9 (-) 86.9 (-) 14 81.9 (1.0) 80.2 (1.0) 76.2 (1.0) 4 73.8 (0.9) 73.7 (1.0) 65.2 (0.9) 2 74.6 (1.0) 61.8 (1.0) 65.7 (1.0) accuracy, seed words are eliminated from these 3596 words.",
"cite_spans": [
{
"start": 72,
"end": 92,
"text": "(Stone et al., 1966)",
"ref_id": "BIBREF15"
},
{
"start": 111,
"end": 136,
"text": "Turney and Littman (2003)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [
{
"start": 358,
"end": 365,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "5"
},
{
"text": "We conducted experiments with different values of \u03b2 from 0.1 to 2.0, with the interval 0.1, and predicted the best value as explained in Section 4.3. The threshold of the magnetization for hyper-parameter estimation is set to 1.0 \u00d7 10 \u22125 . That is, the predicted optimal value of \u03b2 is the largest \u03b2 whose corresponding magnetization does not exceeds the threshold value.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "5"
},
{
"text": "We performed 10-fold cross validation as well as experiments with fixed seed words. The fixed seed words are the ones used by Turney and Littman: 14 seed words {good, nice, excellent, positive, fortunate, correct, superior, bad, nasty, poor, negative, unfortunate, wrong, inferior}; 4 seed words {good, superior, bad, inferior}; 2 seed words {good, bad}. Table 1 shows the accuracy values of semantic orientation classification for four different sets of seed words and various networks. In the table, cv corresponds to the result of 10-fold cross validation, in which case we use the pseudo leave-one-out error for hyper-parameter estimation, while in other cases we use magnetization.",
"cite_spans": [],
"ref_spans": [
{
"start": 355,
"end": 362,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "5"
},
{
"text": "In most cases, the synonyms and the cooccurrence information from corpus improve accuracy. The only exception is the case of 2 seed words, in which G performs better than GT. One possible reason of this inversion is that the computation is trapped in a local optimum, since a small number of seed words leave a relatively large degree of freedom in the solution space, resulting in more local optimal points.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Classification Accuracy",
"sec_num": "5.1"
},
{
"text": "We compare our results with Turney and Table 2 : Actual best classification accuracy (%) with various networks and four different sets of seed words. In the parenthesis, the actual best value of \u03b2 is written, except for cv. seeds GTC GT G cv 91.5 (-) 91.5 (-) 87.0 (-) 14 81.9 (1.0) 80.2 (1.0) 76.2 (1.0) 4 74.4 (0.6) 74.4 (0.6) 65.3 (0.8) 2 75.2 (0.8) 61.9 (0.8) 67.5 (0.5)",
"cite_spans": [],
"ref_spans": [
{
"start": 39,
"end": 46,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Classification Accuracy",
"sec_num": "5.1"
},
{
"text": "Littman's results. With 14 seed words, they achieved 61.26% for a small corpus (approx. 1 \u00d7 10 7 words), 76.06% for a medium-sized corpus (approx. 2 \u00d7 10 9 words), 82.84% for a large corpus (approx. 1 \u00d7 10 11 words). Without a corpus nor a thesaurus (but with glosses in a dictionary), we obtained accuracy that is comparable to Turney and Littman's with a medium-sized corpus. When we enhance the lexical network with corpus and thesaurus, our result is comparable to Turney and Littman's with a large corpus.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Classification Accuracy",
"sec_num": "5.1"
},
{
"text": "We examine how accurately our prediction method for \u03b2 works by comparing Table 1 above and Table 2 below. Our method predicts good \u03b2 quite well especially for 14 seed words. For small numbers of seed words, our method using magnetization tends to predict a little larger value.",
"cite_spans": [],
"ref_spans": [
{
"start": 73,
"end": 98,
"text": "Table 1 above and Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Prediction of \u03b2",
"sec_num": "5.2"
},
{
"text": "We also display the figure of magnetization and accuracy in Figure 1 . We can see that the sharp change of magnetization occurs at around \u03b2 = 1.0 (phrase transition). At almost the same point, the classification accuracy reaches the peak.",
"cite_spans": [],
"ref_spans": [
{
"start": 60,
"end": 68,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Prediction of \u03b2",
"sec_num": "5.2"
},
{
"text": "We next evaluate the proposed method in terms of precision for the words that are classified with high confidence. We regard the absolute value of each average as a confidence measure and evaluate the top words with the highest absolute values of averages. The result of this experiment is shown in Figure 2 , for 14 seed words as an example. The top 1000 words achieved more than 92% accuracy. This result shows that the absolute value of each average ",
"cite_spans": [],
"ref_spans": [
{
"start": 299,
"end": 307,
"text": "Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Precision for the Words with High Confidence",
"sec_num": "5.3"
},
{
"text": "In order to further investigate the model, we conduct experiments in restricted settings. We first construct a lexical network using only synonyms. We compare the spin model with the shortest-path method proposed by Kamps et al. (2004) on this network, because the shortestpath method cannot incorporate negative links of antonyms. We also restrict the test data to 697 adjectives, which is the number of examples that the shortest-path method can assign a non-zero orientation value. Since the shortest-path method is designed for 2 seed words, the method is extended to use the average shortest-path lengths for 4 seed words and 14 seed words. Table 3 shows the result. Since the only difference is their algorithms, we can conclude that the global optimization of the spin model works well for the semantic orientation extraction.",
"cite_spans": [
{
"start": 216,
"end": 235,
"text": "Kamps et al. (2004)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [
{
"start": 646,
"end": 653,
"text": "Table 3",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Comparison with other methods",
"sec_num": "5.4"
},
{
"text": "We next compare the proposed method with a simple bootstrapping method proposed by Hu and Liu (2004) . We construct a lexical network using synonyms and antonyms. We restrict the test data to 1470 adjectives for comparison of methods. The result in Table 4 also shows that the global optimization of the spin model works well for the semantic orientation extraction.",
"cite_spans": [
{
"start": 83,
"end": 100,
"text": "Hu and Liu (2004)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [
{
"start": 249,
"end": 256,
"text": "Table 4",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "Comparison with other methods",
"sec_num": "5.4"
},
{
"text": "We also tested the shortest path method and the bootstrapping method on GTC and GT, and obtained low accuracies as expected in the discussion in Section 4.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with other methods",
"sec_num": "5.4"
},
{
"text": "We investigated a number of errors and concluded that there were mainly three types of errors.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Error Analysis",
"sec_num": "5.5"
},
{
"text": "One is the ambiguity of word senses. For example, one of the glosses of \"costly\"is \"entailing great loss or sacrifice\". The word \"great\" here means \"large\", although it usually means \"outstanding\" and is positively oriented.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Error Analysis",
"sec_num": "5.5"
},
{
"text": "Another is lack of structural information. For example, \"arrogance\" means \"overbearing pride evidenced by a superior manner toward the weak\". Although \"arrogance\" is mistakingly predicted as positive due to the word \"superior\", what is superior here is \"manner\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Error Analysis",
"sec_num": "5.5"
},
{
"text": "The last one is idiomatic expressions. For example, although \"brag\" means \"show off\", neither of \"show\" and \"off\" has the negative orientation. Idiomatic expressions often does not inherit the semantic orientation from or to the words in the gloss.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Error Analysis",
"sec_num": "5.5"
},
{
"text": "The current model cannot deal with these types of errors. We leave their solutions as future work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Error Analysis",
"sec_num": "5.5"
},
{
"text": "We proposed a method for extracting semantic orientations of words. In the proposed method, we regarded semantic orientations as spins of electrons, and used the mean field approximation to compute the approximate probability function of the system instead of the intractable actual probability function. We succeeded in extracting semantic orientations with high accuracy, even when only a small number of seed words are available.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "6"
},
{
"text": "There are a number of directions for future work. One is the incorporation of syntactic information. Since the importance of each word consisting a gloss depends on its syntactic role. syntactic information in glosses should be useful for classification.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "6"
},
{
"text": "Another is active learning. To decrease the amount of manual tagging for seed words, an active learning scheme is desired, in which a small number of good seed words are automatically selected.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "6"
},
{
"text": "Although our model can easily extended to a multi-state model, the effectiveness of using such a multi-state model has not been shown yet. Our model uses only the tendency of having the same orientation. Therefore we can extract semantic orientations of new words that are not listed in a dictionary. The validation of such extension will widen the possibility of application of our method.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "6"
},
{
"text": "Larger corpora such as web data will improve performance. The combination of our method and the method by Turney and Littman (2003) is promising.",
"cite_spans": [
{
"start": 106,
"end": 131,
"text": "Turney and Littman (2003)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "6"
},
{
"text": "Finally, we believe that the proposed model is applicable to other tasks in computational linguistics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "6"
},
{
"text": "Although we preprocessed in the same way as Turney and Littman, there is a slight difference between their dataset and our dataset. However, we believe this difference is insignificant.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "A maximum entropy approach to natural language processing",
"authors": [
{
"first": "Adam",
"middle": [
"L"
],
"last": "Berger",
"suffix": ""
},
{
"first": "Stephen",
"middle": [
"Della"
],
"last": "Pietra",
"suffix": ""
},
{
"first": "Vincent",
"middle": [
"J Della"
],
"last": "Pietra",
"suffix": ""
}
],
"year": 1996,
"venue": "Computational Linguistics",
"volume": "22",
"issue": "1",
"pages": "39--71",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Adam L. Berger, Stephen Della Pietra, and Vincent J. Della Pietra. 1996. A maximum entropy approach to natural language processing. Computational Lin- guistics, 22(1):39-71.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Introduction to Modern Statistical Mechanics",
"authors": [
{
"first": "David",
"middle": [],
"last": "Chandler",
"suffix": ""
}
],
"year": 1987,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Chandler. 1987. Introduction to Modern Statisti- cal Mechanics. Oxford University Press.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Lexical disambiguation using simulated annealing",
"authors": [
{
"first": "Jim",
"middle": [],
"last": "Cowie",
"suffix": ""
},
{
"first": "Joe",
"middle": [],
"last": "Guthrie",
"suffix": ""
},
{
"first": "Louise",
"middle": [],
"last": "Guthrie",
"suffix": ""
}
],
"year": 1992,
"venue": "Proceedings of the 14th conference on Computational linguistics",
"volume": "1",
"issue": "",
"pages": "359--365",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jim Cowie, Joe Guthrie, and Louise Guthrie. 1992. Lexi- cal disambiguation using simulated annealing. In Pro- ceedings of the 14th conference on Computational lin- guistics, volume 1, pages 359-365.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "WordNet: An Electronic Lexical Database, Language, Speech, and Communication Series",
"authors": [
{
"first": "Christiane",
"middle": [],
"last": "Fellbaum",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christiane Fellbaum. 1998. WordNet: An Electronic Lexical Database, Language, Speech, and Communi- cation Series. MIT Press.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Stochastic relaxation, gibbs distributions, and the bayesian restoration of images",
"authors": [
{
"first": "Stuart",
"middle": [],
"last": "Geman",
"suffix": ""
},
{
"first": "Donald",
"middle": [],
"last": "Geman",
"suffix": ""
}
],
"year": 1984,
"venue": "IEEE Transactions on Pattern Analysis and Machine Intelligence",
"volume": "6",
"issue": "",
"pages": "721--741",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stuart Geman and Donald Geman. 1984. Stochastic re- laxation, gibbs distributions, and the bayesian restora- tion of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6:721-741.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Predicting the semantic orientation of adjectives",
"authors": [
{
"first": "Vasileios",
"middle": [],
"last": "Hatzivassiloglou",
"suffix": ""
},
{
"first": "Kathleen",
"middle": [
"R"
],
"last": "Mckeown",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceedings of the Thirty-Fifth Annual Meeting of the Association for Computational Linguistics and the Eighth Conference of the European Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "174--181",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vasileios Hatzivassiloglou and Kathleen R. McKeown. 1997. Predicting the semantic orientation of adjec- tives. In Proceedings of the Thirty-Fifth Annual Meet- ing of the Association for Computational Linguistics and the Eighth Conference of the European Chapter of the Association for Computational Linguistics, pages 174-181.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Mining and summarizing customer reviews",
"authors": [
{
"first": "Minqing",
"middle": [],
"last": "Hu",
"suffix": ""
},
{
"first": "Bing",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining (KDD-2004)",
"volume": "",
"issue": "",
"pages": "168--177",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Minqing Hu and Bing Liu. 2004. Mining and summa- rizing customer reviews. In Proceedings of the 2004 ACM SIGKDD international conference on Knowl- edge discovery and data mining (KDD-2004), pages 168-177.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "The nishimori line and bayesian statistics",
"authors": [
{
"first": "Yukito",
"middle": [],
"last": "Iba",
"suffix": ""
}
],
"year": 1999,
"venue": "Journal of Physics A: Mathematical and General",
"volume": "",
"issue": "",
"pages": "3875--3888",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yukito Iba. 1999. The nishimori line and bayesian statis- tics. Journal of Physics A: Mathematical and General, pages 3875-3888.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Image restoration using the q-ising spin glass",
"authors": [
{
"first": "Junichi",
"middle": [],
"last": "Inoue",
"suffix": ""
},
{
"first": "Domenico",
"middle": [
"M"
],
"last": "Carlucci",
"suffix": ""
}
],
"year": 2001,
"venue": "Physical Review E",
"volume": "64",
"issue": "",
"pages": "36121--36122",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Junichi Inoue and Domenico M. Carlucci. 2001. Image restoration using the q-ising spin glass. Physical Re- view E, 64:036121-1 -036121-18.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Using wordnet to measure semantic orientation of adjectives",
"authors": [
{
"first": "Jaap",
"middle": [],
"last": "Kamps",
"suffix": ""
},
{
"first": "Maarten",
"middle": [],
"last": "Marx",
"suffix": ""
},
{
"first": "Robert",
"middle": [
"J"
],
"last": "Mokken",
"suffix": ""
},
{
"first": "Maarten",
"middle": [],
"last": "De Rijke",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the 4th International Conference on Language Resources and Evaluation",
"volume": "IV",
"issue": "",
"pages": "1115--1118",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jaap Kamps, Maarten Marx, Robert J. Mokken, and Maarten de Rijke. 2004. Using wordnet to mea- sure semantic orientation of adjectives. In Proceed- ings of the 4th International Conference on Language Resources and Evaluation (LREC 2004), volume IV, pages 1115-1118.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Dictionary-based acquisition of the lexical knowledge for p/n analysis",
"authors": [
{
"first": "Nozomi",
"middle": [],
"last": "Kobayashi",
"suffix": ""
},
{
"first": "Takashi",
"middle": [],
"last": "Inui",
"suffix": ""
},
{
"first": "Kentaro",
"middle": [],
"last": "Inui",
"suffix": ""
}
],
"year": 2001,
"venue": "Proceedings of Japanese Society for Artificial Intelligence, SLUD-33",
"volume": "",
"issue": "",
"pages": "45--50",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nozomi Kobayashi, Takashi Inui, and Kentaro Inui. 2001. Dictionary-based acquisition of the lexical knowledge for p/n analysis (in Japanese). In Pro- ceedings of Japanese Society for Artificial Intelligence, SLUD-33, pages 45-50.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Information Theory, Inference and Learning Algorithms",
"authors": [
{
"first": "J",
"middle": [
"C"
],
"last": "David",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mackay",
"suffix": ""
}
],
"year": 2003,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David J. C. Mackay. 2003. Information Theory, Infer- ence and Learning Algorithms. Cambridge University Press.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Optimal bayesian estimators for image segmentation and surface reconstruction",
"authors": [
{
"first": "Jose",
"middle": [
"L"
],
"last": "Marroquin",
"suffix": ""
}
],
"year": 1985,
"venue": "Technical Report A.I. Memo",
"volume": "839",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jose L. Marroquin. 1985. Optimal bayesian estima- tors for image segmentation and surface reconstruc- tion. Technical Report A.I. Memo 839, Massachusetts Institute of Technology.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Learning subjective nouns using extraction pattern bootstrapping",
"authors": [
{
"first": "Ellen",
"middle": [],
"last": "Riloff",
"suffix": ""
},
{
"first": "Janyce",
"middle": [],
"last": "Wiebe",
"suffix": ""
},
{
"first": "Theresa",
"middle": [],
"last": "Wilson",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the Seventh Conference on Natural Language Learning (CoNLL-03)",
"volume": "",
"issue": "",
"pages": "25--32",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ellen Riloff, Janyce Wiebe, and Theresa Wilson. 2003. Learning subjective nouns using extraction pattern bootstrapping. In Proceedings of the Seventh Con- ference on Natural Language Learning (CoNLL-03), pages 25-32.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Probabilistic part-of-speech tagging using decision trees",
"authors": [
{
"first": "Helmut",
"middle": [],
"last": "Schmid",
"suffix": ""
}
],
"year": 1994,
"venue": "Proceedings of International Conference on New Methods in Language Processing",
"volume": "",
"issue": "",
"pages": "44--49",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Helmut Schmid. 1994. Probabilistic part-of-speech tag- ging using decision trees. In Proceedings of Interna- tional Conference on New Methods in Language Pro- cessing, pages 44-49.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "The General Inquirer: A Computer Approach to Content Analysis",
"authors": [
{
"first": "Philip",
"middle": [
"J"
],
"last": "Stone",
"suffix": ""
},
{
"first": "Dexter",
"middle": [
"C"
],
"last": "Dunphy",
"suffix": ""
},
{
"first": "Marshall",
"middle": [
"S"
],
"last": "Smith",
"suffix": ""
},
{
"first": "Daniel",
"middle": [
"M"
],
"last": "Ogilvie",
"suffix": ""
}
],
"year": 1966,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philip J. Stone, Dexter C. Dunphy, Marshall S. Smith, and Daniel M. Ogilvie. 1966. The General Inquirer: A Computer Approach to Content Analysis. The MIT Press.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Probabilistic image processing by means of the bethe approximation for the q-ising model",
"authors": [
{
"first": "Kazuyuki",
"middle": [],
"last": "Tanaka",
"suffix": ""
},
{
"first": "Junichi",
"middle": [],
"last": "Inoue",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Titterington",
"suffix": ""
}
],
"year": 2003,
"venue": "Journal of Physics A: Mathematical and General",
"volume": "36",
"issue": "",
"pages": "11023--11035",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kazuyuki Tanaka, Junichi Inoue, and Mike Titterington. 2003. Probabilistic image processing by means of the bethe approximation for the q-ising model. Journal of Physics A: Mathematical and General, 36:11023- 11035.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Measuring praise and criticism: Inference of semantic orientation from association",
"authors": [
{
"first": "D",
"middle": [],
"last": "Peter",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"L"
],
"last": "Turney",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Littman",
"suffix": ""
}
],
"year": 2003,
"venue": "ACM Transactions on Information Systems",
"volume": "21",
"issue": "4",
"pages": "315--346",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter D. Turney and Michael L. Littman. 2003. Measur- ing praise and criticism: Inference of semantic orien- tation from association. ACM Transactions on Infor- mation Systems, 21(4):315-346.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Word sense disambiguation with very large neural networks extracted from machine readable dictionaries",
"authors": [
{
"first": "Jean",
"middle": [],
"last": "Veronis",
"suffix": ""
},
{
"first": "Nancy",
"middle": [
"M"
],
"last": "Ide",
"suffix": ""
}
],
"year": 1990,
"venue": "Proceedings of the 13th Conference on Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "389--394",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jean Veronis and Nancy M. Ide. 1990. Word sense dis- ambiguation with very large neural networks extracted from machine readable dictionaries. In Proceedings of the 13th Conference on Computational Linguistics, volume 2, pages 389-394.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Learning subjective adjectives from corpora",
"authors": [
{
"first": "M",
"middle": [],
"last": "Janyce",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Wiebe",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000)",
"volume": "",
"issue": "",
"pages": "735--740",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Janyce M. Wiebe. 2000. Learning subjective adjec- tives from corpora. In Proceedings of the 17th Na- tional Conference on Artificial Intelligence (AAAI- 2000), pages 735-740.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"type_str": "figure",
"text": "Precision (%) with 14 seed words.",
"num": null
},
"TABREF1": {
"content": "<table><tr><td colspan=\"3\">: Precision (%) for selected adjectives.</td></tr><tr><td colspan=\"3\">Comparison between the proposed method and the</td></tr><tr><td colspan=\"2\">shortest-path method.</td><td/></tr><tr><td colspan=\"3\">seeds proposed short. path</td></tr><tr><td>14</td><td>73.4 (1.0)</td><td>70.8</td></tr><tr><td>4</td><td>71.0 (1.0)</td><td>64.9</td></tr><tr><td>2</td><td>68.2 (1.0)</td><td>66.0</td></tr></table>",
"text": "",
"html": null,
"num": null,
"type_str": "table"
},
"TABREF2": {
"content": "<table><tr><td colspan=\"3\">: Precision (%) for adjectives. Comparison</td></tr><tr><td colspan=\"3\">between the proposed method and the bootstrapping</td></tr><tr><td>method.</td><td/><td/></tr><tr><td colspan=\"3\">seeds proposed bootstrap</td></tr><tr><td>14</td><td>83.6 (0.8)</td><td>72.8</td></tr><tr><td>4</td><td>82.3 (0.9)</td><td>73.2</td></tr><tr><td>2</td><td>83.5 (0.7)</td><td>71.1</td></tr><tr><td colspan=\"3\">can work as a confidence measure of classification.</td></tr></table>",
"text": "",
"html": null,
"num": null,
"type_str": "table"
}
}
}
} |