File size: 94,833 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 | {
"paper_id": "P01-1046",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:29:51.859881Z"
},
"title": "Evaluating Smoothing Algorithms against Plausibility Judgements",
"authors": [
{
"first": "Maria",
"middle": [],
"last": "Lapata",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Saarland University",
"location": {
"postBox": "PO Box 15 11 50",
"postCode": "66041",
"settlement": "Saarbr\u00fccken",
"country": "Germany"
}
},
"email": ""
},
{
"first": "Frank",
"middle": [],
"last": "Keller",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Saarland University",
"location": {
"postBox": "PO Box 15 11 50",
"postCode": "66041",
"settlement": "Saarbr\u00fccken",
"country": "Germany"
}
},
"email": "keller@coli.uni-sb.de"
},
{
"first": "Scott",
"middle": [],
"last": "Mcdonald",
"suffix": "",
"affiliation": {
"laboratory": "Language Technology Group",
"institution": "University of Edinburgh",
"location": {
"addrLine": "2 Buccleuch Place Edinburgh",
"postCode": "EH8 9LW",
"country": "UK"
}
},
"email": "scottm@cogsci.ed.ac.uk"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Previous research has shown that the plausibility of an adjective-noun combination is correlated with its corpus co-occurrence frequency. In this paper, we estimate the co-occurrence frequencies of adjective-noun pairs that fail to occur in a 100 million word corpus using smoothing techniques and compare them to human plausibility ratings. Both class-based smoothing and distance-weighted averaging yield frequency estimates that are significant predictors of rated plausibility, which provides independent evidence for the validity of these smoothing techniques.",
"pdf_parse": {
"paper_id": "P01-1046",
"_pdf_hash": "",
"abstract": [
{
"text": "Previous research has shown that the plausibility of an adjective-noun combination is correlated with its corpus co-occurrence frequency. In this paper, we estimate the co-occurrence frequencies of adjective-noun pairs that fail to occur in a 100 million word corpus using smoothing techniques and compare them to human plausibility ratings. Both class-based smoothing and distance-weighted averaging yield frequency estimates that are significant predictors of rated plausibility, which provides independent evidence for the validity of these smoothing techniques.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Certain combinations of adjectives and nouns are perceived as more plausible than others. A classical example is strong tea, which is highly plausible, as opposed to powerful tea, which is not. On the other hand, powerful car is highly plausible, whereas strong car is less plausible. It has been argued in the theoretical literature that the plausibility of an adjective-noun pair is largely a collocational (i.e., idiosyncratic) property, in contrast to verb-object or noun-noun plausibility, which is more predictable (Cruse, 1986; Smadja, 1991) .",
"cite_spans": [
{
"start": 521,
"end": 534,
"text": "(Cruse, 1986;",
"ref_id": "BIBREF6"
},
{
"start": 535,
"end": 548,
"text": "Smadja, 1991)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The collocational hypothesis has recently been investigated in a corpus study by Lapata et al. (1999) . This study investigated potential statistical predictors of adjective-noun plausibility by using correlation analysis to compare judgements elicited from human subjects with five corpus-derived measures: co-occurrence frequency of the adjective-noun pair, noun frequency, conditional probability of the noun given the adjective, the log-likelihood ratio, and Resnik's (1993) selectional association measure. All predictors but one were positively correlated with plausibility; the highest correlation was obtained with co-occurrence frequency. Resnik's selectional association measure surprisingly yielded a significant negative correlation with judged plausibility. These results suggest that the best predictor of whether an adjective-noun combination is plausible or not is simply how often the adjective and the noun collocate in a record of language experience.",
"cite_spans": [
{
"start": 81,
"end": 101,
"text": "Lapata et al. (1999)",
"ref_id": "BIBREF11"
},
{
"start": 463,
"end": 478,
"text": "Resnik's (1993)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "As a predictor of plausibility, co-occurrence frequency has the obvious limitation that it cannot be applied to adjective-noun pairs that never occur in the corpus. A zero co-occurrence count might be due to insufficient evidence or might reflect the fact that the adjective-noun pair is inherently implausible. In the present paper, we address this problem by using smoothing techniques (distance-weighted averaging and class-based smoothing) to recreate missing co-occurrence counts, which we then compare to plausibility judgements elicited from human subjects. By demonstrating a correlation between recreated frequencies and plausibility judgements, we show that these smoothing methods produce realistic frequency estimates for missing co-occurrence data. This approach allows us to establish the validity of smoothing methods independent from a specific natural language processing task.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Smoothing techniques have been used in a variety of statistical natural language processing applications as a means to address data sparseness, an inherent problem for statistical methods which rely on the relative frequencies of word combinations. The problem arises when the probability of word combinations that do not occur in the training data needs to be estimated. The smoothing methods proposed in the literature (overviews are provided by Dagan et al. (1999) and Lee (1999)) can be generally divided into three types: discounting (Katz, 1987) , class-based smoothing (Resnik, 1993; Brown et al., 1992; Pereira et al., 1993) , and distance-weighted averaging (Grishman and Sterling, 1994; Dagan et al., 1999) .",
"cite_spans": [
{
"start": 448,
"end": 467,
"text": "Dagan et al. (1999)",
"ref_id": "BIBREF7"
},
{
"start": 539,
"end": 551,
"text": "(Katz, 1987)",
"ref_id": "BIBREF9"
},
{
"start": 576,
"end": 590,
"text": "(Resnik, 1993;",
"ref_id": "BIBREF17"
},
{
"start": 591,
"end": 610,
"text": "Brown et al., 1992;",
"ref_id": "BIBREF1"
},
{
"start": 611,
"end": 632,
"text": "Pereira et al., 1993)",
"ref_id": "BIBREF16"
},
{
"start": 667,
"end": 696,
"text": "(Grishman and Sterling, 1994;",
"ref_id": "BIBREF8"
},
{
"start": 697,
"end": 716,
"text": "Dagan et al., 1999)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Smoothing Methods",
"sec_num": "2"
},
{
"text": "Discounting methods decrease the probability of previously seen events so that the total probability of observed word co-occurrences is less than one, leaving some probability mass to be redistributed among unseen co-occurrences.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Smoothing Methods",
"sec_num": "2"
},
{
"text": "Class-based smoothing and distance-weighted averaging both rely on an intuitively simple idea: inter-word dependencies are modelled by relying on the corpus evidence available for words that are similar to the words of interest. The two approaches differ in the way they measure word similarity. Distance-weighted averaging estimates word similarity from lexical co-occurrence information, viz., it finds similar words by taking into account the linguistic contexts in which they occur: two words are similar if they occur in similar contexts. In class-based smoothing, classes are used as the basis according to which the cooccurrence probability of unseen word combinations is estimated. Classes can be induced directly from the corpus (Pereira et al., 1993; Brown et al., 1992) or taken from a manually crafted taxonomy (Resnik, 1993) . In the latter case the taxonomy is used to provide a mapping from words to conceptual classes.",
"cite_spans": [
{
"start": 738,
"end": 760,
"text": "(Pereira et al., 1993;",
"ref_id": "BIBREF16"
},
{
"start": 761,
"end": 780,
"text": "Brown et al., 1992)",
"ref_id": "BIBREF1"
},
{
"start": 823,
"end": 837,
"text": "(Resnik, 1993)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Smoothing Methods",
"sec_num": "2"
},
{
"text": "In language modelling, smoothing techniques are typically evaluated by showing that a language model which uses smoothed estimates incurs a reduction in perplexity on test data over a model that does not employ smoothed estimates (Katz, 1987) . Dagan et al. (1999) use perplexity to compare back-off smoothing against distanceweighted averaging methods and show that the latter outperform the former. They also compare different distance-weighted averaging methods on a pseudo-word disambiguation task where the language model decides which of two verbs v 1 and v 2 is more likely to take a noun n as its object. The method being tested must reconstruct which of the unseen (v 1 , n) and (v 2 , n) is a valid verb-object combination.",
"cite_spans": [
{
"start": 230,
"end": 242,
"text": "(Katz, 1987)",
"ref_id": "BIBREF9"
},
{
"start": 245,
"end": 264,
"text": "Dagan et al. (1999)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Smoothing Methods",
"sec_num": "2"
},
{
"text": "In our experiments we recreated co-occurrence frequencies for unseen adjective-noun pairs using two different approaches: taxonomic class-based smoothing and distance-weighted averaging. 1 We evaluated the recreated frequencies by comparing them with plausibility judgements elicited from human subjects. In contrast to previous work, this type of evaluation does not presuppose that the recreated frequencies are needed for a specific natural language processing task. Rather, our aim is to establish an independent criterion for the validity of smoothing techniques by comparing them to plausibility judgements, which are known to correlate with co-occurrence frequency (Lapata et al., 1999) .",
"cite_spans": [
{
"start": 187,
"end": 188,
"text": "1",
"ref_id": null
},
{
"start": 672,
"end": 693,
"text": "(Lapata et al., 1999)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Smoothing Methods",
"sec_num": "2"
},
{
"text": "In the remainder of this paper we present class-1 Discounting methods were not included as Dagan et al. (1999) demonstrated that distance-weighted averaging achieves better language modelling performance than back-off. based smoothing and distance-weighted averaging as applied to unseen adjective-noun combinations (see Sections 2.1 and 2.2). Section 3 details our judgement elicitation experiment and reports our results.",
"cite_spans": [
{
"start": 91,
"end": 110,
"text": "Dagan et al. (1999)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Smoothing Methods",
"sec_num": "2"
},
{
"text": "We recreated co-occurrence frequencies for unseen adjective-noun pairs using a simplified version of Resnik's (1993) selectional association measure. Selectional association is defined as the amount of information a given predicate carries about its argument, where the argument is represented by its corresponding classes in a taxonomy such as WordNet (Miller et al., 1990) . This means that predicates which impose few restrictions on their arguments have low selectional association values, whereas predicates selecting for a restricted number of arguments have high selectional association values. Consider the verbs see and polymerise: intuitively there is a great variety of things which can be seen, whereas there is a very specific set of things which can be polymerised (e.g., ethylene). Resnik demonstrated that his measure of selectional association successfully captures this intuition: selectional association values are correlated with verbargument plausibility as judged by native speakers.",
"cite_spans": [
{
"start": 353,
"end": 374,
"text": "(Miller et al., 1990)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Class-based Smoothing",
"sec_num": "2.1"
},
{
"text": "However, Lapata et al. (1999) found that the success of selectional association as a predictor of plausibility does not seem to carry over to adjective-noun plausibility. There are two potential reasons for this: (1) the semantic restrictions that adjectives impose on the nouns with which they combine appear to be less strict than the ones imposed by verbs (consider the adjective superb which can combine with nearly any noun); and (2) given their lexicalist nature, adjectivenoun combinations may defy selectional restrictions yet be intuitively plausible (consider the pair sad day, where sadness is not an attribute of day).",
"cite_spans": [
{
"start": 9,
"end": 29,
"text": "Lapata et al. (1999)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Class-based Smoothing",
"sec_num": "2.1"
},
{
"text": "To address these problems, we replaced Resnik's information-theoretic measure with a simpler measure which makes no assumptions with respect to the contribution of a semantic class to the total quantity of information provided by the predicate about the semantic classes of its argument. We simply substitute the noun occurring in the adjective-noun combination with the concept by which it is represented in the taxonomy and estimate the adjective-noun cooccurrence frequency by counting the number of times the concept corresponding to the noun is observed to co-occur with the adjective in the corpus. Because a given word is not always represented by a single class in the taxonomy (i.e., the Table 1 : Frequency estimation for proud chief using WordNet noun co-occurring with an adjective can generally be the realisation of one of several conceptual classes), we constructed the frequency counts for an adjective-noun pair for each conceptual class by dividing the contribution from the adjective by the number of classes to which it belongs (Lauer, 1995; Resnik, 1993) :",
"cite_spans": [
{
"start": 1048,
"end": 1061,
"text": "(Lauer, 1995;",
"ref_id": "BIBREF13"
},
{
"start": 1062,
"end": 1075,
"text": "Resnik, 1993)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [
{
"start": 697,
"end": 704,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Class-based Smoothing",
"sec_num": "2.1"
},
{
"text": "f (a, c) \u2248 \u2211 n \u2208c f (a, n ) |classes(n )| (1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Class-based Smoothing",
"sec_num": "2.1"
},
{
"text": "where f (a, n ) is the number of times the adjective a was observed in the corpus with concept c \u2208 classes(n ) and |classes(n )| is the number of conceptual classes noun n belongs to. Note that the estimation of the frequency f (a, c) relies on the simplifying assumption that the noun cooccurring with the adjective is distributed evenly across its conceptual classes. This simplification is necessary unless we have a corpus of adjectivenoun pairs labelled explicitly with taxonomic information. 2 Consider the pair proud chief which is not attested in the British National Corpus (BNC) (Burnard, 1995) . The word chief has two senses in WordNet and belongs to seven conceptual classes ( causal agent , entity , leader , life form , person , superior , and supervisor ) This means that the cooccurrence frequency of the adjective-noun pair will be constructed for each of the seven classes, as shown in Table 1 . Suppose for example that we see the pair proud leader in the corpus. The word leader has two senses in WordNet and belongs to eight conceptual classes ( person , life from , entity , causal agent , feature , merchandise , commodity , and object ). The words chief and leader have four conceptual classes in common, i.e., person and life form , entity , and causal agent . This means that we will increment the observed co-occurrence count of proud and person , proud and life form , proud and entity , and proud and causal agent by 1 8 . Since we do not know the actual class of the noun chief in the corpus, we weight the contribution of each class by taking the average of the constructed frequencies for all seven classes:",
"cite_spans": [
{
"start": 498,
"end": 499,
"text": "2",
"ref_id": null
},
{
"start": 589,
"end": 604,
"text": "(Burnard, 1995)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [
{
"start": 905,
"end": 912,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Class-based Smoothing",
"sec_num": "2.1"
},
{
"text": "f (a, n) = \u2211 c\u2208classes(n) \u2211 n \u2208c f (a,n ) |classes(n )| |classes(n)| (2)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Class-based Smoothing",
"sec_num": "2.1"
},
{
"text": "Based on (2) the recreated frequency for the pair proud chief in the BNC is 6.12 (see Table 1 ).",
"cite_spans": [],
"ref_spans": [
{
"start": 86,
"end": 93,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Class-based Smoothing",
"sec_num": "2.1"
},
{
"text": "Distance-weighted averaging induces classes of similar words from word co-occurrences without making reference to a taxonomy. A key feature of this type of smoothing is the function which measures distributional similarity from cooccurrence frequencies. Several measures of distributional similarity have been proposed in the literature (Dagan et al., 1999; Lee, 1999) . We used two measures, the Jensen-Shannon divergence and the confusion probability. Those two measures have been previously shown to give promising performance for the task of estimating the frequencies of unseen verb-argument pairs (Dagan et al., 1999; Grishman and Sterling, 1994; Lapata, 2000; Lee, 1999) . In the following we describe these two similarity measures and show how they can be used to recreate the frequencies for unseen adjective-noun pairs.",
"cite_spans": [
{
"start": 337,
"end": 357,
"text": "(Dagan et al., 1999;",
"ref_id": "BIBREF7"
},
{
"start": 358,
"end": 368,
"text": "Lee, 1999)",
"ref_id": "BIBREF14"
},
{
"start": 603,
"end": 623,
"text": "(Dagan et al., 1999;",
"ref_id": "BIBREF7"
},
{
"start": 624,
"end": 652,
"text": "Grishman and Sterling, 1994;",
"ref_id": "BIBREF8"
},
{
"start": 653,
"end": 666,
"text": "Lapata, 2000;",
"ref_id": "BIBREF12"
},
{
"start": 667,
"end": 677,
"text": "Lee, 1999)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "Jensen-Shannon Divergence. The Jensen-Shannon divergence is an information-theoretic measure that recasts the concept of distributional similarity into a measure of the \"distance\" (i.e., dissimilarity) between two probability distributions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "Let w 1 and w 1 be an unseen sequence of two words whose distributional similarity is to be determined. Let P(w 2 |w 1 ) denote the conditional probability of word w 2 given word w 1 and P(w 2 |w 1 ) denote the conditional probability of w 2 given w 1 . For notational simplicity we write p(w 2 ) for P(w 2 |w 1 ) and q(w 2 ) for P(w 2 |w 1 ). The Jensen-Shannon divergence is defined as the average Kullback-Leibler divergence of each of two distributions to their average distribution:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "J(p, q) = 1 2 D p p + q 2 + D q p + q 2 (3)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "where (p + q)/2 denotes the average distribution:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "1 2 P(w 2 |w 1 ) + P(w 2 |w 1 ) (4)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "The Kullback-Leibler divergence is an information-theoretic measure of the dissimilarity of two probability distributions p and q, defined as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "D(p||q) = \u2211 i p i log p i q i (5)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "In our case the distributions p and q are the conditional probability distributions P(w 2 |w 1 ) and P(w 2 |w 1 ), respectively. Computation of the Jensen-Shannon divergence depends only on the linguistic contexts w 2 which the two words w 1 and w 1 have in common. The Jensen-Shannon divergence, a dissimilarity measure, is transformed to a similarity measure as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "W J (p, q) = 10 \u2212\u03b2J(p,q) (6)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "The parameter \u03b2 controls the relative influence of the words most similar to w 1 : if \u03b2 is high, only words extremely similar to w 1 contribute to the estimate, whereas if \u03b2 is low, less similar words also contribute to the estimate.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "Confusion Probability. The confusion probability is an estimate of the probability that word w 1 can be substituted by word w 1 , in the sense of being found in the same linguistic contexts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "P c (w 1 |w 1 ) = \u2211 w 2 P(w 1 |w 2 )P(w 2 |w 1 ) (7)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "where P c (w 1 |w 1 ) is the probability that word w 1 occurs in the same contexts w 2 as word w 1 , averaged over these contexts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "Let w 2 w 1 be two unseen co-occurring words. We can estimate the conditional probability P(w 2 |w 1 ) of the unseen word pair w 2 w 1 by combining estimates for co-occurrences involving similar words:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "P SIM (w 2 |w 1 ) = \u2211 w 1 \u2208S(w 1 ) W (w 1 , w 1 ) N(w 1 ) P(w 2 |w 1 ) (8)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "where S(w 1 ) is the set of words most similar to w 1 , W (w 1 , w 1 ) is the similarity function between w 1 and w 1 , and N(w 1 ) is a normalising factor N(w 1 ) = \u2211 w 1 W (w 1 , w 1 ). The conditional probability P SIM (w 2 |w 1 ) can be trivially converted to co-occurrence frequency as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "f (w 1 , w 2 ) = P SIM (w 2 |w 1 ) f (w 1 ) (9)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "Parameter Settings. We experimented with two approaches to computing P(w 2 |w 1 ): (1) using the probability distribution P(n|a), which discovers similar adjectives and treats the noun as the context; and (2) using P(a|n), which discovers similar nouns and treats the adjective as the context. These conditional probabilities can be easily estimated from their relative frequency in the corpus as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "P(n|a) = f (a, n) f (a) P(a|n) = f (a, n) f (n) (10)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "The performance of distance-weighted averaging depends on two parameters: (1) the number of items over which the similarity function is computed (i.e., the size of the set S(w 1 ) denoting the set of words most similar to w 1 ), and (2) the Jensen- Shannon Confusion Probability proud chief proud chief young chairman lone venture old venture adverse chairman dying government grateful importance wealthy leader sole force lone official wealthy representative dead scientist elderly president rich manager registered official poor initiative dear manager elderly president deliberate director Table 2 : The ten most similar adjectives to proud and the ten most similar nouns to chief value of the parameter \u03b2 (which is only relevant for the Jensen-Shannon divergence). In this study we recreated adjective-noun frequencies using the 1,000 and 2,000 most frequent items (nouns and adjectives), for both the confusion probability and the Jensen-Shannon divergence. 3 Furthermore, we set \u03b2 to .5, which experiments showed to be the best value for this parameter.",
"cite_spans": [],
"ref_spans": [
{
"start": 249,
"end": 639,
"text": "Shannon Confusion Probability proud chief proud chief young chairman lone venture old venture adverse chairman dying government grateful importance wealthy leader sole force lone official wealthy representative dead scientist elderly president rich manager registered official poor initiative dear manager elderly president deliberate director Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "Once we know which words are most similar to the either the adjective or the noun (irrespective of the function used to measure similarity) we can exploit this information in order to recreate the co-occurrence frequency for unseen adjective-noun pairs. We use the weighted average of the evidence provided by the similar words, where the weight given to a word w 1 depends on its similarity to w 1 (see (8) and (9)). Table 2 shows the ten most similar adjectives to the word proud and then the ten most similar nouns to the word chief using the Jensen-Shannon divergence and the confusion probability. Here the similarity function was calculated over the 1,000 most frequent adjectives in the BNC.",
"cite_spans": [],
"ref_spans": [
{
"start": 418,
"end": 425,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Distance-Weighted Averaging",
"sec_num": "2.2"
},
{
"text": "In order to evaluate the smoothing methods introduced above, we first needed to establish an independent measure of plausibility. The standard approach used in experimental psycholinguistics is to elicit judgements from human subjects; in this section we describe our method for assembling the set of experimental materials and collecting plausibility ratings for these stimuli.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Collecting Plausibility Ratings",
"sec_num": "3"
},
{
"text": "Materials. We used a part-of-speech annotated, lemmatised version of the BNC. The BNC is a large, balanced corpus of British English, consisting of 90 million words of text and 10 million words of speech. Frequency information obtained Adjective Nouns hungry tradition innovation prey guilty system wisdom wartime temporary conception surgery statue naughty regime rival protocol Table 3 : Example stimuli for the plausibility judgement experiment from the BNC can be expected to be a reasonable approximation of the language experience of a British English speaker. The experiment used the same set of 30 adjectives discussed in Lapata et al. (1999) . These adjectives were chosen to be minimally ambiguous: each adjective had exactly two senses according to WordNet and was unambiguously tagged as 'adjective' 98.6% of the time, measured as the number of different part-of-speech tags assigned to the word in the BNC. For each adjective we obtained all the nouns (excluding proper nouns) with which it failed to co-occur in the BNC.",
"cite_spans": [
{
"start": 647,
"end": 667,
"text": "Lapata et al. (1999)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [
{
"start": 236,
"end": 404,
"text": "Adjective Nouns hungry tradition innovation prey guilty system wisdom wartime temporary conception surgery statue naughty regime rival protocol Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "We identified adjective-noun pairs by using Gsearch (Corley et al., 2001 ), a chart parser which detects syntactic patterns in a tagged corpus by exploiting a user-specified context free grammar and a syntactic query. From the syntactic analysis provided by the parser we extracted a table containing the adjective and the head of the noun phrase following it. In the case of compound nouns, we only included sequences of two nouns, and considered the rightmost occurring noun as the head. From the adjective-noun pairs obtained this way, we removed all pairs where the noun had a BNC frequency of less than 10 per million, in order to reduce the risk of plausibility ratings being influenced by the presence of a noun unfamiliar to the subjects. Each adjective was then paired with three randomly-chosen nouns from its list of non-co-occurring nouns. Example stimuli are shown in Table 3 .",
"cite_spans": [
{
"start": 52,
"end": 72,
"text": "(Corley et al., 2001",
"ref_id": "BIBREF4"
}
],
"ref_spans": [
{
"start": 881,
"end": 888,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "Procedure. The experimental paradigm was magnitude estimation (ME), a technique standardly used in psychophysics to measure judgements of sensory stimuli (Stevens, 1975) , which Bard et al. (1996) and Cowart (1997) have applied to the elicitation of linguistic judgements. The ME procedure requires subjects to estimate the magnitude of physical stimuli by assigning numerical values proportional to the stimulus magnitude they perceive. In contrast to the 5-or 7-point scale conventionally used to measure human intuitions, ME employs an interval scale, and therefore produces data for which parametric inferential statistics are valid.",
"cite_spans": [
{
"start": 154,
"end": 169,
"text": "(Stevens, 1975)",
"ref_id": "BIBREF19"
},
{
"start": 178,
"end": 196,
"text": "Bard et al. (1996)",
"ref_id": "BIBREF0"
},
{
"start": 201,
"end": 214,
"text": "Cowart (1997)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "ME requires subjects to assign numbers to a series of linguistic stimuli in a proportional Table 4 : Correlation matrix for plausibility and the five smoothed frequency estimates fashion. Subjects are first exposed to a modulus item, which they assign an arbitrary number. All other stimuli are rated proportional to the modulus. In this way, each subject can establish their own rating scale, thus yielding maximally finegraded data and avoiding the known problems with the conventional ordinal scales for linguistic data (Bard et al., 1996; Cowart, 1997; Sch\u00fctze, 1996) .",
"cite_spans": [
{
"start": 523,
"end": 542,
"text": "(Bard et al., 1996;",
"ref_id": "BIBREF0"
},
{
"start": 543,
"end": 556,
"text": "Cowart, 1997;",
"ref_id": "BIBREF5"
},
{
"start": 557,
"end": 571,
"text": "Sch\u00fctze, 1996)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [
{
"start": 91,
"end": 98,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "In the present experiment, subjects were presented with adjective-noun pairs and were asked to rate the degree of adjective-noun fit proportional to a modulus item. The experiment was carried out using WebExp, a set of Java-Classes for administering psycholinguistic studies over the World-Wide Web (Keller et al., 1998) . Subjects first saw a set of instructions that explained the ME technique and included some examples, and had to fill in a short questionnaire including basic demographic information. Each subject saw the entire set of 90 experimental items.",
"cite_spans": [
{
"start": 299,
"end": 320,
"text": "(Keller et al., 1998)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "Subjects. Forty-one native speakers of English volunteered to participate. Subjects were recruited over the Internet by postings to relevant newsgroups and mailing lists.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "Correlation analysis was used to assess the degree of linear relationship between plausibility ratings (Plaus) and the three smoothed co-occurrence frequency estimates: distance-weighted averaging using Jensen-Shannon divergence (Jen), distanceweighted averaging using confusion probability (Conf), and class-based smoothing using Word-Net (WN). For the two similarity-based measures, we smoothed either over the similarity of the adjective (subscript a) or over the similarity of the noun (subscript n). All frequency estimates were natural log-transformed. Table 4 displays the results of the correlation analysis. Mean plausibility ratings were significantly correlated with co-occurrence frequency recreated using our class-based smoothing method based on WordNet (r = .356, p < .01).",
"cite_spans": [],
"ref_spans": [
{
"start": 559,
"end": 566,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "3.2"
},
{
"text": "As detailed in Section 2.2, the Jensen-Shannon divergence and the confusion probability are pa-rameterised measures. There are two ways to smooth the frequency of an adjective-noun combination: over the distribution of adjectives or over the distribution of nouns. We tried both approaches and found a moderate correlation between plausibility and both the frequency recreated using distance-weighted averaging and confusion probability. The correlation was significant both for frequencies recreated by smoothing over adjectives (r = .214, p < .05) and over nouns (r = .232, p < .05) . However, co-occurrence frequency recreated using the Jensen-Shannon divergence was not reliably correlated with plausibility. Furthermore, there was a reliable correlation between the two Jensen-Shannon measures Jen a and Jen n (r = .781, p < .01), and similarly between the two confusion measures Conf a and Conf n (r = .864, p < .01). We also found a high correlation between Jen a and Conf a (r = .941, p < .01) and Jen n and Conf n (r = .956, p < .01). This indicates that the two similarity measures yield comparable results for the given task.",
"cite_spans": [
{
"start": 530,
"end": 549,
"text": "(r = .214, p < .05)",
"ref_id": null
},
{
"start": 565,
"end": 584,
"text": "(r = .232, p < .05)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "3.2"
},
{
"text": "We also examined the effect of varying one further parameter (see Section 2.2). The recreated frequencies were initially estimated using the n = 1, 000 most similar items. We examined the effects of applying the two smoothing methods using a set of similar items of twice the size (n = 2, 000). No improvement in terms of the correlations with rated plausibility was found when using this larger set, whether smoothing over the adjective or the noun: a moderate correlation with plausibility was found for Conf a (r = .239, p < .05) and Conf n (r = .239, p < .05), while the correlation with Jen a and Jen n was not significant.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "3.2"
},
{
"text": "An important question is how well people agree in their plausibility judgements. Inter-subject agreement gives an upper bound for the task and allows us to interpret how well the smoothing techniques are doing in relation to the human judges. We computed the inter-subject correlation on the elicited judgements using leave-one-out resampling (Weiss and Kulikowski, 1991) . Average inter-subject agreement was .55 (Min = .01, Max = .76, SD = .16). This means that our approach performs satisfactorily given that there is a fair amount of variability in human judgements of adjective-noun plausibility.",
"cite_spans": [
{
"start": 343,
"end": 371,
"text": "(Weiss and Kulikowski, 1991)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "3.2"
},
{
"text": "One remaining issue concerns the validity of our smoothing procedures. We have shown that co-occurrence frequencies recreated using smoothing techniques are significantly correlated with rated plausibility. But this finding constitutes only indirect evidence for the ability of this method to recreate corpus evidence; it depends on the assumption that plausibility and frequency are adequate indicators of each other's values. Does Table 5 : Correlation of recreated frequencies with actual frequencies and plausibility (using Lapata et al.'s (1999) stimuli) smoothing accurately recreate the co-occurrence frequency of combinations that actually do occur in the corpus? To address this question, we applied the class-based smoothing procedure to a set of adjective-noun pairs that occur in the corpus with varying frequencies, using the materials from Lapata et al. (1999) .",
"cite_spans": [
{
"start": 521,
"end": 559,
"text": "(using Lapata et al.'s (1999) stimuli)",
"ref_id": null
},
{
"start": 854,
"end": 874,
"text": "Lapata et al. (1999)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [
{
"start": 433,
"end": 440,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "3.2"
},
{
"text": "First, we removed all relevant adjective-noun combinations from the corpus. Effectively we assumed a linguistic environment with no evidence for the occurrence of the pair, and thus no evidence for any linguistic relationship between the adjective and the noun. Then we recreated the co-occurrence frequencies using classbased smoothing and distance-weighted averaging, and log-transformed the resulting frequencies. Both methods yielded reliable correlation between recreated frequency and actual BNC frequency (see Table 5 for details). This result provides additional evidence for the claim that these smoothing techniques produce reliable frequency estimates for unseen adjective-noun pairs. Note that the best correlations were achieved for Conf a and Conf n (r = .646, p < .01 and r = .728, p < .01, respectively).",
"cite_spans": [],
"ref_spans": [
{
"start": 517,
"end": 524,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "3.2"
},
{
"text": "Finally, we carried out a further test of the quality of the recreated frequencies by correlating them with the plausibility judgements reported by Lapata et al. (1999) . Again, a significant correlation was found for all methods (see Table 5 ). However, all correlations were lower than the correlation of the actual frequencies with plausibility (r = .570, p < .01) reported by Lapata et al. (1999) . Note also that the confusion probability outperformed Jensen-Shannon divergence, in line with our results on unfamiliar adjective-noun pairs. Lapata et al. (1999) demonstrated that the cooccurrence frequency of an adjective-noun combination is the best predictor of its rated plausibility. The present experiment extended this result to adjective-noun pairs that do not co-occur in the corpus.",
"cite_spans": [
{
"start": 148,
"end": 168,
"text": "Lapata et al. (1999)",
"ref_id": "BIBREF11"
},
{
"start": 380,
"end": 400,
"text": "Lapata et al. (1999)",
"ref_id": "BIBREF11"
},
{
"start": 545,
"end": 565,
"text": "Lapata et al. (1999)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [
{
"start": 235,
"end": 242,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "3.2"
},
{
"text": "We applied two smoothing techniques in order to recreate co-occurrence frequency and found that the class-based smoothing method was the best predictor of plausibility. This result is inter- guilty dangerous stop giant guilty dangerous stop giant interested certain moon company innocent different employment manufacturer injured particular length artist labour difficult detail industry socialist other page firm strange strange time star democratic similar potential master ruling various list army honest bad turn rival Table 6 : The ten most similar words to the adjectives guilty and dangerous and the nouns stop and giant discovered by the Jensen-Shannon measure esting because the class-based method does not use detailed knowledge about word-to-word relationships in real language; instead, it relies on the notion of equivalence classes derived from Word-Net, a semantic taxonomy. It appears that making predictions about plausibility is most effectively done by collapsing together the speaker's experience with other words in the semantic class occupied by the target word. The distance-weighted averaging smoothing methods yielded a lower correlation with plausibility (in the case of the confusion probability), or no correlation at all (in the case of the Jensen-Shannon divergence). The worse performance of distance-weighted averaging is probably due to the fact that this method conflates two kinds of distributional similarity: on the one hand, it generates words that are semantically similar to the target word. On the other hand, it also generates words whose syntactic behaviour is similar to that of the target word. Rated plausibility, however, seems to be more sensitive to semantic than to syntactic similarity.",
"cite_spans": [],
"ref_spans": [
{
"start": 191,
"end": 572,
"text": "guilty dangerous stop giant guilty dangerous stop giant interested certain moon company innocent different employment manufacturer injured particular length artist labour difficult detail industry socialist other page firm strange strange time star democratic similar potential master ruling various list army honest bad turn rival Table 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Discussion",
"sec_num": "3.3"
},
{
"text": "As an example refer to Table 6 , which displays the ten most distributionally similar words to the adjectives guilty and dangerous and to the nouns stop and giant discovered by the Jensen-Shannon measure. The set of similar words is far from semantically coherent. As far as the adjective guilty is concerned the measure discovered antonyms such as innocent and honest. Semantically unrelated adjectives such as injured, democratic, or interested are included; it seems that their syntactic behaviour is similar to that of guilty, e.g., they all co-occur with party. The same pattern can be observed for the adjective dangerous, to which none of the discovered adjectives are intuitively semantically related, perhaps with the exception of bad. The set of words most similar to the noun stop also does not appear to be semantically coherent.",
"cite_spans": [],
"ref_spans": [
{
"start": 23,
"end": 30,
"text": "Table 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Discussion",
"sec_num": "3.3"
},
{
"text": "This problem with distance-weighted averaging is aggravated by the fact that the adjective or noun that we smooth over can be polysemous.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "3.3"
},
{
"text": "Take the set of similar words for giant, for instance. The words company, manufacturer, industry and firm are similar to the 'enterprise' sense of giant, whereas artist, star, master are similar to the 'important/influential person' sense of giant. However, no similar word was found for either the 'beast' or 'heavyweight person' sense of giant. This illustrates that the distance-weighted averaging approach fails to take proper account of the polysemy of a word. The class-based approach, on the other hand, relies on WordNet, a lexical taxonomy that can be expected to cover most senses of a given lexical item.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "3.3"
},
{
"text": "Recall that distance-weighted averaging discovers distributionally similar words by looking at simple lexical co-occurrence information. In the case of adjective-noun pairs we concentrated on combinations found in the corpus in a head-modifier relationship. This limited form of surface-syntactic information does not seem to be sufficient to reproduce the detailed knowledge that people have about the semantic relationships between words. Our class-based smoothing method, on the other hand, relies on the semantic taxonomy of WordNet, where fine-grained conceptual knowledge about words and their relations is encoded. This knowledge can be used to create semantically coherent equivalence classes. Such classes will not contain antonyms or items whose behaviour is syntactically related, but not semantically similar, to the words of interest.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "3.3"
},
{
"text": "To summarise, it appears that distanceweighted averaging smoothing is only partially successful in reproducing the linguistic dependencies that characterise and constrain the formation of adjective-noun combinations. The classbased smoothing method, however, relies on a pre-defined taxonomy that allows these dependencies to be inferred, and thus reliably estimates the plausibility of adjective-noun combinations that fail to co-occur in the corpus.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "3.3"
},
{
"text": "This paper investigated the validity of smoothing techniques by using them to recreate the frequencies of adjective-noun pairs that fail to occur in a 100 million word corpus. We showed that the recreated frequencies are significantly correlated with plausibility judgements. These results were then extended by applying the same smoothing techniques to adjective-noun pairs that occur in the corpus. These recreated frequencies were significantly correlated with the actual frequencies, as well as with plausibility judgements.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "4"
},
{
"text": "Our results provide independent evidence for the validity of the smoothing techniques we employed. In contrast to previous work, our evalu-ation does not presuppose that the recreated frequencies are used in a specific natural language processing task. Rather, we established an independent criterion for the validity of smoothing techniques by comparing them to plausibility judgements, which are known to correlate with co-occurrence frequency. We also carried out a comparison of different smoothing methods, and found that class-based smoothing outperforms distance-weighted averaging. 4 From a practical point of view, our findings provide a very simple account of adjectivenoun plausibility. Extending the results of Lapata et al. (1999) , we confirmed that cooccurrence frequency can be used to estimate the plausibility of an adjective-noun pair. If no cooccurrence counts are available from the corpus, then counts can be recreated using the corpus and a structured source of taxonomic knowledge (for the class-based approach). Distance-weighted averaging can be seen as a 'cheap' way to obtain this sort of taxonomic knowledge. However, this method does not draw upon semantic information only, but is also sensitive to the syntactic distribution of the target word. This explains the fact that distance-weighted averaging yielded a lower correlation with perceived plausibility than class-based smoothing. A taxonomy like WordNet provides a cleaner source of conceptual information, which captures essential aspects of the type of knowledge needed for assessing the plausibility of an adjective-noun combination.",
"cite_spans": [
{
"start": 590,
"end": 591,
"text": "4",
"ref_id": null
},
{
"start": 723,
"end": 743,
"text": "Lapata et al. (1999)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "4"
},
{
"text": "There are several ways of addressing this problem, e.g., by discounting the contribution of very general classes by finding a suitable class to represent a given concept(Clark and Weir, 2001).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "These were shown to be the best parameter settings byLapata (2000). Note that considerable latitude is available when setting these parameters; there are 151,478 distinct adjective types and 367,891 noun types in the BNC.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Magnitude estimation of linguistic acceptability",
"authors": [
{
"first": "Ellen Gurman",
"middle": [],
"last": "Bard",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Robertson",
"suffix": ""
},
{
"first": "Antonella",
"middle": [],
"last": "Sorace",
"suffix": ""
}
],
"year": 1996,
"venue": "Language",
"volume": "72",
"issue": "1",
"pages": "32--68",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ellen Gurman Bard, Dan Robertson, and Antonella Sorace. 1996. Magnitude estimation of linguistic acceptability. Language, 72(1):32-68.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Class-based n-gram models of natural language",
"authors": [
{
"first": "F",
"middle": [],
"last": "Peter",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Brown",
"suffix": ""
},
{
"first": "J",
"middle": [
"Della"
],
"last": "Vincent",
"suffix": ""
},
{
"first": "Peter",
"middle": [
"V"
],
"last": "Pietra",
"suffix": ""
},
{
"first": "Robert",
"middle": [
"L"
],
"last": "De Souza",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mercer",
"suffix": ""
}
],
"year": 1992,
"venue": "Computational Linguistics",
"volume": "18",
"issue": "4",
"pages": "467--479",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter F. Brown, Vincent J. Della Pietra, Peter V. de Souza, and Robert L. Mercer. 1992. Class-based n-gram models of natural language. Computational Linguistics, 18(4):467-479.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Users Guide for the British National Corpus. British National Corpus Consortium",
"authors": [
{
"first": "Lou",
"middle": [],
"last": "Burnard",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lou Burnard, 1995. Users Guide for the British National Corpus. British National Corpus Consortium, Oxford University Computing Service.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Class-based probability estimation using a semantic hierarchy",
"authors": [
{
"first": "Stephen",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Weir",
"suffix": ""
}
],
"year": 2001,
"venue": "Proceedings of the 2nd Conference of the North American Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stephen Clark and David Weir. 2001. Class-based probabil- ity estimation using a semantic hierarchy. In Proceedings of the 2nd Conference of the North American Chapter of the Association for Computational Linguistics, Pitts- burgh, PA.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Finding syntactic 4 Two anonymous reviewers point out that this conclusion only holds for an approach that computes similarity based on adjective-noun co-occurrences. Such co-occurrences might not reflect semantic relatedness very well, due to the idiosyncratic nature of adjective-noun combinations. It is possible that distance-weighted averaging would yield better results if applied to other co-occurrence data (e.g., subject-verb, verbobject), which could be expected to produce more reliable information about semantic similarity. structure in unparsed corpora: The Gsearch corpus query system",
"authors": [
{
"first": "Steffan",
"middle": [],
"last": "Corley",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Corley",
"suffix": ""
},
{
"first": "Frank",
"middle": [],
"last": "Keller",
"suffix": ""
},
{
"first": "Matthew",
"middle": [
"W"
],
"last": "Crocker",
"suffix": ""
},
{
"first": "Shari",
"middle": [],
"last": "Trewin",
"suffix": ""
}
],
"year": 2001,
"venue": "Computers and the Humanities",
"volume": "35",
"issue": "2",
"pages": "81--94",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Steffan Corley, Martin Corley, Frank Keller, Matthew W. Crocker, and Shari Trewin. 2001. Finding syntactic 4 Two anonymous reviewers point out that this conclusion only holds for an approach that computes similarity based on adjective-noun co-occurrences. Such co-occurrences might not reflect semantic relatedness very well, due to the idiosyn- cratic nature of adjective-noun combinations. It is possible that distance-weighted averaging would yield better results if applied to other co-occurrence data (e.g., subject-verb, verb- object), which could be expected to produce more reliable information about semantic similarity. structure in unparsed corpora: The Gsearch corpus query system. Computers and the Humanities, 35(2):81-94.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Experimental Syntax: Applying Objective Methods to Sentence Judgments",
"authors": [
{
"first": "Wayne",
"middle": [],
"last": "Cowart",
"suffix": ""
}
],
"year": 1997,
"venue": "Sage Publications",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wayne Cowart. 1997. Experimental Syntax: Applying Ob- jective Methods to Sentence Judgments. Sage Publica- tions, Thousand Oaks, CA.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Lexical Semantics. Cambridge Textbooks in Linguistics",
"authors": [
{
"first": "D",
"middle": [
"A"
],
"last": "Cruse",
"suffix": ""
}
],
"year": 1986,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "D. A. Cruse. 1986. Lexical Semantics. Cambridge Text- books in Linguistics. Cambridge University Press, Cam- bridge.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Similarity-based models of word cooccurrence probabilities",
"authors": [
{
"first": "Lillian",
"middle": [],
"last": "Ido Dagan",
"suffix": ""
},
{
"first": "Fernando",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Pereira",
"suffix": ""
}
],
"year": 1999,
"venue": "Machine Learning",
"volume": "34",
"issue": "",
"pages": "43--69",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ido Dagan, Lillian Lee, and Fernando Pereira. 1999. Similarity-based models of word cooccurrence probabil- ities. Machine Learning, 34(1):43-69.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Generalizing automatically generated selectional patterns",
"authors": [
{
"first": "Ralph",
"middle": [],
"last": "Grishman",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Sterling",
"suffix": ""
}
],
"year": 1994,
"venue": "Proceedings of the 15th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "742--747",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ralph Grishman and John Sterling. 1994. Generalizing au- tomatically generated selectional patterns. In Proceed- ings of the 15th International Conference on Computa- tional Linguistics, pages 742-747, Kyoto.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Estimation of probabilities from sparse data for the language model component of a speech recognizer",
"authors": [
{
"first": "M",
"middle": [],
"last": "Slava",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Katz",
"suffix": ""
}
],
"year": 1987,
"venue": "IEEE Transactions on Acoustics Speech and Signal Processing",
"volume": "33",
"issue": "3",
"pages": "400--401",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Slava M. Katz. 1987. Estimation of probabilities from sparse data for the language model component of a speech recognizer. IEEE Transactions on Acoustics Speech and Signal Processing, 33(3):400-401.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "WebExp: A Java toolbox for web-based psychological experiments",
"authors": [
{
"first": "Frank",
"middle": [],
"last": "Keller",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Corley",
"suffix": ""
},
{
"first": "Steffan",
"middle": [],
"last": "Corley",
"suffix": ""
},
{
"first": "Lars",
"middle": [],
"last": "Konieczny",
"suffix": ""
},
{
"first": "Amalia",
"middle": [],
"last": "Todirascu",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Frank Keller, Martin Corley, Steffan Corley, Lars Konieczny, and Amalia Todirascu. 1998. WebExp: A Java tool- box for web-based psychological experiments. Technical Report HCRC/TR-99, Human Communication Research Centre, University of Edinburgh.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Determinants of adjective-noun plausibility",
"authors": [
{
"first": "Maria",
"middle": [],
"last": "Lapata",
"suffix": ""
},
{
"first": "Scott",
"middle": [],
"last": "Mcdonald",
"suffix": ""
},
{
"first": "Frank",
"middle": [],
"last": "Keller",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of the 9th Conference of the European Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "30--36",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maria Lapata, Scott McDonald, and Frank Keller. 1999. Determinants of adjective-noun plausibility. In Proceed- ings of the 9th Conference of the European Chapter of the Association for Computational Linguistics, pages 30-36, Bergen.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "The Acquisition and Modeling of Lexical Knowledge: A Corpus-based Investigation of Systematic Polysemy",
"authors": [
{
"first": "Maria",
"middle": [],
"last": "Lapata",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maria Lapata. 2000. The Acquisition and Modeling of Lexi- cal Knowledge: A Corpus-based Investigation of System- atic Polysemy. Ph.D. thesis, University of Edinburgh.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Designing Statistical Language Learners: Experiments on Compound Nouns",
"authors": [
{
"first": "Mark",
"middle": [],
"last": "Lauer",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mark Lauer. 1995. Designing Statistical Language Learn- ers: Experiments on Compound Nouns. Ph.D. thesis, Macquarie University, Sydney.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Measures of distributional similarity",
"authors": [
{
"first": "Lilian",
"middle": [
"Lee"
],
"last": "",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "25--32",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lilian Lee. 1999. Measures of distributional similarity. In Proceedings of the 37th Annual Meeting of the Associa- tion for Computational Linguistics, pages 25-32, Univer- sity of Maryland, College Park.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Introduction to WordNet: An on-line lexical database",
"authors": [
{
"first": "George",
"middle": [
"A"
],
"last": "Miller",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Beckwith",
"suffix": ""
},
{
"first": "Christiane",
"middle": [],
"last": "Fellbaum",
"suffix": ""
},
{
"first": "Derek",
"middle": [],
"last": "Gross",
"suffix": ""
},
{
"first": "Katherine",
"middle": [
"J"
],
"last": "Miller",
"suffix": ""
}
],
"year": 1990,
"venue": "International Journal of Lexicography",
"volume": "3",
"issue": "4",
"pages": "235--244",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "George A. Miller, Richard Beckwith, Christiane Fellbaum, Derek Gross, and Katherine J. Miller. 1990. Introduction to WordNet: An on-line lexical database. International Journal of Lexicography, 3(4):235-244.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Distributional clustering of English words",
"authors": [
{
"first": "Fernando",
"middle": [],
"last": "Pereira",
"suffix": ""
},
{
"first": "Naftali",
"middle": [],
"last": "Tishby",
"suffix": ""
},
{
"first": "Lillian",
"middle": [],
"last": "Lee",
"suffix": ""
}
],
"year": 1993,
"venue": "Proceedings of the 31st Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "183--190",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fernando Pereira, Naftali Tishby, and Lillian Lee. 1993. Distributional clustering of English words. In Proceed- ings of the 31st Annual Meeting of the Association for Computational Linguistics, pages 183-190, Columbus, OH.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Selection and Information: A Class-Based Approach to Lexical Relationships",
"authors": [
{
"first": "Philip",
"middle": [],
"last": "Stuart Resnik",
"suffix": ""
}
],
"year": 1993,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philip Stuart Resnik. 1993. Selection and Information: A Class-Based Approach to Lexical Relationships. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "The Empirical Base of Linguistics: Grammaticality Judgments and Linguistic Methodology",
"authors": [
{
"first": "T",
"middle": [],
"last": "Carson",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sch\u00fctze",
"suffix": ""
}
],
"year": 1991,
"venue": "Lexical Acquisition: Using Online Resources to Build a Lexicon",
"volume": "",
"issue": "",
"pages": "165--189",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Carson T. Sch\u00fctze. 1996. The Empirical Base of Linguis- tics: Grammaticality Judgments and Linguistic Method- ology. University of Chicago Press, Chicago. Frank Smadja. 1991. Macrocoding the lexicon with co- occurrence knowledge. In Uri Zernik, editor, Lexical Ac- quisition: Using Online Resources to Build a Lexicon, pages 165-189. Lawrence Erlbaum Associates, Hillsdale, NJ.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Psychophysics: Introduction to its Perceptual, Neural, and Social Prospects",
"authors": [
{
"first": "S",
"middle": [],
"last": "Stevens",
"suffix": ""
}
],
"year": 1975,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Stevens. 1975. Psychophysics: Introduction to its Per- ceptual, Neural, and Social Prospects. John Wiley, New York.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Computer Systems that Learn: Classification and Prediction Methods from Statistics, Neural Nets, Machine Learning, and Expert Systems",
"authors": [
{
"first": "M",
"middle": [],
"last": "Sholom",
"suffix": ""
},
{
"first": "Casimir",
"middle": [
"A"
],
"last": "Weiss",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Kulikowski",
"suffix": ""
}
],
"year": 1991,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sholom M. Weiss and Casimir A. Kulikowski. 1991. Com- puter Systems that Learn: Classification and Prediction Methods from Statistics, Neural Nets, Machine Learning, and Expert Systems. Morgan Kaufmann, San Mateo, CA.",
"links": null
}
},
"ref_entries": {}
}
} |