File size: 94,561 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 | {
"paper_id": "P06-1044",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:25:34.636575Z"
},
"title": "Automatic Classification of Verbs in Biomedical Texts",
"authors": [
{
"first": "Anna",
"middle": [],
"last": "Korhonen",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Cambridge Computer",
"location": {
"addrLine": "Laboratory 15 JJ Thomson Avenue",
"postCode": "CB3 0GD",
"settlement": "Cambridge",
"country": "UK"
}
},
"email": ""
},
{
"first": "Yuval",
"middle": [],
"last": "Krymolowski",
"suffix": "",
"affiliation": {},
"email": "yuvalkr@cs.technion.ac.il"
},
{
"first": "Nigel",
"middle": [],
"last": "Collier",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "National Institute",
"location": {
"addrLine": "of Informatics Hitotsubashi 2-1-2 Chiyoda-ku",
"postCode": "101-8430",
"settlement": "Tokyo",
"country": "Japan"
}
},
"email": "collier@nii.ac.jp"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Lexical classes, when tailored to the application and domain in question, can provide an effective means to deal with a number of natural language processing (NLP) tasks. While manual construction of such classes is difficult, recent research shows that it is possible to automatically induce verb classes from cross-domain corpora with promising accuracy. We report a novel experiment where similar technology is applied to the important, challenging domain of biomedicine. We show that the resulting classification, acquired from a corpus of biomedical journal articles, is highly accurate and strongly domainspecific. It can be used to aid BIO-NLP directly or as useful material for investigating the syntax and semantics of verbs in biomedical texts.",
"pdf_parse": {
"paper_id": "P06-1044",
"_pdf_hash": "",
"abstract": [
{
"text": "Lexical classes, when tailored to the application and domain in question, can provide an effective means to deal with a number of natural language processing (NLP) tasks. While manual construction of such classes is difficult, recent research shows that it is possible to automatically induce verb classes from cross-domain corpora with promising accuracy. We report a novel experiment where similar technology is applied to the important, challenging domain of biomedicine. We show that the resulting classification, acquired from a corpus of biomedical journal articles, is highly accurate and strongly domainspecific. It can be used to aid BIO-NLP directly or as useful material for investigating the syntax and semantics of verbs in biomedical texts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Lexical classes which capture the close relation between the syntax and semantics of verbs have attracted considerable interest in NLP (Jackendoff, 1990; Levin, 1993; Dorr, 1997; Prescher et al., 2000) . Such classes are useful for their ability to capture generalizations about a range of linguistic properties. For example, verbs which share the meaning of 'manner of motion' (such as travel, run, walk), behave similarly also in terms of subcategorization (I traveled/ran/walked, I traveled/ran/walked to London, I traveled/ran/walked five miles) . Although the correspondence between the syntax and semantics of words is not perfect and the classes do not provide means for full semantic inferencing, their predictive power is nevertheless considerable.",
"cite_spans": [
{
"start": 135,
"end": 153,
"text": "(Jackendoff, 1990;",
"ref_id": "BIBREF24"
},
{
"start": 154,
"end": 166,
"text": "Levin, 1993;",
"ref_id": "BIBREF29"
},
{
"start": 167,
"end": 178,
"text": "Dorr, 1997;",
"ref_id": "BIBREF19"
},
{
"start": 179,
"end": 201,
"text": "Prescher et al., 2000)",
"ref_id": "BIBREF32"
},
{
"start": 459,
"end": 549,
"text": "(I traveled/ran/walked, I traveled/ran/walked to London, I traveled/ran/walked five miles)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "NLP systems can benefit from lexical classes in many ways. Such classes define the mapping from surface realization of arguments to predicateargument structure, and are therefore an important component of any system which needs the latter. As the classes can capture higher level abstractions they can be used as a means to abstract away from individual words when required. They are also helpful in many operational contexts where lexical information must be acquired from small application-specific corpora. Their predictive power can help compensate for lack of data fully exemplifying the behavior of relevant words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Lexical verb classes have been used to support various (multilingual) tasks, such as computational lexicography, language generation, machine translation, word sense disambiguation, semantic role labeling, and subcategorization acquisition (Dorr, 1997; Prescher et al., 2000; Korhonen, 2002) . However, large-scale exploitation of the classes in real-world or domain-sensitive tasks has not been possible because the existing classifications, e.g. (Levin, 1993) , are incomprehensive and unsuitable for specific domains.",
"cite_spans": [
{
"start": 240,
"end": 252,
"text": "(Dorr, 1997;",
"ref_id": "BIBREF19"
},
{
"start": 253,
"end": 275,
"text": "Prescher et al., 2000;",
"ref_id": "BIBREF32"
},
{
"start": 276,
"end": 291,
"text": "Korhonen, 2002)",
"ref_id": "BIBREF26"
},
{
"start": 448,
"end": 461,
"text": "(Levin, 1993)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "While manual classification of large numbers of words has proved difficult and time-consuming, recent research shows that it is possible to automatically induce lexical classes from corpus data with promising accuracy (Merlo and Stevenson, 2001 ; Brew and Schulte im Walde, 2002; Korhonen et al., 2003) . A number of ML methods have been applied to classify words using features pertaining to mainly syntactic structure (e.g. statistical distributions of subcategorization frames (SCFs) or general patterns of syntactic behaviour, e.g. transitivity, passivisability) which have been extracted from corpora using e.g. part-of-speech tagging or robust statistical parsing techniques. This research has been encouraging but it has so far concentrated on general language. Domainspecific lexical classification remains unexplored, although it is arguably important: existing classifications are unsuitable for domain-specific applications and these often challenging applications might benefit from improved performance by utilizing lexical classes the most.",
"cite_spans": [
{
"start": 218,
"end": 244,
"text": "(Merlo and Stevenson, 2001",
"ref_id": "BIBREF30"
},
{
"start": 267,
"end": 279,
"text": "Walde, 2002;",
"ref_id": "BIBREF15"
},
{
"start": 280,
"end": 302,
"text": "Korhonen et al., 2003)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we extend an existing approach to lexical classification (Korhonen et al., 2003) and apply it (without any domain specific tuning) to the domain of biomedicine. We focus on biomedicine for several reasons: (i) NLP is critically needed to assist the processing, mining and extraction of knowledge from the rapidly growing literature in this area, (ii) the domain lexical resources (e.g. UMLS metathesaurus and lexicon 1 ) do not provide sufficient information about verbs and (iii) being linguistically challenging, the domain provides a good test case for examining the potential of automatic classification.",
"cite_spans": [
{
"start": 72,
"end": 95,
"text": "(Korhonen et al., 2003)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We report an experiment where a classification is induced for 192 relatively frequent verbs from a corpus of 2230 biomedical journal articles. The results, evaluated with domain experts, show that the approach is capable of acquiring classes with accuracy higher than that reported in previous work on general language. We discuss reasons for this and show that the resulting classes differ substantially from those in extant lexical resources. They constitute the first syntactic-semantic verb classification for the biomedical domain and could be readily applied to support BIO-NLP.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We discuss the domain-specific issues related to our task in section 2. The approach to automatic classification is presented in section 3. Details of the experimental evaluation are supplied in section 4. Section 5 provides discussion and section 6 concludes with directions for future work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Recent years have seen a massive growth in the scientific literature in the domain of biomedicine. For example, the MEDLINE database 2 which currently contains around 16M references to journal articles, expands with 0.5M new references each year. Because future research in the biomedical sciences depends on making use of all this existing knowledge, there is a strong need for the develop-ment of NLP tools which can be used to automatically locate, organize and manage facts related to published experimental results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Biomedical Domain and Our Task",
"sec_num": "2"
},
{
"text": "In recent years, major progress has been made on information retrieval and on the extraction of specific relations e.g. between proteins and cell types from biomedical texts (Hirschman et al., 2002) . Other tasks, such as the extraction of factual information, remain a bigger challenge. This is partly due to the challenging nature of biomedical texts. They are complex both in terms of syntax and semantics, containing complex nominals, modal subordination, anaphoric links, etc.",
"cite_spans": [
{
"start": 174,
"end": 198,
"text": "(Hirschman et al., 2002)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Biomedical Domain and Our Task",
"sec_num": "2"
},
{
"text": "Researchers have recently began to use deeper NLP techniques (e.g. statistical parsing) in the domain because they are not challenged by the complex structures to the same extent than shallow techniques (e.g. regular expression patterns) are (Lease and Charniak, 2005) . However, deeper techniques require richer domain-specific lexical information for optimal performance than is provided by existing lexicons (e.g. UMLS). This is particularly important for verbs, which are central to the structure and meaning of sentences.",
"cite_spans": [
{
"start": 242,
"end": 268,
"text": "(Lease and Charniak, 2005)",
"ref_id": "BIBREF27"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Biomedical Domain and Our Task",
"sec_num": "2"
},
{
"text": "Where the lexical information is absent, lexical classes can compensate for it or aid in obtaining it in the ways described in section 1. Consider e.g. the INDICATE and ACTIVATE verb classes in Figure 1 . They capture the fact that their members are similar in terms of syntax and semantics: they have similar SCFs and selectional preferences, and they can be used to make similar statements which describe similar events. Such information can be used to build a richer lexicon capable of supporting key tasks such as parsing, predicate-argument identification, event extraction and the identification of biomedical (e.g. interaction) relations.",
"cite_spans": [],
"ref_spans": [
{
"start": 194,
"end": 202,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "The Biomedical Domain and Our Task",
"sec_num": "2"
},
{
"text": "While an abundance of work has been conducted on semantic classification of biomedical terms and nouns, less work has been done on the (manual or automatic) semantic classification of verbs in the biomedical domain (Friedman et al., 2002; Hatzivassiloglou and Weng, 2002; Spasic et al., 2005) . No previous work exists in this domain on the type of lexical (i.e. syntactic-semantic) verb classification this paper focuses on.",
"cite_spans": [
{
"start": 215,
"end": 238,
"text": "(Friedman et al., 2002;",
"ref_id": "BIBREF20"
},
{
"start": 239,
"end": 271,
"text": "Hatzivassiloglou and Weng, 2002;",
"ref_id": "BIBREF21"
},
{
"start": 272,
"end": 292,
"text": "Spasic et al., 2005)",
"ref_id": "BIBREF33"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Biomedical Domain and Our Task",
"sec_num": "2"
},
{
"text": "To get an initial idea about the differences between our target classification and a general language classification, we examined the extent to which individual verbs and their frequencies differ in biomedical and general language texts. We (Leech, 1992) . We calculated the Spearman rank correlation between the 1165 verbs which occurred in both corpora.",
"cite_spans": [
{
"start": 241,
"end": 254,
"text": "(Leech, 1992)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Biomedical Domain and Our Task",
"sec_num": "2"
},
{
"text": "The result was only a weak correlation: 0.37 \u00b1 0.03. When the scope was restricted to the 100 most frequent verbs in the biomedical data, the correlation was 0.12 \u00b1 0.10 which is only 1.2\u03c3 away from zero. The dissimilarity between the distributions is further indicated by the Kullback-Leibler distance of 0.97. Table 1 illustrates some of these big differences by showing the list of 15 most frequent verbs in the two corpora.",
"cite_spans": [],
"ref_spans": [
{
"start": 312,
"end": 319,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "The Biomedical Domain and Our Task",
"sec_num": "2"
},
{
"text": "We extended the system of Korhonen et al. (2003) with additional clustering techniques (introduced in sections 3.2.2 and 3.2.4) and used it to obtain the classification for the biomedical domain.",
"cite_spans": [
{
"start": 26,
"end": 48,
"text": "Korhonen et al. (2003)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "The system (i) extracts features from corpus data and (ii) clusters them using five different methods. These steps are described in the following two sections, respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "We employ as features distributions of SCFs specific to given verbs. We extract them from cor-pus data using the comprehensive subcategorization acquisition system of Briscoe and Carroll (1997) (Korhonen, 2002) . The system incorporates RASP, a domain-independent robust statistical parser (Briscoe and Carroll, 2002) , which tags, lemmatizes and parses data yielding complete though shallow parses and a SCF classifier which incorporates an extensive inventory of 163 verbal SCFs 3 . The SCFs abstract over specific lexically-governed particles and prepositions and specific predicate selectional preferences. In our work, we parameterized two high frequency SCFs for prepositions (PP and NP + PP SCFs). No filtering of potentially noisy SCFs was done to provide clustering with as much information as possible.",
"cite_spans": [
{
"start": 167,
"end": 193,
"text": "Briscoe and Carroll (1997)",
"ref_id": "BIBREF16"
},
{
"start": 194,
"end": 210,
"text": "(Korhonen, 2002)",
"ref_id": "BIBREF26"
},
{
"start": 290,
"end": 317,
"text": "(Briscoe and Carroll, 2002)",
"ref_id": "BIBREF17"
},
{
"start": 481,
"end": 482,
"text": "3",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Extraction",
"sec_num": "3.1"
},
{
"text": "The SCF frequency distributions constitute the input data to automatic classification. We experiment with five clustering methods: the simple hard nearest neighbours method and four probabilistic methods -two variants of Probabilistic Latent Semantic Analysis and two information theoretic methods (the Information Bottleneck and the Information Distortion).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Classification",
"sec_num": "3.2"
},
{
"text": "The first method collects the nearest neighbours (NN) of each verb. It (i) calculates the Jensen-Shannon divergence (JS) between the SCF distributions of each pair of verbs, (ii) connects each verb with the most similar other verb, and finally (iii) finds all the connected components. The NN method is very simple. It outputs only one clustering configuration and therefore does not allow examining different cluster granularities.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Nearest Neighbours",
"sec_num": "3.2.1"
},
{
"text": "The Probabilistic Latent Semantic Analysis (PLSA, Hoffman (2001) ) assumes a generative model for the data, defined by selecting (i) a verb verb i , (ii) a semantic class class k from the distribution p(Classes | verb i ), and (iii) a SCF scf j from the distribution p(SCFs | class k ). PLSA uses Expectation Maximization (EM) to find the distributionp(SCFs | Clusters, V erbs) which maximises the likelihood of the observed counts. It does this by minimising the cost function",
"cite_spans": [
{
"start": 50,
"end": 64,
"text": "Hoffman (2001)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Probabilistic Latent Semantic Analysis",
"sec_num": "3.2.2"
},
{
"text": "F = \u2212\u03b2 log Likelihood(p | data) + H(p) .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probabilistic Latent Semantic Analysis",
"sec_num": "3.2.2"
},
{
"text": "For \u03b2 = 1 minimising F is equivalent to the standard EM procedure while for \u03b2 < 1 the distributionp tends to be more evenly spread. We use \u03b2 = 1 (PLSA/EM) and \u03b2 = 0.75 (PLSA \u03b2=0.75 ). We currently \"harden\" the output and assign each verb to the most probable cluster only 4 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probabilistic Latent Semantic Analysis",
"sec_num": "3.2.2"
},
{
"text": "The Information Bottleneck (Tishby et al., 1999 ) (IB) is an information-theoretic method which controls the balance between: (i) the loss of information by representing verbs as clusters (I(Clusters; V erbs)), which has to be minimal, and (ii) the relevance of the output clusters for representing the SCF distribution (I(Clusters; SCFs)) which has to be maximal. The balance between these two quantities ensures optimal compression of data through clusters. The trade-off between the two constraints is realized through minimising the cost function:",
"cite_spans": [
{
"start": 27,
"end": 47,
"text": "(Tishby et al., 1999",
"ref_id": "BIBREF34"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Information Bottleneck",
"sec_num": "3.2.3"
},
{
"text": "LIB = I(Clusters; V erbs) \u2212 \u03b2I(Clusters; SCFs) ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Information Bottleneck",
"sec_num": "3.2.3"
},
{
"text": "where \u03b2 is a parameter that balances the constraints. IB takes three inputs: (i) SCF-verb distributions, (ii) the desired number of clusters K, and (iii) the initial value of \u03b2. It then looks for the minimal \u03b2 that decreases L IB compared to its value with the initial \u03b2, using the given K. IB delivers as output the probabilities p(K|V ). It gives an indication for the most informative number of output configurations: the ones for which the relevance information increases more sharply between K \u2212 1 and K clusters than between K and K + 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Information Bottleneck",
"sec_num": "3.2.3"
},
{
"text": "The Information Distortion method (Dimitrov and Miller, 2001 ) (ID) is otherwise similar to IB but L ID differs from L IB by an additional term that adds a bias towards clusters of similar size:",
"cite_spans": [
{
"start": 34,
"end": 60,
"text": "(Dimitrov and Miller, 2001",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Information Distortion",
"sec_num": "3.2.4"
},
{
"text": "L ID = \u2212H(Clusters | V erbs) \u2212 \u03b2I(Clusters; SCFs) = LIB \u2212 H(Clusters) .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Information Distortion",
"sec_num": "3.2.4"
},
{
"text": "ID yields more evenly divided clusters than IB.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Information Distortion",
"sec_num": "3.2.4"
},
{
"text": "We downloaded the data for our experiment from the MEDLINE database, from three of the 10 lead-ing journals in biomedicine: 1) Genes & Development (molecular biology, molecular genetics), 2) Journal of Biological Chemistry (biochemistry and molecular biology) and 3) Journal of Cell Biology (cellular structure and function). 2230 fulltext articles from years 2003-2004 were used. The data included 11.5M words and 323,307 sentences in total. 192 medium to high frequency verbs (with the minimum of 300 occurrences in the data) were selected for experimentation 5 . This test set was big enough to produce a useful classification but small enough to enable thorough evaluation in this first attempt to classify verbs in the biomedical domain.",
"cite_spans": [
{
"start": 562,
"end": 563,
"text": "5",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Data",
"sec_num": "4.1"
},
{
"text": "The data was first processed using the feature extraction module. 233 (preposition-specific) SCF types appeared in the resulting lexicon, 36 per verb on average. 6 The classification module was then applied. NN produced K nn = 42 clusters. From the other methods we requested K = 2 to 60 clusters. We chose for evaluation the outputs corresponding to the most informative values of K: 20, 33, 53 for IB, and 17, 33, 53 for ID.",
"cite_spans": [
{
"start": 162,
"end": 163,
"text": "6",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Processing the Data",
"sec_num": "4.2"
},
{
"text": "Because no target lexical classification was available for the biomedical domain, human experts (4 domain experts and 2 linguists) were used to create the gold standard. They were asked to examine whether the test verbs similar in terms of their syntactic properties (i.e. verbs with similar SCF distributions) are similar also in terms of semantics (i.e. they share a common meaning). Where this was the case, a verb class was identified and named. The domain experts examined the 116 verbs whose analysis required domain knowledge (e.g. activate, solubilize, harvest), while the linguists analysed the remaining 76 general or scientific text verbs (e.g. demonstrate, hypothesize, appear). The linguists used Levin (1993) classes as gold standard classes whenever possible and created novel ones when needed. The domain experts used two purely semantic classifications of biomedical verbs (Friedman et al., 2002; Spasic et al., 2005) 7 as a starting point where this was pos- The experts created a 3-level gold standard which includes both broad and finer-grained classes. Only those classes / memberships were included which all the experts (in the two teams) agreed on. 9 The resulting gold standard including 16, 34 and 50 classes is illustrated in table 2 with 1-2 example verbs per class. The table indicates which classes were created by domain experts (BIO) and which by linguists (GEN). Each class was associated with 1-30 member verbs 10 . The total number of verbs is indicated in the table (e.g. 10 for PERFORM class).",
"cite_spans": [
{
"start": 710,
"end": 722,
"text": "Levin (1993)",
"ref_id": "BIBREF29"
},
{
"start": 890,
"end": 913,
"text": "(Friedman et al., 2002;",
"ref_id": "BIBREF20"
},
{
"start": 914,
"end": 934,
"text": "Spasic et al., 2005)",
"ref_id": "BIBREF33"
},
{
"start": 1173,
"end": 1174,
"text": "9",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Gold Standard",
"sec_num": "4.3"
},
{
"text": "The clusters were evaluated against the gold standard using measures which are applicable to all the 8 Purely semantic classes tend to be finer-grained than lexical classes and not necessarily syntactic in nature. Only these two classifications were found to be similar enough to our target classification to provide a useful starting point. Section 5 includes a summary of the similarities/differences between our gold standard and these other classifications.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "9 Experts were allowed to discuss the problematic cases to obtain maximal accuracy -hence no inter-annotator agreement is reported.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "10 The minimum of 2 member verbs were required at the coarser-grained levels of 16 and 34 classes. classification methods and which deliver a numerical value easy to interpret.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "The first measure, the adjusted pairwise precision, evaluates clusters in terms of verb pairs:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "APP = 1 K K i=1 num. of correct pairs in k i num. of pairs in k i \u2022 |k i |\u22121 |k i |+1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "APP is the average proportion of all withincluster pairs that are correctly co-assigned. Multiplied by a factor that increases with cluster size it compensates for a bias towards small clusters.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "The second measure is modified purity, a global measure which evaluates the mean precision of clusters. Each cluster is associated with its prevalent class. The number of verbs in a cluster K that take this class is denoted by n prevalent (K). Verbs that do not take it are considered as errors. Clusters where n prevalent (K) = 1 are disregarded as not to introduce a bias towards singletons:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "mPUR = n prevalent (k i )\u22652 n prevalent (k i ) number of verbs",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "The third measure is the weighted class accuracy, the proportion of members of dominant clusters DOM-CLUST i within all classes c i .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "ACC = C i=1 verbs in DOM-CLUST i",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "number of verbs mPUR can be seen to measure the precision of clusters and ACC the recall. We define an F measure as the harmonic mean of mPUR and ACC:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "F = 2 \u2022 mPUR \u2022 ACC mPUR + ACC",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "The statistical significance of the results is measured by randomisation tests where verbs are swapped between the clusters and the resulting clusters are evaluated. The swapping is repeated 100 times for each output and the average av swaps and the standard deviation \u03c3 swaps is measured. The significance is the scaled difference signif = (result \u2212 av swaps )/\u03c3 swaps . Table 3 shows the performance of the five clustering methods for K = 42 clusters (as produced by the NN method) at the 3 levels of gold standard classification. Although the two PLSA variants (particularly PLSA \u03b2=0.75 ) produce a fairly accurate coarse grained classification, they perform worse than all the other methods at the finergrained levels of gold standard, particularly according to the global measures. Being based on 81 86 39 53 64 74 62 67 54 67 73 69 IB 74 88 47 61 61 76 74 75 55 69 87 76 ID 79 89 37 52 63 78 65 70 53 70 77 73 PLSA/EM 55 72 49 58 43 53 61 57 35 47 66 55 PLSA \u03b2=0.75 65 71 68 70 53 48 76 58 41 34 77 47 The differences are smaller in mPUR (yet significant: 2\u03c3 between NN and IB and 3\u03c3 between NN and ID) but more notable in ACC (which is e.g. 8 \u2212 12% better for IB than for NN). Also the F results suggest that the two information theoretic methods are better overall than the simple NN method. IB and ID also have the advantage (over NN) that they can be used to produce a hierarchical verb classification. Table 4 shows the results for IB and ID for the informative values of K. The bold font indicates the results when the match between the values of K and the number of classes at the particular level of the gold standard is the closest.",
"cite_spans": [],
"ref_spans": [
{
"start": 372,
"end": 379,
"text": "Table 3",
"ref_id": "TABREF4"
},
{
"start": 802,
"end": 1078,
"text": "81 86 39 53 64 74 62 67 54 67 73 69 IB 74 88 47 61 61 76 74 75 55 69 87 76 ID 79 89 37 52 63 78 65 70 53 70 77 73 PLSA/EM 55 72 49 58 43 53 61 57 35 47 66 55 PLSA \u03b2=0.75 65 71 68 70 53 48 76 58 41 34 77 47",
"ref_id": "TABREF1"
},
{
"start": 1484,
"end": 1491,
"text": "Table 4",
"ref_id": "TABREF5"
}
],
"eq_spans": [],
"section": "Measures",
"sec_num": "4.4"
},
{
"text": "IB is clearly better than ID at all levels of gold standard. It yields its best results at the medium level (34 classes) with K = 33: F = 77 and APP = 69 (the results for ID are F = 72 and APP = 65). At the most fine-grained level (50 classes), IB is equally good according to F with K = 33, but APP is 8% lower. Although ID is occasionally better than IB according to APP and mPUR (see e.g. the results for 16 classes with K = 53) this never happens in the case where the correspondence between the number of gold standard classes and the values of K is the closest. In other words, the informative values of K prove really informative for IB. The lower performance of ID seems to be due to its tendency to create evenly sized clusters.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results from Quantitative Evaluation",
"sec_num": "4.5"
},
{
"text": "All the methods perform significantly better than our random baseline. The significance of the results with respect to two swaps was at the 2\u03c3 level, corresponding to a 97% confidence that the results are above random.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results from Quantitative Evaluation",
"sec_num": "4.5"
},
{
"text": "We performed further, qualitative analysis of clusters produced by the best performing method IB.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Qualitative Evaluation",
"sec_num": "4.6"
},
{
"text": "A: inject, transfect, microinfect, contransfect (6) B: harvest, select, collect (7.1) centrifuge, process, recover (7.2) C: wash, rinse (4.1.1) immunoblot ( When looking at coarse-grained outputs, interestingly, K as low as 8 learned the broad distinction between biomedical and general language verbs (the two verb types appeared only rarely in the same clusters) and produced large semantically meaningful groups of classes (e.g. the coarse-grained classes EXPERIMENTAL PROCE-DURES, TRANSFECT and COLLECT were mapped together). K = 12 was sufficient to identify several classes with very particular syntax One of them was TRANSFECT (see A above) whose members were distinguished easily because of their typical SCFs (e.g. inject /transfect/microinfect/contransfect X with/into Y).",
"cite_spans": [
{
"start": 136,
"end": 143,
"text": "(4.1.1)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Consider the following clusters:",
"sec_num": null
},
{
"text": "On the other hand, even K = 53 could not identify classes with very similar (yet un-identical) syntax. These included many semantically similar sub-classes (e.g. the two sub-classes of COLLECT shown in B whose members take similar NP and PP SCFs). However, also a few semantically different verbs clustered wrongly because of this reason, such as the ones exemplified in C. In C, immunoblot (from the LABEL class) is still somewhat related to wash and rinse (the WASH class) because they all belong to the larger EXPERIMENTAL PRO-CEDURES class, but overlap (from the PROCESS class) shows up in the cluster merely because of syntactic idiosyncracy.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Consider the following clusters:",
"sec_num": null
},
{
"text": "While parser errors caused by the challenging biomedical texts were visible in some SCFs (e.g. looking at a sample of SCFs, some adjunct instances were listed in the argument slots of the frames), the cases where this resulted in incorrect classification were not numerous 11 .",
"cite_spans": [
{
"start": 273,
"end": 275,
"text": "11",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Consider the following clusters:",
"sec_num": null
},
{
"text": "One representative singleton resulting from these errors is exemplified in D. Activate appears in relatively complicated sentence structures, which gives rise to incorrect SCFs. For example, MECs cultured on 2D planar substrates transiently activate MAP kinase in response to EGF, whereas... gets incorrectly analysed as SCF NP-NP, while The effect of the constitutively activated ARF6-Q67L mutant was investigated... receives the incorrect SCF analysis NP-SCOMP. Most parser errors are caused by unknown domainspecific words and phrases.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Consider the following clusters:",
"sec_num": null
},
{
"text": "Due to differences in the task and experimental setup, direct comparison of our results with previously published ones is impossible. The closest possible comparison point is (Korhonen et al., 2003) which reported 50-59% mPUR and 15-19% APP on using IB to assign 110 polysemous (general language) verbs into 34 classes. Our results are substantially better, although we made no effort to restrict our scope to monosemous verbs 12 and although we focussed on a linguistically challenging domain.",
"cite_spans": [
{
"start": 175,
"end": 198,
"text": "(Korhonen et al., 2003)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "5"
},
{
"text": "It seems that our better result is largely due to the higher uniformity of verb senses in the biomedical domain. We could not investigate this effect systematically because no manually sense 11 This is partly because the mistakes of the parser are somewhat consistent (similar for similar verbs) and partly because the SCFs gather data from hundreds of corpus instances, many of which are analysed correctly.",
"cite_spans": [
{
"start": 191,
"end": 193,
"text": "11",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "5"
},
{
"text": "12 Most of our test verbs are polysemous according to WordNet (WN) (Miller, 1990) , but this is not a fully reliable indication because WN is not specific to this domain. annotated data (or a comprehensive list of verb senses) exists for the domain. However, examination of a number of corpus instances suggests that the use of verbs is fairly conventionalized in our data 13 . Where verbs show less sense variation, they show less SCF variation, which aids the discovery of verb classes. Korhonen et al. (2003) observed the opposite with general language data.",
"cite_spans": [
{
"start": 67,
"end": 81,
"text": "(Miller, 1990)",
"ref_id": "BIBREF31"
},
{
"start": 373,
"end": 375,
"text": "13",
"ref_id": "BIBREF3"
},
{
"start": 489,
"end": 511,
"text": "Korhonen et al. (2003)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "5"
},
{
"text": "We examined, class by class, to what extent our domain-specific gold standard differs from the related general (Levin, 1993) and domain classifications (Spasic et al., 2005; Friedman et al., 2002) (recall that the latter were purely semantic classifications as no lexical ones were available for biomedicine):",
"cite_spans": [
{
"start": 111,
"end": 124,
"text": "(Levin, 1993)",
"ref_id": "BIBREF29"
},
{
"start": 152,
"end": 173,
"text": "(Spasic et al., 2005;",
"ref_id": "BIBREF33"
},
{
"start": 174,
"end": 196,
"text": "Friedman et al., 2002)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "5"
},
{
"text": "33 (of the 50) classes in the gold standard are biomedical. Only 6 of these correspond (fully or mostly) to the semantic classes in the domain classifications. 17 are unrelated to any of the classes in Levin (1993) while 16 bear vague resemblance to them (e.g. our TRANSPORT verbs are also listed under Levin's SEND verbs) but are too different (semantically and syntactically) to be combined.",
"cite_spans": [
{
"start": 202,
"end": 214,
"text": "Levin (1993)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "5"
},
{
"text": "17 (of the 50) classes are general (scientific) classes. 4 of these are absent in Levin (e.g. QUAN-TITATE) . 13 are included in Levin, but 8 of them have a more restricted sense (and fewer members) than the corresponding Levin class. Only the remaining 5 classes are identical (in terms of members and their properties) to Levin classes.",
"cite_spans": [
{
"start": 94,
"end": 106,
"text": "QUAN-TITATE)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "5"
},
{
"text": "These results highlight the importance of building or tuning lexical resources specific to different domains, and demonstrate the usefulness of automatic lexical acquisition for this work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "5"
},
{
"text": "This paper has shown that current domainindependent NLP and ML technology can be used to automatically induce a relatively high accuracy verb classification from a linguistically challenging corpus of biomedical texts. The lexical classification resulting from our work is strongly domain-specific (it differs substantially from previous ones) and it can be readily used to aid BIO-NLP. It can provide useful material for investigating the syntax and semantics of verbs in biomedical data or for supplementing existing domain lexical resources with additional information (e.g. semantic classifications with additional member verbs). Lexical resources enriched with verb class information can, in turn, better benefit practical tasks such as parsing, predicate-argument identification, event extraction, identification of biomedical relation patterns, among others.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "6"
},
{
"text": "In the future, we plan to improve the accuracy of automatic classification by seeding it with domain-specific information (e.g. using named entity recognition and anaphoric linking techniques similar to those of Vlachos et al. (2006) ). We also plan to conduct a bigger experiment with a larger number of verbs and demonstrate the usefulness of the bigger classification for practical BIO-NLP application tasks. In addition, we plan to apply similar technology to other interesting domains (e.g. tourism, law, astronomy). This will not only enable us to experiment with cross-domain lexical class variation but also help to determine whether automatic acquisition techniques benefit, in general, from domain-specific tuning.",
"cite_spans": [
{
"start": 212,
"end": 233,
"text": "Vlachos et al. (2006)",
"ref_id": "BIBREF35"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "6"
},
{
"text": "http://www.nlm.nih.gov/research/umls 2 http://www.ncbi.nlm.nih.gov/PubMed/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "See http://www.cl.cam.ac.uk/users/alk23/subcat/subcat.html for further detail.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The same approach was used with the information theoretic methods. It made sense in this initial work on biomedical classification. In the future we could use soft clustering a means to investigate polysemy.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "230 verbs were employed initially but 38 were dropped later so that each (coarse-grained) class would have the minimum of 2 members in the gold standard.6 This number is high because no filtering of potentially noisy SCFs was done.7 See http://www.cbr-masterclass.org.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The different sub-domains of the biomedical domain may, of course, be even more conventionalized(Friedman et al., 2002).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to thank Yoko Mizuta, Shoko Kawamato, Sven Demiya, and Parantu Shah for their help in creating the gold standard.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgement",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Activate / Inactivate Between Molecules",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Activate / Inactivate Between Molecules (BIO/20)",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Change activity: activate, inhibit 8.1 Binding: bind, attach 1.1.2 Suppress: suppress, repress 8.2 Translocate and Segregate 1.1.3 Stimulate: stimulate 8.2.1 Translocate: shift",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "1.1 Change activity: activate, inhibit 8.1 Binding: bind, attach 1.1.2 Suppress: suppress, repress 8.2 Translocate and Segregate 1.1.3 Stimulate: stimulate 8.2.1 Translocate: shift, switch 1.1.4 Inactivate: delay, diminish 8.2.2 Segregate: segregate, export",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Modulate: stabilize, modulate 8.3.1 Transport: deliver",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Modulate: stabilize, modulate 8.3.1 Transport: deliver, transmit 1.2.2 Regulate: control, support 8.3.2 Link: connect, map",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Increase / decrease: increase",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Increase / decrease: increase, decrease 9 Report (GEN/30)",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Modify: modify, catalyze 9.1 Investigate 2 Biochemical events (BIO/12) 9.1.1 Examine: evaluate, analyze",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Modify: modify, catalyze 9.1 Investigate 2 Biochemical events (BIO/12) 9.1.1 Examine: evaluate, analyze",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Confirm: verify, determine 2.2.1 Biochemical modification: 9.2 Suggest dephosphorylate",
"authors": [],
"year": null,
"venue": "",
"volume": "1",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Express: express, overexpress 9.1.2 Establish: test, investigate 2.2 Modification 9.1.3 Confirm: verify, determine 2.2.1 Biochemical modification: 9.2 Suggest dephosphorylate, phosphorylate 9.2.1 Presentational: 2.2.2 Cleave: cleave hypothesize, conclude",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Removal (BIO/6) consider, believe",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Removal (BIO/6) consider, believe",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Quantitate: quantify, measure 4.1.1 Wash: wash, rinse 10.1.2 Calculate: calculate",
"authors": [],
"year": null,
"venue": "Experimental Procedures",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Experimental Procedures (BIO/30) 10.1 Quantify 4.1 Prepare 10.1.1 Quantitate: quantify, measure 4.1.1 Wash: wash, rinse 10.1.2 Calculate: calculate, record 4.1.2 Mix: mix 10.1.3 Conduct: perform, conduct 4.1.3 Label: stain, immunoblot 10.2 Score: score, count 4.1.4 Incubate: preincubate, incubate 11 Release (BIO/4): detach, dissociate 4.1.5 Elute: elute 12 Use (GEN/4): utilize, employ",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Precipitate: coprecipitate 13 Include (GEN/11) coimmunoprecipitate 13.1 Encompass: encompass, span",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Precipitate: coprecipitate 13 Include (GEN/11) coimmunoprecipitate 13.1 Encompass: encompass, span",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Solubilize: solubilize,lyse 13.2 Include: contain, carry",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Solubilize: solubilize,lyse 13.2 Include: contain, carry",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Dissolve: homogenize, dissolve 14 Call (GEN/3): name, designate",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dissolve: homogenize, dissolve 14 Call (GEN/3): name, designate",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Place: load",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Place: load, mount 15 Move (GEN/12)",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Process (BIO/5): linearize, overlap 15.1 Proceed",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Process (BIO/5): linearize, overlap 15.1 Proceed:",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "BIO/4): inject, microinject progress",
"authors": [
{
"first": "",
"middle": [],
"last": "Transfect",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Transfect (BIO/4): inject, microinject progress, proceed",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Collect: harvest, select arise, emerge",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Collect: harvest, select arise, emerge",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Spectral clustering for German verbs",
"authors": [
{
"first": "C",
"middle": [],
"last": "References",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Brew",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Schulte Im Walde",
"suffix": ""
}
],
"year": 2002,
"venue": "Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "References C. Brew and S. Schulte im Walde. 2002. Spectral clustering for German verbs. In Conference on Em- pirical Methods in Natural Language Processing, Philadelphia, USA.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Automatic extraction of subcategorization from corpora",
"authors": [
{
"first": "E",
"middle": [
"J"
],
"last": "Briscoe",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Carroll",
"suffix": ""
}
],
"year": 1997,
"venue": "5 th ACL Conference on Applied Natural Language Processing",
"volume": "",
"issue": "",
"pages": "356--363",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "E. J. Briscoe and J. Carroll. 1997. Automatic extrac- tion of subcategorization from corpora. In 5 th ACL Conference on Applied Natural Language Process- ing, pages 356-363, Washington DC.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Robust accurate statistical annotation of general text",
"authors": [
{
"first": "E",
"middle": [
"J"
],
"last": "Briscoe",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Carroll",
"suffix": ""
}
],
"year": 2002,
"venue": "3 rd International Conference on Language Resources and Evaluation",
"volume": "",
"issue": "",
"pages": "1499--1504",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "E. J. Briscoe and J. Carroll. 2002. Robust accurate statistical annotation of general text. In 3 rd Interna- tional Conference on Language Resources and Eval- uation, pages 1499-1504, Las Palmas, Gran Ca- naria.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Neural coding and decoding: communication channels and quantization",
"authors": [
{
"first": "A",
"middle": [
"G"
],
"last": "Dimitrov",
"suffix": ""
},
{
"first": "J",
"middle": [
"P"
],
"last": "Miller",
"suffix": ""
}
],
"year": 2001,
"venue": "Network: Computation in Neural Systems",
"volume": "12",
"issue": "4",
"pages": "441--472",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. G. Dimitrov and J. P. Miller. 2001. Neural coding and decoding: communication channels and quanti- zation. Network: Computation in Neural Systems, 12(4):441-472.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Large-scale dictionary construction for foreign language tutoring and interlingual machine translation",
"authors": [
{
"first": "B",
"middle": [],
"last": "Dorr",
"suffix": ""
}
],
"year": 1997,
"venue": "Machine Translation",
"volume": "12",
"issue": "4",
"pages": "271--325",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "B. Dorr. 1997. Large-scale dictionary construction for foreign language tutoring and interlingual machine translation. Machine Translation, 12(4):271-325.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Two biomedical sublanguages: a description based on the theories of Zellig Harris",
"authors": [
{
"first": "C",
"middle": [],
"last": "Friedman",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Kra",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Rzhetsky",
"suffix": ""
}
],
"year": 2002,
"venue": "Journal of Biomedical Informatics",
"volume": "35",
"issue": "4",
"pages": "222--235",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "C. Friedman, P. Kra, and A. Rzhetsky. 2002. Two biomedical sublanguages: a description based on the theories of Zellig Harris. Journal of Biomedical In- formatics, 35(4):222-235.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Learning anchor verbs for biological interaction patterns from published text articles",
"authors": [
{
"first": "V",
"middle": [],
"last": "Hatzivassiloglou",
"suffix": ""
},
{
"first": "W",
"middle": [],
"last": "Weng",
"suffix": ""
}
],
"year": 2002,
"venue": "International Journal of Medical Inf",
"volume": "67",
"issue": "",
"pages": "19--32",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "V. Hatzivassiloglou and W. Weng. 2002. Learning an- chor verbs for biological interaction patterns from published text articles. International Journal of Medical Inf., 67:19-32.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Accomplishments and challenges in literature data mining for biology",
"authors": [
{
"first": "L",
"middle": [],
"last": "Hirschman",
"suffix": ""
},
{
"first": "J",
"middle": [
"C"
],
"last": "Park",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Tsujii",
"suffix": ""
},
{
"first": "L",
"middle": [],
"last": "Wong",
"suffix": ""
},
{
"first": "C",
"middle": [
"H"
],
"last": "Wu",
"suffix": ""
}
],
"year": 2002,
"venue": "Journal of Bioinformatics",
"volume": "18",
"issue": "12",
"pages": "1553--1561",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "L. Hirschman, J. C. Park, J. Tsujii, L. Wong, and C. H. Wu. 2002. Accomplishments and challenges in lit- erature data mining for biology. Journal of Bioin- formatics, 18(12):1553-1561.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Unsupervised learning by probabilistic latent semantic analysis",
"authors": [
{
"first": "T",
"middle": [],
"last": "Hoffman",
"suffix": ""
}
],
"year": 2001,
"venue": "Machine Learning",
"volume": "42",
"issue": "",
"pages": "177--196",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "T. Hoffman. 2001. Unsupervised learning by proba- bilistic latent semantic analysis. Machine Learning, 42(1):177-196.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Semantic Structures",
"authors": [
{
"first": "R",
"middle": [],
"last": "Jackendoff",
"suffix": ""
}
],
"year": 1990,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Jackendoff. 1990. Semantic Structures. MIT Press, Cambridge, Massachusetts.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Clustering polysemic subcategorization frame distributions semantically",
"authors": [
{
"first": "A",
"middle": [],
"last": "Korhonen",
"suffix": ""
},
{
"first": "Y",
"middle": [],
"last": "Krymolowski",
"suffix": ""
},
{
"first": "Z",
"middle": [],
"last": "Marx",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "64--71",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Korhonen, Y. Krymolowski, and Z. Marx. 2003. Clustering polysemic subcategorization frame distri- butions semantically. In Proceedings of the 41st An- nual Meeting of the Association for Computational Linguistics, pages 64-71, Sapporo, Japan.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Subcategorization Acquisition",
"authors": [
{
"first": "A",
"middle": [],
"last": "Korhonen",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Korhonen. 2002. Subcategorization Acquisition. Ph.D. thesis, University of Cambridge, UK.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Parsing biomedical literature",
"authors": [
{
"first": "M",
"middle": [],
"last": "Lease",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Charniak",
"suffix": ""
}
],
"year": 2005,
"venue": "Second International Joint Conference on Natural Language Processing",
"volume": "",
"issue": "",
"pages": "58--69",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Lease and E. Charniak. 2005. Parsing biomedical literature. In Second International Joint Conference on Natural Language Processing, pages 58-69.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "100 million words of English: the British National Corpus",
"authors": [
{
"first": "G",
"middle": [],
"last": "Leech",
"suffix": ""
}
],
"year": 1992,
"venue": "Language Research",
"volume": "28",
"issue": "1",
"pages": "1--13",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "G. Leech. 1992. 100 million words of English: the British National Corpus. Language Research, 28(1):1-13.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "English Verb Classes and Alternations",
"authors": [
{
"first": "B",
"middle": [],
"last": "Levin",
"suffix": ""
}
],
"year": 1993,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "B. Levin. 1993. English Verb Classes and Alterna- tions. Chicago University Press, Chicago.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Automatic verb classification based on statistical distributions of argument structure",
"authors": [
{
"first": "P",
"middle": [],
"last": "Merlo",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Stevenson",
"suffix": ""
}
],
"year": 2001,
"venue": "Computational Linguistics",
"volume": "27",
"issue": "3",
"pages": "373--408",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "P. Merlo and S. Stevenson. 2001. Automatic verb classification based on statistical distributions of argument structure. Computational Linguistics, 27(3):373-408.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "WordNet: An on-line lexical database",
"authors": [
{
"first": "G",
"middle": [
"A"
],
"last": "Miller",
"suffix": ""
}
],
"year": 1990,
"venue": "International Journal of Lexicography",
"volume": "3",
"issue": "4",
"pages": "235--312",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "G. A. Miller. 1990. WordNet: An on-line lexical database. International Journal of Lexicography, 3(4):235-312.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Using a probabilistic class-based lexicon for lexical ambiguity resolution",
"authors": [
{
"first": "D",
"middle": [],
"last": "Prescher",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Riezler",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Rooth",
"suffix": ""
}
],
"year": 2000,
"venue": "18th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "649--655",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "D. Prescher, S. Riezler, and M. Rooth. 2000. Using a probabilistic class-based lexicon for lexical am- biguity resolution. In 18th International Confer- ence on Computational Linguistics, pages 649-655, Saarbr\u00fccken, Germany.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Masterclass: A case-based reasoning system for the classification of biomedical terms",
"authors": [
{
"first": "I",
"middle": [],
"last": "Spasic",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Ananiadou",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Tsujii",
"suffix": ""
}
],
"year": 2005,
"venue": "Journal of Bioinformatics",
"volume": "21",
"issue": "11",
"pages": "2748--2758",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "I. Spasic, S. Ananiadou, and J. Tsujii. 2005. Master- class: A case-based reasoning system for the clas- sification of biomedical terms. Journal of Bioinfor- matics, 21(11):2748-2758.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "The information bottleneck method",
"authors": [
{
"first": "N",
"middle": [],
"last": "Tishby",
"suffix": ""
},
{
"first": "F",
"middle": [
"C"
],
"last": "Pereira",
"suffix": ""
},
{
"first": "W",
"middle": [],
"last": "Bialek",
"suffix": ""
}
],
"year": 1999,
"venue": "Proc. of the 37 th Annual Allerton Conference on Communication, Control and Computing",
"volume": "",
"issue": "",
"pages": "368--377",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "N. Tishby, F. C. Pereira, and W. Bialek. 1999. The information bottleneck method. In Proc. of the 37 th Annual Allerton Conference on Communica- tion, Control and Computing, pages 368-377.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "Bootstrapping the recognition and anaphoric linking of named entitites in drosophila articles",
"authors": [
{
"first": "A",
"middle": [],
"last": "Vlachos",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Gasperin",
"suffix": ""
},
{
"first": "I",
"middle": [],
"last": "Lewin",
"suffix": ""
},
{
"first": "E",
"middle": [
"J"
],
"last": "Briscoe",
"suffix": ""
}
],
"year": 2006,
"venue": "Pacific Symposium in Biocomputing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Vlachos, C. Gasperin, I. Lewin, and E. J. Briscoe. 2006. Bootstrapping the recognition and anaphoric linking of named entitites in drosophila articles. In Pacific Symposium in Biocomputing.",
"links": null
}
},
"ref_entries": {
"TABREF1": {
"html": null,
"text": "",
"content": "<table/>",
"num": null,
"type_str": "table"
},
"TABREF2": {
"html": null,
"text": "The gold standard classification with a few example verbs per class sible (i.e. where they included our test verbs and also captured their relevant senses) 8 .",
"content": "<table/>",
"num": null,
"type_str": "table"
},
"TABREF4": {
"html": null,
"text": "The performance of the NN, PLSA, IB and ID methods with K nn = 42 clusters",
"content": "<table><tr><td/><td/><td colspan=\"2\">16 Classes</td><td/><td/><td colspan=\"2\">34 Classes</td><td/><td/><td colspan=\"2\">50 Classes</td><td/></tr><tr><td>K</td><td>APP</td><td colspan=\"3\">mPUR ACC F</td><td>APP</td><td colspan=\"3\">mPUR ACC F</td><td>APP</td><td colspan=\"3\">mPUR ACC F</td></tr><tr><td>20 IB</td><td>74</td><td>77</td><td>66</td><td>71</td><td>60</td><td>56</td><td>86</td><td>67</td><td>54</td><td>48</td><td>93</td><td>63</td></tr><tr><td>17 ID</td><td>67</td><td>76</td><td>60</td><td>67</td><td>43</td><td>56</td><td>81</td><td>66</td><td>34</td><td>46</td><td>91</td><td>61</td></tr><tr><td>33 IB</td><td>78</td><td>87</td><td>52</td><td>65</td><td>69</td><td>75</td><td>81</td><td>77</td><td>61</td><td>67</td><td>93</td><td>77</td></tr><tr><td>ID</td><td>81</td><td>88</td><td>43</td><td>57</td><td>65</td><td>75</td><td>70</td><td>72</td><td>54</td><td>67</td><td>82</td><td>73</td></tr><tr><td>53 IB</td><td>71</td><td>87</td><td>41</td><td>55</td><td>61</td><td>78</td><td>66</td><td>71</td><td>54</td><td>72</td><td>79</td><td>75</td></tr><tr><td>ID</td><td>79</td><td>89</td><td>33</td><td>48</td><td>66</td><td>79</td><td>55</td><td>64</td><td>53</td><td>72</td><td>68</td><td>69</td></tr></table>",
"num": null,
"type_str": "table"
},
"TABREF5": {
"html": null,
"text": "The performance of IB and ID for the 3 levels of class hierarchy for informative values of K pairwise similarities, NN shows mostly better performance than IB and ID on the pairwise measure APP but the global measures are better for IB and ID.",
"content": "<table/>",
"num": null,
"type_str": "table"
}
}
}
} |