File size: 89,236 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 |
{
"paper_id": "W09-0210",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T06:36:59.714583Z"
},
"title": "Unsupervised and Constrained Dirichlet Process Mixture Models for Verb Clustering",
"authors": [
{
"first": "Andreas",
"middle": [],
"last": "Vlachos",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Computer Laboratory University of Cambridge",
"location": {
"postCode": "CB3 0FD",
"settlement": "Cambridge",
"country": "UK"
}
},
"email": ""
},
{
"first": "Anna",
"middle": [],
"last": "Korhonen",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Cambridge",
"location": {
"postCode": "CB3 0FD",
"settlement": "Cambridge",
"country": "UK"
}
},
"email": ""
},
{
"first": "Zoubin",
"middle": [],
"last": "Ghahramani",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Cambridge",
"location": {
"postCode": "CB2 1PZ",
"settlement": "Cambridge",
"country": "UK"
}
},
"email": "[email protected]"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "In this work, we apply Dirichlet Process Mixture Models (DPMMs) to a learning task in natural language processing (NLP): lexical-semantic verb clustering. We thoroughly evaluate a method of guiding DP-MMs towards a particular clustering solution using pairwise constraints. The quantitative and qualitative evaluation performed highlights the benefits of both standard and constrained DPMMs compared to previously used approaches. In addition, it sheds light on the use of evaluation measures and their practical application.",
"pdf_parse": {
"paper_id": "W09-0210",
"_pdf_hash": "",
"abstract": [
{
"text": "In this work, we apply Dirichlet Process Mixture Models (DPMMs) to a learning task in natural language processing (NLP): lexical-semantic verb clustering. We thoroughly evaluate a method of guiding DP-MMs towards a particular clustering solution using pairwise constraints. The quantitative and qualitative evaluation performed highlights the benefits of both standard and constrained DPMMs compared to previously used approaches. In addition, it sheds light on the use of evaluation measures and their practical application.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Bayesian non-parametric models have received a lot of attention in the machine learning community. These models have the attractive property that the number of components used to model the data is not fixed in advance but is actually determined by the model and the data. This property is particularly interesting for NLP where many tasks are aimed at discovering novel, previously unknown information in corpora. Recent work has applied Bayesian non-parametric models to anaphora resolution (Haghighi and Klein, 2007) , lexical acquisition (Goldwater, 2007) and language modeling (Teh, 2006) with good results.",
"cite_spans": [
{
"start": 492,
"end": 518,
"text": "(Haghighi and Klein, 2007)",
"ref_id": "BIBREF5"
},
{
"start": 541,
"end": 558,
"text": "(Goldwater, 2007)",
"ref_id": "BIBREF4"
},
{
"start": 581,
"end": 592,
"text": "(Teh, 2006)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Recently, Vlachos et al. (2008) applied the basic models of this class, Dirichlet Process Mixture Models (DPMMs) (Neal, 2000) , to a typical learning task in NLP: lexical-semantic verb clustering. The task involves discovering classes of verbs similar in terms of their syntactic-semantic properties (e.g. MOTION class for travel, walk, run, etc.). Such classes can provide important support for other NLP tasks, such as word sense disambiguation, parsing and semantic role labeling (Dang, 2004; Swier and Stevenson, 2004) .",
"cite_spans": [
{
"start": 10,
"end": 31,
"text": "Vlachos et al. (2008)",
"ref_id": "BIBREF22"
},
{
"start": 113,
"end": 125,
"text": "(Neal, 2000)",
"ref_id": "BIBREF15"
},
{
"start": 483,
"end": 495,
"text": "(Dang, 2004;",
"ref_id": "BIBREF2"
},
{
"start": 496,
"end": 522,
"text": "Swier and Stevenson, 2004)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Although some fixed classifications are available (e.g. VerbNet (Kipper-Schuler, 2005 )) these are not comprehensive and are inadequate for specific domains (Korhonen et al., 2006b) .",
"cite_spans": [
{
"start": 64,
"end": 85,
"text": "(Kipper-Schuler, 2005",
"ref_id": "BIBREF6"
},
{
"start": 157,
"end": 181,
"text": "(Korhonen et al., 2006b)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Unlike the clustering algorithms applied to this task before, DPMMs do not require the number of clusters as input. This is important because even if the number of classes in a particular task was known (e.g. in the context of a carefully controlled experiment), a particular dataset may not contain instances for all the classes. Moreover, each class is not necessarily contained in one cluster exclusively, since the target classes are defined manually without taking into account the feature representation used. The fact that DPMMs do not require the number of target clusters in advance, renders them promising for the many NLP tasks where clustering is used for learning purposes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "While the results of Vlachos et al. (2008) are promising, the use of a clustering approach which discovers the number of clusters in data presents a new challenge to existing evaluation measures. In this work, we investigate optimal evaluation for such approaches, using the dataset and the basic method of Vlachos et al. as a starting point. We review the applicability of existing evaluation measures and propose a modified version of the newly introduced V-measure (Rosenberg and Hirschberg, 2007) . We complement the quantitative evaluation with thorough qualitative assessment, for which we introduce a method to summarize samples obtained from a clustering algorithm.",
"cite_spans": [
{
"start": 21,
"end": 42,
"text": "Vlachos et al. (2008)",
"ref_id": "BIBREF22"
},
{
"start": 468,
"end": 500,
"text": "(Rosenberg and Hirschberg, 2007)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In preliminary work by Vlachos et al. (2008) , a constrained version of DPMMs which takes advantage of must-link and cannot-link pairwise constraints was introduced. It was demonstrated how such constraines can guide the clustering solution towards some prior intuition or considerations relevant to the specific NLP application in mind. We explain the inference algorithm for the constrained DPMM in greater detail and evaluate quantita-tively the contribution of each constraint type of independently, complementing it with qualitative analysis. The latter demonstrates how the pairwise constraints added affects instances beyond those involved directly. Finally, we discuss how the unsupervised and the constrained version of DPMMs can be used in a real-world setup.",
"cite_spans": [
{
"start": 23,
"end": 44,
"text": "Vlachos et al. (2008)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The results from our comprehensive evaluation show that both versions of DPMMs are capable of learning novel information not in the gold standard, and that the constrained version is more accurate than a previous verb clustering approach which requires setting the number of clusters in advance and is therefore less realistic.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "With DPMMs, as with other Bayesian nonparametric models, the number of mixture components is not fixed in advance, but is determined by the model and the data. The parameters of each component are generated by a Dirichlet Process (DP) which can be seen as a distribution over the parameters of other distributions. In turn, each instance is generated by the chosen component given the parameters defined in the previous step:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised clustering with DPMMs",
"sec_num": "2"
},
{
"text": "G|\u03b1, G 0 \u223c DP (\u03b1, G 0 ) \u03b8 i |G \u223c G (1) x i |\u03b8 i \u223c F (\u03b8 i )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised clustering with DPMMs",
"sec_num": "2"
},
{
"text": "In Eq. 1, G 0 and G are probability distributions over the component parameters (\u03b8), and \u03b1 > 0 is the concentration parameter which determines the variance of the Dirichlet process. We can think of G as a randomly drawn probability distribution with mean G 0 . Intuitively, the larger \u03b1 is, the more similar G will be to G 0 . Instance x i is generated by distribution F , parameterized by \u03b8 i . The graphical model is depicted in Figure 1 .",
"cite_spans": [],
"ref_spans": [
{
"start": 431,
"end": 439,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Unsupervised clustering with DPMMs",
"sec_num": "2"
},
{
"text": "The prior probability of assigning an instance to a particular component is proportionate to the number of instances already assigned to it (n \u2212i,z ). In other words, DPMMs exhibit the \"rich get richer\" property. In addition, the probability that a new cluster is created is dependent on the concentration parameter \u03b1. A popular metaphor to describe DPMMs which exhibits an equivalent clustering property is the Chinese Restaurant Process (CRP). Customers (instances) arrive at a Chinese restaurant which has an infinite number of tables (components). Each customer sits at one of the tables that is either occupied or vacant with popular tables attracting more customers. In this work, the distribution used to model the components is the multinomial and the prior used is the Dirichlet distribution (F and G 0 in Eq. 1). The conjugacy between them allows for the analytic integration over the component parameters. Following Neal (2000) , the component assignments z i are sampled using the following scheme:",
"cite_spans": [
{
"start": 905,
"end": 938,
"text": "parameters. Following Neal (2000)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised clustering with DPMMs",
"sec_num": "2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P (z i = z|z \u2212i , x i ) \u221d p(z i = z|z \u2212i )DirM (x i |z i = z, x \u2212i,z , \u03bb)",
"eq_num": "(2)"
}
],
"section": "Unsupervised clustering with DPMMs",
"sec_num": "2"
},
{
"text": "In Eq. 2 DirM is the Dirichlet-Multinomial distribution, \u03bb are the parameters of the Dirichlet prior G 0 and x \u2212i,z are the instances assigned already to component z (none if we are sampling the probability of assignment to a new component). This sampling scheme is possible due to the fact that the instances in the model are exchangeable, i.e. the order in which they are generated is not relevant. In terms of the CRP metaphor, we consider each instance x i as the last customer to arrive and he chooses to sit together with other customers at an existing table or to sit at a new table. Following Navarro et al. (2006) who used the same model to analyze individual differences, we sample the concentration parameter \u03b1 using the inverse Gamma distribution as a prior.",
"cite_spans": [
{
"start": 601,
"end": 622,
"text": "Navarro et al. (2006)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised clustering with DPMMs",
"sec_num": "2"
},
{
"text": "The evaluation of unsupervised clustering against a gold standard is not straightforward because the clusters found are not explicitly labelled. Formally defined, an unsupervised clustering algorithm partitions a set of instances X = {x i |i = 1, ..., N } into a set of clusters K = {k j |j = 1, ..., |K|}. The standard approach to evaluate the quality of the clusters is to use an external gold standard in which the instances are partitioned into a set of classes C = {c l |l = 1, ..., |C|}. Given this, the goal is to find a partitioning of the instances K that is as close as possible to the gold standard C.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation measures",
"sec_num": "3"
},
{
"text": "Most work on verb clustering has used the Fmeasure or the Rand Index (RI) (Rand, 1971) for evaluation, which rely on counting pairwise links between instances. However, Rosenberg and Hirschberg (2007) pointed out that F-measure assumes (the missing) mapping between c l and k j . In practice, RI values concentrate in a small interval near 100% (Meil\u0203, 2007) . Rosenberg & Hirschberg (2007) proposed an information-theoretic metric: V-measure. Vmeasure is the harmonic mean of homogeneity and completeness which evaluate the quality of the clustering in a complementary way. Homogeneity assesses the degree to which each cluster contains instances from a single class of C. This is computed as the conditional entropy of the class distribution of the gold standard given the clustering discovered by the algorithm, H(C|K), normalized by the entropy of the class distribution in the gold standard, H(C). Completeness assesses the degree to which each class is contained in a single cluster. This is computed as the conditional entropy of the cluster distribution discovered by the algorithm given the class, H(K|C), normalized by the entropy of the cluster distribution, H(K). In both cases, we subtract the resulting ratios from 1 to associate higher scores with better solutions:",
"cite_spans": [
{
"start": 74,
"end": 86,
"text": "(Rand, 1971)",
"ref_id": "BIBREF17"
},
{
"start": 169,
"end": 200,
"text": "Rosenberg and Hirschberg (2007)",
"ref_id": "BIBREF18"
},
{
"start": 345,
"end": 358,
"text": "(Meil\u0203, 2007)",
"ref_id": "BIBREF13"
},
{
"start": 361,
"end": 390,
"text": "Rosenberg & Hirschberg (2007)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation measures",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "h = 1 \u2212 H(C|K) H(C) c = 1 \u2212 H(K|C) H(K) V \u03b2 = (1 + \u03b2) * h * c (\u03b2 * h) + c",
"eq_num": "(3)"
}
],
"section": "Evaluation measures",
"sec_num": "3"
},
{
"text": "The parameter \u03b2 in Eq. 3 regulates the balance between homogeneity and completeness. Rosenberg & Hirschberg set it to 1 in order to obtain the harmonic mean of these qualities. They also note that V-measure favors clustering solutions with a large number of clusters (large |K|), since such solutions can achieve very high homogeneity while maintaining reasonable completeness. This effect is more prominent when a dataset includes a small number of instaces for gold standard classes. While increasing |K| does not guarantee an increase in V-measure (splitting homogeneous clusters would reduce completeness without improving homogeneity), it is easier to achieve higher scores when more clusters are produced. Another relevant measure is the Variation of Information (VI) (Meil\u0203, 2007) . Like V-measure, it assesses homogeneity and completeness using the quantities H(C|K) and H(K|C) respectively, however it simply adds them up to obtain a final result (higher scores are worse). It is also a metric, i.e. VI scores can be added, subtracted, etc, since the quantities involved are measured in bits. However, it can be observed that if |C| and |K| are very different then the terms H(C|K) and H(K|C) will not necessarily be in the same range. In particular, if |K| |C| then H(K|C) (and V I) will be low. In addition, VI scores are not normalized and therefore their interpretation is difficult.",
"cite_spans": [
{
"start": 774,
"end": 787,
"text": "(Meil\u0203, 2007)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation measures",
"sec_num": "3"
},
{
"text": "Both V-measure and VI have important advantages over RI and F-measure: they do not assume a mapping between classes and clusters and their scores depend only on the relative sizes of the clusters. However, V-measure and VI can be misleading if the number of clusters found (|K|) is substantially different than the number of gold standard classes (|C|). In order to ameliorate this, we suggest to take advantage of the \u03b2 parameter in Eq. 3 in order to balance homogeneity and completeness. More specifically, setting \u03b2 = |K|/|C| assigns more weight to completeness than to homogeneity in case |K| > |C| since the former is harder to achieve and the latter is easier when the clustering solution has more clusters than the gold standard has classes. The opposite occurs when |K| < |C|. In case |K| = |C| the score is the same as the original V-measure. Achieving 100% score according to any of these measures requires correct prediction of the number of clusters.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation measures",
"sec_num": "3"
},
{
"text": "In this work, we evaluate our results using the three measures described above (V-measure, VI, V-beta). We complement this evaluation with qualitative evaluation which assesses the potential of DPMMs to discover novel information that might not be included in the gold standard.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation measures",
"sec_num": "3"
},
{
"text": "To perform lexical-semantic verb clustering we used the dataset of Sun et al. (2008) . It contains 204 verbs belonging to 17 fine-grained classes in Levin's (1993) taxonomy so that each class contains 12 verbs. The classes and their verbs were selected randomly. The features for each verb are its subcategorization frames (SCFs) and associated frequencies in corpus data, which capture the syntactic context in which the verb occurs. SCFs were extracted from the publicly available VALEX lexicon (Korhonen et al., 2006a) . VALEX was acquired automatically using a domain-independent statistical parsing toolkit, RASP (Briscoe and Carroll, 2002) , and a classifier which identifies verbal SCFs. As a consequence, it includes some noise due to standard text processing and parsing errors and due to the subtlety of argument-adjunct distinction. In our experiments, we used the SCFs obtained from VALEX1, parameterized for the prepositional frame, which had the best performance in the experiments of Sun et al. (2008) . The feature sets based on verbal SCFs are very sparse and the counts vary over a large range of values. This can be problematic for generative models like DPMMs, since a few dominant features can mislead the model. To reduce the sparsity, we applied non-negative matrix factorization (NMF) (Lin, 2007) which decomposes the dataset in two dense matrices with non-negative values. It has proven useful in a variety of tasks, e.g. information retrieval (Xu et al., 2003) and image processing (Lee and Seung, 1999) .",
"cite_spans": [
{
"start": 67,
"end": 84,
"text": "Sun et al. (2008)",
"ref_id": "BIBREF19"
},
{
"start": 149,
"end": 163,
"text": "Levin's (1993)",
"ref_id": "BIBREF11"
},
{
"start": 497,
"end": 521,
"text": "(Korhonen et al., 2006a)",
"ref_id": "BIBREF8"
},
{
"start": 618,
"end": 645,
"text": "(Briscoe and Carroll, 2002)",
"ref_id": "BIBREF1"
},
{
"start": 999,
"end": 1016,
"text": "Sun et al. (2008)",
"ref_id": "BIBREF19"
},
{
"start": 1309,
"end": 1320,
"text": "(Lin, 2007)",
"ref_id": "BIBREF12"
},
{
"start": 1469,
"end": 1486,
"text": "(Xu et al., 2003)",
"ref_id": "BIBREF24"
},
{
"start": 1508,
"end": 1529,
"text": "(Lee and Seung, 1999)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4"
},
{
"text": "We use a symmetric Dirichlet prior with parameters of 1 (\u03bb in Equation 2). The number of dimensions obtained using NMF was 35. We run the Gibbs sampler 5 times, using 100 iterations for burn-in and draw 20 samples from each run with 5 iterations lag between samples. Table 1 shows the average performances. The DPMM discovers 37.79 verb clusters on average with its performance ranging between 53% and 58% depending on the evaluation measure used. Homogeneity is 4.5% higher than completeness, which is expected since the number of classes in the gold standard is 17. The fact that the DPMM discovers more than twice the number of classes is reflected in the difference between the V-measure and V-beta, the latter being lower. In the same table, we show the results of Sun et al. (2008) , who used pairwise clus-tering (PC) (Puzicha et al., 2000) which involves determining the number of clusters in advance.",
"cite_spans": [
{
"start": 770,
"end": 787,
"text": "Sun et al. (2008)",
"ref_id": "BIBREF19"
},
{
"start": 825,
"end": 847,
"text": "(Puzicha et al., 2000)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [
{
"start": 267,
"end": 274,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4"
},
{
"text": "The performance of the DPMM is 1%-3% lower than that of Sun et al. As expected, the difference in V-measure is smaller since the DPMM discovers a larger number of clusters, while for VI it is larger. The slightly better performance of PC can be attributed to two factors. First, the (correct) number of clusters is given as input to the PC algorithm and not discovered like by the DPMM. Secondly, PC uses the similarities between the instances to perform the clustering, while the DPMM attempts to find the parameters of the process that generated the data, which is a different and typically a harder task. In addition, the DPMM has two clear advantages which we illustrate in the following sections: it can be used to discover novel information and it can be modified to incorporate intuitive human supervision.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4"
},
{
"text": "The gold standard employed in this work (Sun et al., 2008) is not fully accurate or comprehensive. It classifies verbs according to their predominant senses in the fairly small SemCor data. Individual classes are relatively coarse-grained in terms of syntactic-semantic analysis 1 and they capture some of the meaning components only. In addition, the gold standard does not capture the semantic relatedness of distinct classes. In fact, the main goal of clustering is to improve such existing classifications with novel information and to create classifications for new domains. We performed qualitative analysis to investigate the extent to which the DPMM meets this goal.",
"cite_spans": [
{
"start": 40,
"end": 58,
"text": "(Sun et al., 2008)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Qualitative evaluation",
"sec_num": "5"
},
{
"text": "We prepared the data for qualitative analysis as follows: We represented each clustering sample as a linking matrix between the instances of the dataset and measured the frequency of each pair of instances occurring in the same cluster. We constructed a partial clustering of the instances using only those links that occur with frequency higher than a threshold prob link. Singleton clusters were formed by considering instances that are not linked with any other instances more frequently than a threshold prob single. The lower the prob link threshold, the larger the clusters will be, since more instances get linked. Note that including more links in the solution can either in-crease the number of clusters when instances involved were not linked otherwise, or decrease it when linking instances that already belong to other clusters. The higher the prob single threshold, the more instances will end up as singletons. By adjusting these two thresholds we can affect the coverage of the analysis. This approach was chosen because it enables to conduct qualitative analysis of data relevant to most clustering samples and irrespective of individual samples. It can also be useful in order to use the output of the clustering algorithm as a component in a pipeline which requires a single result rather than multiple samples.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Qualitative evaluation",
"sec_num": "5"
},
{
"text": "Using this method, we generated data sets for qualitative analysis using 4 sets of values for prob link and prob single, respectively: (99%, 1%), (95%, 5%), (90%, 10%) and (85%, 15%). Table 1 shows the number of a) verbs, b) clusters (2 or more instances) and c) singletons in each resulting data set, along with the percentage and size of the clusters which represent 1, 2, or multiple gold standard classes. As expected, higher threshold values produce high precision clusters for a smaller set of verbs (e.g. (99%,1%) produces 5 singletons and assigns 70 verbs to 20 clusters, 55% of which represent a single gold standard class), while less extreme threshold values yield higher recall clusters for a larger set of verbs (e.g. (85%,15%) produces 10 singletons and assigns 140 verbs to 25 clusters, 20% of which contain verbs from several gold standard classes).",
"cite_spans": [],
"ref_spans": [
{
"start": 184,
"end": 191,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Qualitative evaluation",
"sec_num": "5"
},
{
"text": "We conducted the qualitative analysis by comparing the four data sets against the gold standard, SCF distributions, and WordNet (Fellbaum, 1998) senses for each test verb. We first analysed the 5-10 singletons in data sets and discovered that while 3 of the verbs resist classification because of syntactic idiosyncrasy (e.g. unite takes intransitive SCFs with frequency higher than other members of class 22.2), the majority of them (7) end up in singletons for valid semantic reasons: taking several frequent WordNet senses they are \"too polysemous\" to be realistically clustered according to their predominant sense (e.g. get and look).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Qualitative evaluation",
"sec_num": "5"
},
{
"text": "We then examined the clusters, and discovered that even in the data set created with the lowest prob link threshold of 85%, almost half of the \"errors\" are in fact novel semantic patterns discovered by clustering. Many of these could be new sub-classes of existing gold standard classes. For example, looking at the 13 high accuracy clusters which correspond to a single gold standard class each, they only represent 9 gold standard classes because as many as 4 classes been divided into two clusters, suggesting that the gold standard is too coarse-grained. Interestingly, each such subdivision seems semantically justified (e.g. the 11.1 PUT verbs bury and immerse appear in a different cluster than the semantically slightly different place and situate).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Qualitative evaluation",
"sec_num": "5"
},
{
"text": "In addition, the DPMM discovers semantically similar gold standard classes. For example, in the data set created with the prob link threshold of 99%, 6 of the clusters include members from 2 different gold standard classes. 2 occur due to syntactic idiosyncrasy, but the majority (4) occur because of true semantic relatedness (e.g. the clustering relates 22.2 AMALGAMATE and 36.1 CORRESPOND classes which share similar meaning components). Similarly, in the data set produced by the prob link threshold of 85%, one of the largest clusters includes 26 verbs from 5 gold standard classes. The majority of them belong to 3 classes which are related by the meaning component of \" Thus many of the singletons and the clusters in the different outputs capture finer or coarsergrained lexical-semantic differences than those captured in the gold standard. It is encouraging that this happens despite us focussing on a relatively small set of 204 verbs and 17 classes only.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Qualitative evaluation",
"sec_num": "5"
},
{
"text": "While the ability to discover novel information is attractive in NLP, in many cases it is also desirable to influence the solution with respect to some prior intuition or consideration relevant to the application in mind. For example, while discovering finer-grained classes than those included in the gold standard is useful for some applications, others may benefit from a coarser clustering or a clustering that reveals a specific aspect of the dataset. Vlachos et al. (2008) introduced a constrained version of DPMMs that enables human supervision to guide the clustering solution when needed. We model the human supervision as pairwise constraints over instances, following Wagstaff & Cardie (2000) : given a pair of instances, they are either linked together (mustlink) or not (cannot-link). For example, charge and run should form a must-link if the aim is to cluster 51.3 MOTION verbs together, but they should form a cannot-link if we are interested in 54.5 BILL verbs. In the discussion and the experiments that follow, we assume that all links are consistent with each other. This information can be obtained by asking human experts to label links, or by extracting it from extant lexical resources. Specifying the relations between the instances results in a partial labeling of the instances. Such labeling is likely to be re-usable, since relations between the instances are likely to be useful for a wider range of tasks which might not have identical labels but could still have similar relations.",
"cite_spans": [
{
"start": 457,
"end": 478,
"text": "Vlachos et al. (2008)",
"ref_id": "BIBREF22"
},
{
"start": 679,
"end": 703,
"text": "Wagstaff & Cardie (2000)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Constrained DPMMs",
"sec_num": "6"
},
{
"text": "In order to incorporate the constraints in the DPMM, we modify the underlying generative process to take them into account. In particular mustlinked instances are generated by the same component and cannot-linked instances always by different ones. In terms of the CRP metaphor, customers connected with must-links arrive at the restaurant together and choose a table jointly, respecting their cannot-links with other customers. They get seated at the same table successively one after the other. Customers without must-links with others choose tables avoiding their cannot-links.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Constrained DPMMs",
"sec_num": "6"
},
{
"text": "In order to sample the component assignments according to this model, we restrict the Gibbs sampler to take them into account using the sampling scheme of Fig. 2 . First we identify linked-groups of instances, taking into account transitivity 2 . We then sample the component assignments only from distributions that respect the links provided. More Input: data X , must-links M, cannot-links C linked groups = find linked groups(X , M) Initialize Z according to M, C for i not in linked groups ",
"cite_spans": [],
"ref_spans": [
{
"start": 155,
"end": 161,
"text": "Fig. 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Constrained DPMMs",
"sec_num": "6"
},
{
"text": "for z = 1 to |Z| + 1 if x \u2212i,z \u2229 C i = \u2205 P (z i = z|z \u2212i , x i ) (Eq. 2) else P (z i = z|z \u2212i , x i ) = 0 Sample from P (z i ) for in linked groups for z = 1 to |Z| + 1 if x \u2212 ,z \u2229 C = \u2205 Set P (z = z|z \u2212 , x ) = 1 for i in P (z = z|z \u2212 , x ) * = P (z i = z|z \u2212 , x \u2212 ,z , z <i , x <i ) else P (z = z|z \u2212 , x ) = 0 Sample from P (z )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Constrained DPMMs",
"sec_num": "6"
},
{
"text": "To investigate the impact of pairwise constraints on clustering by the DPMM, we conduct exper-iments in which the links are sampled randomly from the gold standard. The number of links varied from 10 to 50 and the random choice was repeated 5 times without checking for redundancy due to transitivity. All the other experimental settings are identical to those in Section 4. Following Wagstaff & Cardie (2000) , in Table 3 we show the impact of each link type independently (labeled \"must\" and \"cannot\" accordingly), as well as when mixed in equal proportions (\"mix\").",
"cite_spans": [
{
"start": 385,
"end": 409,
"text": "Wagstaff & Cardie (2000)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [
{
"start": 415,
"end": 422,
"text": "Table 3",
"ref_id": "TABREF5"
}
],
"eq_spans": [],
"section": "Experiments using constraints",
"sec_num": "7"
},
{
"text": "Adding randomly selected pairwise links is beneficial. In particular, must-links improve the clustering rapidly. Incorporating 50 must-links improves the performance by 7-8% according to the evaluation measures. In addition, it reduces the average number of clusters by approximately 4. The cannot-links are rather ineffective, which is expected as the clustering discovered by the unsupervised DPMM is more fine-grained than the gold standard. For the same reason, it is more likely that the randomly selected cannot-links are already discovered by the DPMM and are thus redundant. Wagstaff & Cardie also noted that the impact of the two types of links tends to vary across data sets. Nevertheless, a minor improvement is observed in terms of homogeneity. The balanced mix improves the performance, but less rapidly than the must-links.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments using constraints",
"sec_num": "7"
},
{
"text": "In order to assess how the links added help the DPMM learn other links we use the Constrained Rand Index (CRI), which is a modification of the Rand Index that takes into account only the pairwise decisions that are not dictated by the constraints added (Wagstaff and Cardie, 2000; Klein et al., 2002) . We evaluate the constrained DPMM with CRI (Table 3 , bottom right graph) and our results show that the improvements obtained using pairwise constraints are due to learning links beyond the ones enforced.",
"cite_spans": [
{
"start": 253,
"end": 280,
"text": "(Wagstaff and Cardie, 2000;",
"ref_id": "BIBREF23"
},
{
"start": 281,
"end": 300,
"text": "Klein et al., 2002)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [
{
"start": 345,
"end": 353,
"text": "(Table 3",
"ref_id": "TABREF5"
}
],
"eq_spans": [],
"section": "Experiments using constraints",
"sec_num": "7"
},
{
"text": "In a real-world setting, obtaining the mixed set of links is equivalent to asking a human expert to give examples of verbs that should be clustered together or not. Such information could be extracted from a lexical resource (e.g. ontology). Alternatively, the DPMM could be run without any constraints first and if a human expert judges the clustering too coarse (or fine) then cannot-links (or must-links) could help, since they can adapt the clustering rapidly. When 20 randomly selected must-links are integrated, the DPMM reaches or exceeds the performance of PC used by Sun et al. (2008) according to all the evaluation measures. We also argue that it is more realistic to guide the clustering algorithm using pairwise constraints than by defining the number of clusters in advance. Instead of using pairwise constraints to affect the clustering solution, one could alter the parameters for the Dirichlet prior G 0 (Eq. 1) or experiment with varying concentration parameter values. However, it is difficult to predict in advance the exact effect such changes would have in the solution discovered.",
"cite_spans": [
{
"start": 576,
"end": 593,
"text": "Sun et al. (2008)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments using constraints",
"sec_num": "7"
},
{
"text": "Finally, we conducted qualitative analysis of the samples obtained constraining the DPMM with 10 randomly selected must-links. We first prepared the data according to the method described in Section 5, using prob link and prob single thresholds of 99% and 1% respectively. This resulted in 26 clusters and one singleton for 79 verbs. Recall that without constraining the DPMM these thresholds produced 20 clusters and 5 singletons for 70 verbs. 49 verbs are shared in both outputs, while the average cluster size is similar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments using constraints",
"sec_num": "7"
},
{
"text": "The resulting clusters are highly accurate. As many as 16 (i.e. 62%) of them represent a single gold standard class, 7 of which contain (only) the pairs of must-linked verbs. Interestingly, only 11 out of 17 gold standard classes are exemplified among the 16 clusters, with 5 classes subdivided into finer-grained classes. Each of these sub-divisions seems semantically fully motivated (e.g. 30.3 PEER verbs were subdivided so that peep and peek were assigned to a different cluster than the semantically different gaze, glance and stare) and 4 of them can be directly attributed to the use of must-links.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments using constraints",
"sec_num": "7"
},
{
"text": "From the 6 clusters that contained members from two different gold standard classes, the majority (5) make sense as well. 3 of these contain members of must-link pairs together with verbs from semantically related classes (e.g. 37.7 SAY and 40.2 NONVERBAL EXPRESSION classes). 3 of the clusters that contain members of several gold standard classes include must-link pairs as well. In two cases must-links have helped to bring together verbs which belong to the same class (e.g. the members of the must-link pair broaden-freeze which represent 45.4 CHANGE OF STATE class appear now in the same cluster with other class members dampen, soften and sharpen). Thus, DP-MMs prove useful in learning novel information taking into account pairwise constraints. Only 4 (i.e. 15%) of the clusters in the output examined are not meaningful (mostly due to the mismatch between the syntax and semantics of verbs).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments using constraints",
"sec_num": "7"
},
{
"text": "Previous work on unsupervised verb clustering used algorithms that require the number of clusters as input e.g. PC, Information Bottleneck (Korhonen et al., 2006b) and spectral clustering (Brew and Schulte im Walde, 2002) . In terms of applying non-parametric Bayesian approaches to NLP, Haghighi and Klein (2007) evaluated the clustering properties of DPMMs by performing anaphora resolution with good results.",
"cite_spans": [
{
"start": 139,
"end": 163,
"text": "(Korhonen et al., 2006b)",
"ref_id": "BIBREF9"
},
{
"start": 188,
"end": 221,
"text": "(Brew and Schulte im Walde, 2002)",
"ref_id": "BIBREF0"
},
{
"start": 288,
"end": 313,
"text": "Haghighi and Klein (2007)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "8"
},
{
"text": "There is a large body of work on semisupervised learning (SSL), but relatively little work has been done on incorporating some form of supervision in clustering. It is important to note that the pairwise links used in this work constitute a weak form of supervision since they cannot be used to infer class labels which are required for SSL. However, the opposite can be done. Wagstaff & Cardie (2000) employed must-links and cannotlinks to constrain the COBWEB algorithm, while Klein et al. (2002) applied them to complete-link hierarchical agglomerative clustering. The latter also studied how the added links affect instances not directly involved in them.",
"cite_spans": [
{
"start": 377,
"end": 401,
"text": "Wagstaff & Cardie (2000)",
"ref_id": "BIBREF23"
},
{
"start": 479,
"end": 498,
"text": "Klein et al. (2002)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "8"
},
{
"text": "It can be argued that one could use clustering algorithms that require the number of clusters to be known in advance to discover interesting subclasses such as those discovered by the DPMMs. However, this would normally require multiple runs and manual inspection of the results, while DPMMs discover them automatically. Apart from the fact that fixing the number of clusters in advance restricts the discovery of novel information in the data, such algorithms cannot take full advantage of the pairwise constraints, since the latter are likely to change the number of clusters.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "8"
},
{
"text": "In this work, following Vlachos et al. (2008) we explored the application of DPMMs to the task of verb clustering. We modified V-measure (Rosenberg and Hirschberg, 2007) to deal more appropriately with the varying number of clusters discovered by DPMMs and presented a method of agregating the generated samples which allows for qualitative evaluation. The quantitative and qualitative evaluation demonstrated that they achieve performance comparable with that of previous work and in addition discover novel information in the data. Furthermore, we evaluated the incorporation of constraints to guide the DPMM obtaining promising results and we discussed their application in a real-world setup.",
"cite_spans": [
{
"start": 24,
"end": 45,
"text": "Vlachos et al. (2008)",
"ref_id": "BIBREF22"
},
{
"start": 137,
"end": 169,
"text": "(Rosenberg and Hirschberg, 2007)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions -Future Work",
"sec_num": "9"
},
{
"text": "The results obtained encourage the application of DPMMs and non-parametric Bayesian methods to other NLP tasks. We plan to extend our experiments to larger datasets and further domains. While the improvements achieved using randomly selected pairwise constraints were promising, an active constraint selection scheme as in Klein et al. (2002) could increase their impact. Finally, an extrinsic evaluation of the clustering provided by DPMMs in the context of an NLP application would be informative on their practical potential.",
"cite_spans": [
{
"start": 323,
"end": 342,
"text": "Klein et al. (2002)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions -Future Work",
"sec_num": "9"
},
{
"text": "Many original Levin classes have been manually refined in VerbNet.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "If A is linked to B and B to C, then A is linked to C. specifically, for each instance that does not belong to a linked-group, we restrict the sampler to choose components that do not contain instances cannotlinked with it. For instances in a linked-group, we sample their assignment jointly, again taking into account their cannot-links. This is performed by adding each instance of the linked-group successively to the same component. InFig. 2, C i are the cannot-links for instance(s) i, are the indices of the instances in a linked-group, and z <i and x <i are the assignments and the instances of a linkedgroup that have been assigned to a component before instance i.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We are grateful to Diarmuid\u00d3 S\u00e9aghdha and Jurgen Van Gael for helpful discussions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Spectral Clustering for German Verbs",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Brew",
"suffix": ""
},
{
"first": "Sabine",
"middle": [],
"last": "Schulte Im Walde",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of the 2002 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "117--124",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Brew and Sabine Schulte im Walde. 2002. Spec- tral Clustering for German Verbs. In Proceedings of the 2002 Conference on Empirical Methods in Nat- ural Language Processing, pages 117-124.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Robust accurate statistical annotation of general text",
"authors": [
{
"first": "Ted",
"middle": [],
"last": "Briscoe",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Carroll",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of the 3rd International Conference on Language Resources and Evaluation",
"volume": "",
"issue": "",
"pages": "1499--1504",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ted Briscoe and John Carroll. 2002. Robust accurate statistical annotation of general text. In Proceedings of the 3rd International Conference on Language Resources and Evaluation, pages 1499-1504.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Investigations into the role of lexical semantics in word sense disambiguation",
"authors": [
{
"first": "Hoa",
"middle": [
"Trang"
],
"last": "Dang",
"suffix": ""
}
],
"year": 2004,
"venue": "Philadelphia",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hoa Trang Dang. 2004. Investigations into the role of lexical semantics in word sense disambiguation. Ph.D. thesis, University of Pennsylvania, Philadel- phia, PA, USA.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "WordNet: An Electronic Lexical Database (Language, Speech, and Communication)",
"authors": [],
"year": 1998,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christiane Fellbaum, editor. 1998. WordNet: An Elec- tronic Lexical Database (Language, Speech, and Communication). The MIT Press.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Nonparametric bayesian models of lexical acquisition",
"authors": [
{
"first": "Sharon",
"middle": [
"J"
],
"last": "Goldwater",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sharon J. Goldwater. 2007. Nonparametric bayesian models of lexical acquisition. Ph.D. thesis, Brown University, Providence, RI, USA.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Unsupervised coreference resolution in a nonparametric bayesian model",
"authors": [
{
"first": "Aria",
"middle": [],
"last": "Haghighi",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics",
"volume": "",
"issue": "",
"pages": "848--855",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Aria Haghighi and Dan Klein. 2007. Unsupervised coreference resolution in a nonparametric bayesian model. In Proceedings of the 45th Annual Meet- ing of the Association of Computational Linguistics, pages 848-855, Prague, Czech Republic.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "VerbNet: A broadcoverage, comprehensive verb lexicon",
"authors": [
{
"first": "Karin",
"middle": [],
"last": "Kipper",
"suffix": ""
},
{
"first": "-",
"middle": [],
"last": "Schuler",
"suffix": ""
}
],
"year": 2005,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Karin Kipper-Schuler. 2005. VerbNet: A broad- coverage, comprehensive verb lexicon. Ph.D. thesis, University of Pennsylvania.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering",
"authors": [
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
},
{
"first": "Sepandar",
"middle": [],
"last": "Kamvar",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of the Nineteenth International Conference on Machine Learning",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dan Klein, Sepandar Kamvar, and Chris Manning. 2002. From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering. In Proceedings of the Nineteenth In- ternational Conference on Machine Learning.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "A large subcategorization lexicon for natural language processing applications",
"authors": [
{
"first": "Anna",
"middle": [],
"last": "Korhonen",
"suffix": ""
},
{
"first": "Yuval",
"middle": [],
"last": "Krymolowski",
"suffix": ""
},
{
"first": "Ted",
"middle": [],
"last": "Briscoe",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 5th International Conference on Language Resources and Evaluation",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Anna Korhonen, Yuval Krymolowski, and Ted Briscoe. 2006a. A large subcategorization lexicon for natural language processing applications. In Proceedings of the 5th International Conference on Language Re- sources and Evaluation.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Automatic classification of verbs in biomedical texts",
"authors": [
{
"first": "Anna",
"middle": [],
"last": "Korhonen",
"suffix": ""
},
{
"first": "Yuval",
"middle": [],
"last": "Krymolowski",
"suffix": ""
},
{
"first": "Nigel",
"middle": [],
"last": "Collier",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the COLING-ACL",
"volume": "",
"issue": "",
"pages": "345--352",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Anna Korhonen, Yuval Krymolowski, and Nigel Col- lier. 2006b. Automatic classification of verbs in biomedical texts. In Proceedings of the COLING- ACL, pages 345-352.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Learning the parts of objects by non-negative matrix factorization",
"authors": [
{
"first": "D",
"middle": [],
"last": "Daniel",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [
"H"
],
"last": "Lee",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Seung",
"suffix": ""
}
],
"year": 1999,
"venue": "Nature",
"volume": "401",
"issue": "6755",
"pages": "788--791",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daniel D. Lee and Sebastian H. Seung. 1999. Learning the parts of objects by non-negative matrix factoriza- tion. Nature, 401(6755):788-791, October.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "English Verb Classes and Alternations: a preliminary investigation",
"authors": [
{
"first": "Beth",
"middle": [],
"last": "Levin",
"suffix": ""
}
],
"year": 1993,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Beth Levin. 1993. English Verb Classes and Alter- nations: a preliminary investigation. University of Chicago Press, Chicago.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Projected gradient methods for nonnegative matrix factorization",
"authors": [
{
"first": "Chih-Jen",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 2007,
"venue": "Neural Compuation",
"volume": "19",
"issue": "10",
"pages": "2756--2779",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chih-Jen Lin. 2007. Projected gradient methods for nonnegative matrix factorization. Neural Compua- tion, 19(10):2756-2779.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Comparing clusterings-an information based distance",
"authors": [
{
"first": "Marina",
"middle": [],
"last": "Meil\u0203",
"suffix": ""
}
],
"year": 2007,
"venue": "Journal of Multivariate Analysis",
"volume": "98",
"issue": "5",
"pages": "873--895",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marina Meil\u0203. 2007. Comparing clusterings-an in- formation based distance. Journal of Multivariate Analysis, 98(5):873-895.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Modeling individual differences using dirichlet processes",
"authors": [
{
"first": "J",
"middle": [],
"last": "Daniel",
"suffix": ""
},
{
"first": "Thomas",
"middle": [
"L"
],
"last": "Navarro",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Griffiths",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"D"
],
"last": "Steyvers",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Lee",
"suffix": ""
}
],
"year": 2006,
"venue": "Journal of Mathematical Psychology",
"volume": "50",
"issue": "2",
"pages": "101--122",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daniel J. Navarro, Thomas L. Griffiths, Mark Steyvers, and Michael D. Lee. 2006. Modeling individual dif- ferences using dirichlet processes. Journal of Math- ematical Psychology, 50(2):101-122, April.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Markov Chain Sampling Methods for Dirichlet Process Mixture Models",
"authors": [
{
"first": "M",
"middle": [],
"last": "Radford",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Neal",
"suffix": ""
}
],
"year": 2000,
"venue": "Journal of Computational and Graphical Statistics",
"volume": "9",
"issue": "2",
"pages": "249--265",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Radford M. Neal. 2000. Markov Chain Sam- pling Methods for Dirichlet Process Mixture Mod- els. Journal of Computational and Graphical Statis- tics, 9(2):249-265, June.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "A theory of proximity based clustering: Structure detection by optimization",
"authors": [
{
"first": "Jan",
"middle": [],
"last": "Puzicha",
"suffix": ""
},
{
"first": "Thomas",
"middle": [],
"last": "Hofmann",
"suffix": ""
},
{
"first": "Joachim",
"middle": [],
"last": "Buhmann",
"suffix": ""
}
],
"year": 2000,
"venue": "Pattern Recognition",
"volume": "33",
"issue": "4",
"pages": "617--634",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jan Puzicha, Thomas Hofmann, and Joachim Buh- mann. 2000. A theory of proximity based clus- tering: Structure detection by optimization. Pattern Recognition, 33(4):617-634.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Objective criteria for the evaluation of clustering methods",
"authors": [
{
"first": "William",
"middle": [
"M"
],
"last": "Rand",
"suffix": ""
}
],
"year": 1971,
"venue": "Journal of the American Statistical Association",
"volume": "66",
"issue": "336",
"pages": "846--850",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "William M. Rand. 1971. Objective criteria for the eval- uation of clustering methods. Journal of the Ameri- can Statistical Association, 66(336):846-850.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Vmeasure: A conditional entropy-based external cluster evaluation measure",
"authors": [
{
"first": "Andrew",
"middle": [],
"last": "Rosenberg",
"suffix": ""
},
{
"first": "Julia",
"middle": [],
"last": "Hirschberg",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of EMNLP-CoNLL",
"volume": "",
"issue": "",
"pages": "410--420",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andrew Rosenberg and Julia Hirschberg. 2007. V- measure: A conditional entropy-based external clus- ter evaluation measure. In Proceedings of EMNLP- CoNLL, pages 410-420, Prague, Czech Republic.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Verb class discovery from rich syntactic data",
"authors": [
{
"first": "Lin",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Anna",
"middle": [],
"last": "Korhonen",
"suffix": ""
},
{
"first": "Yuval",
"middle": [],
"last": "Krymolowski",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 9th International Conference on Intelligent Text Processing and Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lin Sun, Anna Korhonen, and Yuval Krymolowski. 2008. Verb class discovery from rich syntactic data. In Proceedings of the 9th International Conference on Intelligent Text Processing and Computational Linguistics.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Unsupervised semantic role labelling",
"authors": [
{
"first": "Robert",
"middle": [
"S"
],
"last": "Swier",
"suffix": ""
},
{
"first": "Suzanne",
"middle": [],
"last": "Stevenson",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the 2004 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "95--102",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robert S. Swier and Suzanne Stevenson. 2004. Unsu- pervised semantic role labelling. In Proceedings of the 2004 Conference on Empirical Methods in Nat- ural Language Processing, pages 95-102.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "A hierarchical Bayesian language model based on Pitman-Yor processes",
"authors": [
{
"first": "Yee Whye",
"middle": [],
"last": "Teh",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of COLING-ACL",
"volume": "",
"issue": "",
"pages": "985--992",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yee Whye Teh. 2006. A hierarchical Bayesian lan- guage model based on Pitman-Yor processes. In Proceedings of COLING-ACL, pages 985-992, Syd- ney, Australia.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Dirichlet process mixture models for verb clustering",
"authors": [
{
"first": "Andreas",
"middle": [],
"last": "Vlachos",
"suffix": ""
},
{
"first": "Zoubin",
"middle": [],
"last": "Ghahramani",
"suffix": ""
},
{
"first": "Anna",
"middle": [],
"last": "Korhonen",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the ICML workshop on Prior Knowledge for Text and Language",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andreas Vlachos, Zoubin Ghahramani, and Anna Ko- rhonen. 2008. Dirichlet process mixture models for verb clustering. In Proceedings of the ICML work- shop on Prior Knowledge for Text and Language.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Clustering with instance-level constraints",
"authors": [
{
"first": "Kiri",
"middle": [],
"last": "Wagstaff",
"suffix": ""
},
{
"first": "Claire",
"middle": [],
"last": "Cardie",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the Seventeenth International Conference on Machine Learning",
"volume": "",
"issue": "",
"pages": "1103--1110",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kiri Wagstaff and Claire Cardie. 2000. Clustering with instance-level constraints. In Proceedings of the Seventeenth International Conference on Ma- chine Learning, pages 1103-1110, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Document clustering based on non-negative matrix factorization",
"authors": [
{
"first": "Wei",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Xin",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Yihong",
"middle": [],
"last": "Gong",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval",
"volume": "",
"issue": "",
"pages": "267--273",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wei Xu, Xin Liu, and Yihong Gong. 2003. Docu- ment clustering based on non-negative matrix factor- ization. In Proceedings of the 26th annual interna- tional ACM SIGIR conference on Research and de- velopment in informaion retrieval, pages 267-273, New York, NY, USA. ACM Press.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "Graphical representation of DPMMs."
},
"FIGREF1": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "Gibbs sampler incorporating must-links and cannot-links."
},
"TABREF1": {
"content": "<table/>",
"html": null,
"num": null,
"text": "motion\": 43.1 LIGHT EMISSION, 47.3 MODES OF BEING INVOLVING MOTION, and 51.3.2 RUN verbs: \u2022 class 22.2 AMALGAMATE: overlap \u2022 class 36.1 CORRESPOND: banter, concur, dissent, haggle \u2022 class 43.1 LIGHT EMISSION: flare, flicker, gleam, glisten, glow, shine, sparkle \u2022 class 47.3 MODES OF BEING INVOLVING MOTION: falter, flutter, quiver, swirl, wobble \u2022 class 51.3.2 RUN: fly, gallop, glide, jog, march, stroll, swim, travel, trot",
"type_str": "table"
},
"TABREF3": {
"content": "<table/>",
"html": null,
"num": null,
"text": "An overview of the data sets generated for qualitative analysis Preliminary work by",
"type_str": "table"
},
"TABREF5": {
"content": "<table/>",
"html": null,
"num": null,
"text": "Performance of constrained DPMMs incorporating pairwise links.",
"type_str": "table"
}
}
}
} |