File size: 69,405 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 |
{
"paper_id": "I08-1015",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T07:41:23.145279Z"
},
"title": "Lexical Chains as Document Features",
"authors": [
{
"first": "Dinakar",
"middle": [],
"last": "Jayarajan",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Dipti",
"middle": [],
"last": "Deodhare",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "B",
"middle": [],
"last": "Ravindran",
"suffix": "",
"affiliation": {},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Document clustering and classification is usually done by representing the documents using a bag of words scheme. This scheme ignores many of the linguistic and semantic features contained in text documents. We propose here an alternative representation for documents using Lexical Chains. We compare the performance of the new representation against the old one on a clustering task. We show that Lexical Chain based features give better results than the Bag of Words based features, while achieving almost 30% reduction in the dimensionality of the feature vectors resulting in faster execution of the algorithms.",
"pdf_parse": {
"paper_id": "I08-1015",
"_pdf_hash": "",
"abstract": [
{
"text": "Document clustering and classification is usually done by representing the documents using a bag of words scheme. This scheme ignores many of the linguistic and semantic features contained in text documents. We propose here an alternative representation for documents using Lexical Chains. We compare the performance of the new representation against the old one on a clustering task. We show that Lexical Chain based features give better results than the Bag of Words based features, while achieving almost 30% reduction in the dimensionality of the feature vectors resulting in faster execution of the algorithms.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Text data usually contains complex semantic information which is communicated using a combination of words. Ideally, the representation used should capture and reflect this fact in order to semantically drive the clustering algorithm and obtain better results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The Bag of Words (BoW) (Salton et al., 1975 ) scheme is a very popular scheme which has been used for representing documents. But, this scheme ignores many of the linguistic and semantic features contained in text documents. This paper explores an alternative representation for documents, using lexical chains, which encodes some of the semantic information contained in the document. This representation results in improved performance on the clustering tasks and achieves a drastic reduction in the size of the feature space as well.",
"cite_spans": [
{
"start": 23,
"end": 43,
"text": "(Salton et al., 1975",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The BoW scheme was originally designed for the Information Retrieval domain (Salton, 1989) where the aim was to 'index' the document and not necessarily to model the topic distribution. This representation has since been adopted as the defacto document representation scheme for supervised and unsupervised learning on documents. The BoW scheme represents features as an unordered set of words contained in the document, along with their frequency count.",
"cite_spans": [
{
"start": 76,
"end": 90,
"text": "(Salton, 1989)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The BoW scheme assumes that the distribution of words in a document reflect the underlying distribution of topics and hence if the documents are grouped on the basis of the similarity of the words contained in them, it will implicitly result in a clustering based on topics. This representation, using a simple frequency count alone, does not capture all the underlying information present in the documents. Moreover, it ignores information such as position, relations and co-occurrences among the words. In addition, the feature space formed will be very huge and sparse resulting in time and space costs as well.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Lexical Chaining is a technique which seeks to identify and exploit the semantic relatedness of words in a document. It is based on the phenomenon of lexical cohesion (Halliday and Hasan, 1976) and works on the premise that semantically related words co-occur close together in a passage more than \"just by chance\". Lexical chaining is the process of identifying and grouping such words together to form chains which in turn will help in identifying and representing the topic and content of the document.",
"cite_spans": [
{
"start": 167,
"end": 193,
"text": "(Halliday and Hasan, 1976)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Lexical chains have been used as an intermediate representation of text for various tasks such as au-tomatic text summarisation (Barzilay and Elhadad, 1997; Silber and McCoy, 2002) , malapropism detection and correction (Hirst and St-Onge, 1997) , and hypertext construction (Green, 1998) . An algorithm for computing lexical chains was first given by (Morris and Hirst, 1991) using the Roget's Thesaurus (Kirkpatrick, 1998) . Since an electronic version of the Roget's Thesaurus was not available then, later algorithms were based on the WordNet lexical database (Fellbaum, 1998) .",
"cite_spans": [
{
"start": 128,
"end": 156,
"text": "(Barzilay and Elhadad, 1997;",
"ref_id": "BIBREF0"
},
{
"start": 157,
"end": 180,
"text": "Silber and McCoy, 2002)",
"ref_id": "BIBREF19"
},
{
"start": 220,
"end": 245,
"text": "(Hirst and St-Onge, 1997)",
"ref_id": "BIBREF7"
},
{
"start": 275,
"end": 288,
"text": "(Green, 1998)",
"ref_id": "BIBREF4"
},
{
"start": 352,
"end": 376,
"text": "(Morris and Hirst, 1991)",
"ref_id": "BIBREF12"
},
{
"start": 405,
"end": 424,
"text": "(Kirkpatrick, 1998)",
"ref_id": "BIBREF10"
},
{
"start": 564,
"end": 580,
"text": "(Fellbaum, 1998)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We present here a two pass algorithm to compute a representation of documents using lexical chains and use these lexical chains to derive feature vectors. These lexical chain based feature vectors are used to cluster the documents using two different algorithms -k-Means and Co-clustering. k-Means is a well studied clustering algorithm widely used in the text domain. Co-clustering, also known as bi-clustering (Madeira and Oliveira, 2004) , is a clustering approach which was developed in the bioinformatics domain for clustering gene expressions. Since the text domain shares a lot of characteristics (high dimensionality, sparsity, etc.) of gene expression data, a lot of interest has been generated recently in applying the co-clustering approaches (Dhillon et al., 2003) to the text domain with promising results. Co-clustering (Dhillon et al., 2003; Sra et al., 2004) exploits the duality between rows and columns of the document-term matrix used to represent the features, by simultaneously clustering both the rows and columns.",
"cite_spans": [
{
"start": 412,
"end": 440,
"text": "(Madeira and Oliveira, 2004)",
"ref_id": "BIBREF11"
},
{
"start": 754,
"end": 776,
"text": "(Dhillon et al., 2003)",
"ref_id": "BIBREF1"
},
{
"start": 820,
"end": 856,
"text": "Co-clustering (Dhillon et al., 2003;",
"ref_id": null
},
{
"start": 857,
"end": 874,
"text": "Sra et al., 2004)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We compare the clustering results obtained from document features extracted using lexical chains against those obtained by using the traditional method of bag of words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Lexical chains are groups of words which exhibit lexical cohesion. Cohesion as given by (Halliday and Hasan, 1976 ) is a way of getting text to \"hang together as a whole\". Lexical cohesion is exhibited through cohesive relations. They (Halliday and Hasan, 1976) have classified these relations as: ",
"cite_spans": [
{
"start": 88,
"end": 113,
"text": "(Halliday and Hasan, 1976",
"ref_id": null
},
{
"start": 235,
"end": 261,
"text": "(Halliday and Hasan, 1976)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Lexical Chains",
"sec_num": "2"
},
{
"text": "The first three relations involve reiteration which includes repetition of the same word in the same sense (e.g., car and car), the use of a synonym for a word (e.g., car and automobile) and the use of hypernyms (or hyponyms) for a word (e.g., car and vehicle) respectively. The last two relations involve collocations i.e, semantic relationships between words that often co-occur (e.g., football and foul). Lexical chains in a text are identified by the presence of strong semantic relations between the words in the text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non systematic semantic relation",
"sec_num": "5."
},
{
"text": "Algorithms for building lexical chains work by considering candidate words for inclusion in the chains constructed so far. Usually these candidate words are nouns and compound nouns. Lexical Chains can be computed at various granularitiesacross sentences, paragraphs or documents. In general, to compute lexical chains, each candidate word in the sentence/paragraph/document is compared, with each lexical chain identified so far. If a candidate word has a 'cohesive relation' with the words in the chain it is added to the chain. On the other hand, if a candidate word is not related to any of the chains, a new chain is created for the candidate word. Thus a lexical chain is made up of a set of semantically related words. The lexical chains obtained are then evaluated based on a suitable criteria and the better chains are selected and used to further processing. Naturally, the computation of lexical chains is predicated on the availability of a suitable database which maps relations between words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non systematic semantic relation",
"sec_num": "5."
},
{
"text": "Several algorithms have been proposed for computing lexical chains. Prominent among them are those by (Hirst and St-Onge, 1997; Barzilay and Elhadad, 1997; Silber and McCoy, 2002; Jarmasz and Szpakowicz, 2003) . Except for the one by Jarmasz and Szpakowicz, all others use WordNet (Fellbaum, 1998) to identify relations among words. A brief overview of these algorithms is given in (Jayarajan et al., 2007) .",
"cite_spans": [
{
"start": 102,
"end": 127,
"text": "(Hirst and St-Onge, 1997;",
"ref_id": "BIBREF7"
},
{
"start": 128,
"end": 155,
"text": "Barzilay and Elhadad, 1997;",
"ref_id": "BIBREF0"
},
{
"start": 156,
"end": 179,
"text": "Silber and McCoy, 2002;",
"ref_id": "BIBREF19"
},
{
"start": 180,
"end": 209,
"text": "Jarmasz and Szpakowicz, 2003)",
"ref_id": "BIBREF8"
},
{
"start": 281,
"end": 297,
"text": "(Fellbaum, 1998)",
"ref_id": null
},
{
"start": 382,
"end": 406,
"text": "(Jayarajan et al., 2007)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Non systematic semantic relation",
"sec_num": "5."
},
{
"text": "WordNet is a lexical database which organises words into synonym sets or synsets. Each synset contains one or more words that have the same meaning. A word may appear in many synsets, depending on the number of senses that it has. The synsets are connected by links that indicate different semantic relations such as generalisation (hypernyms), specialisation (hyponyms), part relations (holonyms 1 and meronyms 2 ), etc.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non systematic semantic relation",
"sec_num": "5."
},
{
"text": "Our approach to computing lexical chains differs from those listed above and is described in the next section.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non systematic semantic relation",
"sec_num": "5."
},
{
"text": "All the algorithms mentioned in the previous section, try to disambiguate the sense of the word as part of the chaining process. Both Word Sense Disambiguation (WSD) and lexical chaining are very profound processes. The aim of computing the lexical chains here is to try and identify the topics in a document. If WSD has be performed as an implicit step in the lexical chain computing algorithm, it tends to deteriorate the outcome of both. We feel that the words should be disambiguated by looking at their context in a sentence/paragraph as a whole. As such, we propose to perform WSD as a preprocessing step, before the word is considered for lexical chaining. We use an algorithm by (Patwardhan et al., 2003) to disambiguate the senses of the words in reference to Wordnet. We then filter out all nonnoun words identified in the WSD stage. This is based on the assumption that nouns are better at reflecting the topics contained in a document than the other parts of speech. The result is a set of nouns which appear in the text along with its sense. We refer to these as 'candidate words'.",
"cite_spans": [
{
"start": 687,
"end": 712,
"text": "(Patwardhan et al., 2003)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Lexical Chains based Feature Vectors",
"sec_num": "3"
},
{
"text": "Our algorithm is based on the WordNet Lexical Database. WordNet is used to identify the relations among the words. We use only the identity and synonymy relations to compute the chains. A word has a identity or synonymy relation with another word, only if both the words occur in the same synset in Wordnet. Empirically, we found that usage of only these two relations, resulted in chains representing crisp topics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexical Chains based Feature Vectors",
"sec_num": "3"
},
{
"text": "A lexical chain contains a list of words which are related to each other and is identified using a unique numeric identifier. Each word in turn is represented as a 4-tuple term, pos, sense, rel\u00a1 , where 'pos' is the part-of-speech of the term, 'sense' is the Wordnet sense number and 'rel' is the relation of this word to the chain. In this case, we treat the two relations -identity and synonymy, as a single relation and hence this is uniformly 'IS' for all the words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexical Chains based Feature Vectors",
"sec_num": "3"
},
{
"text": "\u00a2 is defined as the number of words in the chain.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Definition 1 Length of a lexical chain",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "\u00a3 \u00a4 \u00a5 \u00a6 \u00a7 \u00a8 \u00a9 \u00a2 ! \" # $ % & ' # $ (",
"eq_num": "(1)"
}
],
"section": "Definition 1 Length of a lexical chain",
"sec_num": null
},
{
"text": "The length of a lexical chain is an indicator of the strength of the chain in representing a topic. Dominant topics/information will have long chains, while stray information will form extremely short chains. Each occurrence of a word in a document, will increase the length of the chain by one. Thus, the length of a chain gives a composite measure of the number of documents in which the chain occurs and the number of occurences of words in the chain in these documents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Definition 1 Length of a lexical chain",
"sec_num": null
},
{
"text": "We use a two pass algorithm to generate feature vectors based on lexical chains. Our algorithm works by maintaining a global set of lexical chains, each of which represents a topic. Initially, the global list is empty. In the first pass we identify all possible lexical chains for that document. This is achieved by comparing the candidate words of each document with the global list to identify those chains with which it has a identity or synonymy relation. If no chains are identified, a new chain is created and put in the global list. The candidate word is then added to the chain. At the end of this pass, we obtain a global set which lists all the chains contained in all the documents. The algorithm is presented in Algorithm 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Vector Computation",
"sec_num": "3.1"
},
{
"text": "In the second pass we select a subset of chains from the global set, which can be used to represent the document. We define and use a measure to evaluate and select the chains as follows: (2)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Vector Computation",
"sec_num": "3.1"
},
{
"text": "The significance of a chain L measures how randomly the chain appears in the global set G. This measure helps in identifying good chains from weak, random ones in the global set. In effect, ) 0 \u00a6 \u00a9 \u00a2 will select those chains which are not abnormally long or short with respect to the distributions of chains in the global set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Vector Computation",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "@ \u00a4 \u00a3 A \u00a7 \u00a4 B \u00a9 C D \u00a2 E D C A \u00a5 B \u00a2 A @ \u00a4 @ \u00a4 \u00a3 A \u00a7 \u00a4 B F D G \u00a7 \u00a8 \u00a4 @ H 0 ) \u00a4",
"eq_num": "(3)"
}
],
"section": "Definition 3 A candidate word W is related to a lexical chain L if W has an identity or synonym relation with L.",
"sec_num": null
},
{
"text": "Definition 4 The utility of a lexical chain L to a document D is defined as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Definition 3 A candidate word W is related to a lexical chain L if W has an identity or synonym relation with L.",
"sec_num": null
},
{
"text": "I \u00a7 0 \u00a3 \u00a9 \u00a2 D P ) 0 \u00a6 \u00a9 \u00a2 6 Q R 3 3 S 4 T @ \u00a4 \u00a3 A \u00a7 \u00a4 B \u00a9 H D \u00a2 (4)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Definition 3 A candidate word W is related to a lexical chain L if W has an identity or synonym relation with L.",
"sec_num": null
},
{
"text": "The utility of a chain L is a measure of how good L will be in representing the document. This is based on the observation that long chains are better than short ones. This measure will prefer 'good' chains from the global set, which are related to a large number of candidate words in the document.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Definition 3 A candidate word W is related to a lexical chain L if W has an identity or synonym relation with L.",
"sec_num": null
},
{
"text": "We select and assign to the document all those chains which cross a threshold on the utility of the chain. Empirically, we found that using a threshold of 'half the average' utility for a document gave good results. For a document D, let the set of all lexical chains assignable to D be",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Definition 3 A candidate word W is related to a lexical chain L if W has an identity or synonym relation with L.",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "U V W X 7 ' 7 Y ` X . The threshold for D is computed as \u00a7 \u00a8 @ \u00a4 ) \u00a8 G \u00a3 B \u00a9 P 2 3 4 5 a I \u00a7 0 \u00a3 \u00a9 \u00a3 D P b 6 c U V c",
"eq_num": "(5)"
}
],
"section": "Definition 3 A candidate word W is related to a lexical chain L if W has an identity or synonym relation with L.",
"sec_num": null
},
{
"text": "The lexical chains in the global list form the components of the feature vectors. We use a binary valued scheme, where in we put a Document Ids college atheists 53675, 53357, 53540 amusing atheists and anarchists 53402, 53351 islam & dress code for women 51212, 51216, 51318 Table 2 : Example of the classes obtained from grouping the documents using the subject line",
"cite_spans": [],
"ref_spans": [
{
"start": 131,
"end": 288,
"text": "Document Ids college atheists 53675, 53357, 53540 amusing atheists and anarchists 53402, 53351 islam & dress code for women 51212, 51216, 51318 Table 2",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "Definition 3 A candidate word W is related to a lexical chain L if W has an identity or synonym relation with L.",
"sec_num": null
},
{
"text": "We use the 20 Newsgroups (Rennie, 1995) dataset to evaluate the utility of representing documents using the lexical chains (lexchains) scheme. The 20 Newsgroups (20NG) corpus is a collection of usenet messages spread across 20 Usenet groups. These messages are written by a wide population of net users and represent a good variation in writing styles, choice of words and grammar. Thus, we feel that the 20NG is a representative corpus for the purpose. We derive three datasets from three distinct groups of the 20NG corpus -comp.windows.x (cwx), rec.motorcycles (rm) and alt.atheism (aa). The statistics of the datasets is given in Table 1 .",
"cite_spans": [],
"ref_spans": [
{
"start": 634,
"end": 641,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4"
},
{
"text": "The documents in each dataset are further grouped on the basis of their subject lines. This grouping into classes is used as the gold standard for evaluating the clustering algorithms. An example of the groups formed for the aa dataset is shown in Table 2 .",
"cite_spans": [],
"ref_spans": [
{
"start": 248,
"end": 255,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4"
},
{
"text": "We prepared the dataset for feature extraction by removing the complete header including the subject line and used only the body portion of the messages to compute the features. We extracted features on this cleaned data using both the BoW and lexchains scheme. For the BoW scheme, we first tokenised the document, filtered out the stopwords using the list obtained from (Fox, 1992) and further stemmed them using a Porter Stemmer (Porter, 1980) . The feature vectors were then computed using the tf.idf scheme. We refer to the feature vectors thus obtained as cwx-BoW, rm-BoW and aa-BoW",
"cite_spans": [
{
"start": 371,
"end": 382,
"text": "(Fox, 1992)",
"ref_id": "BIBREF3"
},
{
"start": 431,
"end": 445,
"text": "(Porter, 1980)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4"
},
{
"text": "# Classes # Documents comp.windows.x 649 980 alt.atheism 196 799 rec.motorcycles 340 994 Table 1 : Dataset Statistics for the cwx, rm and aa datasets respectively. Lexchains based features were derived as described in Section 3.1 and are analogously referred to here as cwx-lc, rm-lc and aa-lc. This results in a total of six datasets. The dimensions of the feature vectors obtained are summarised in Table 3 . It can be noted that the size of the feature vectors are reduced by more than 30% with the lexchains based features. These six datasets were clustered using the k-Means and Co-clustering algorithms. The k-Means implementation in Matlab was used and k was set to 649, 340 and 196 for cwx, rm and aa respectively and reflects the number of classes identified in the gold standard (ref. Table. 1). The co-clustering experiments were done using the Minimum Sum-Squared Residue Co-clustering algorithm (Sra et al., 2004) with the number of row clusters set to the same values as given to the k-Means algorithm.",
"cite_spans": [
{
"start": 908,
"end": 926,
"text": "(Sra et al., 2004)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [
{
"start": 89,
"end": 96,
"text": "Table 1",
"ref_id": null
},
{
"start": 401,
"end": 408,
"text": "Table 3",
"ref_id": "TABREF2"
},
{
"start": 795,
"end": 801,
"text": "Table.",
"ref_id": null
}
],
"eq_spans": [],
"section": "Collection",
"sec_num": null
},
{
"text": "We use a normalised edit distance based measure to evaluate the goodness of the clusters. This measure is a variant of the one used by (Pantel and Lin, 2002) , which defines an edit distance as the number of merge, move and copy operations required to transform the resulting clusters to the gold standard. Initially, if there are d classes in the gold standard, we create d empty clusters. The measure then merges each resulting cluster to the cluster in the gold standard with which it has maximum overlap, breaking ties randomly. Thus, the merge operation attempts to bring the obtained clusters as close as possible to the gold standard as a whole. Subsequently, the move and copy operations are used to move (copy) the documents around so that they finally match the gold standard.",
"cite_spans": [
{
"start": 135,
"end": 157,
"text": "(Pantel and Lin, 2002)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Collection",
"sec_num": null
},
{
"text": "We observed that the merge operation would inevitably add as many clusters as there are in the gold standard to the final count, skewing the results. Hence, we define the edit distance as only the number of move and copy 3 operations required to convert the obtained clusters to that of the gold standard. In effect, it measures the number of documents which are misplaced with respect to the gold standard. The obtained edit distance is normalised by dividing it with the number of documents in the dataset. This will normalise the value of the measure to range between 0 and 1. The lower the value of this measure, the closer the obtained clustering is to the gold standard.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Collection",
"sec_num": null
},
{
"text": "The results are enumerated in Table 4 . The lexchains based document feature gives an improvement of upto 33% over the BoW representation while achieving a reduction in dimensions of the feature vectors by more than 30% (ref. Table 3 ). We performed run time studies on the dataset using the co-clustering algorithm. The runtimes are averaged over four runs. It can be seen that a speedup of more than 74% is achieved with the lexchain based features 4 .",
"cite_spans": [],
"ref_spans": [
{
"start": 30,
"end": 37,
"text": "Table 4",
"ref_id": "TABREF3"
},
{
"start": 226,
"end": 233,
"text": "Table 3",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "Collection",
"sec_num": null
},
{
"text": "Thus, the results show that the running time of the clustering algorithms is drastically reduced while maintaining or improving the clustering performance through the use of lexchain based features.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Collection",
"sec_num": null
},
{
"text": "A document is not just a bunch of loose words. Each word in a document contributes to some aspect of the overall semantics of the document. Classification and clustering algorithms seek to group the documents based on its semantics. The BoW scheme inherently throws away a lot of information, which would have otherwise been useful in discerning the semantics of the document. The BoW representation fails to capture and represent these semantics resulting in a less accurate representation for the documents. This fact is reflected by higher edit distance in the case of BoW based clustering in Table 4 . Earlier, Hatzivassiloglou, et. al. (Hatzivassiloglou et al., 2000) had studied the effects of linguistically motivated features on clustering algorithms. They had explored two linguistically motivated featuresnoun phrase heads and proper names and compared these against the bag of words representation. They had reported that the BoW representation was better than linguistically motivated features. We believe that noun phrase heads and proper names are inadequate representations of the semantics of a document and a more composite representation is required to obtain better results on semantically oriented tasks.",
"cite_spans": [
{
"start": 615,
"end": 672,
"text": "Hatzivassiloglou, et. al. (Hatzivassiloglou et al., 2000)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [
{
"start": 596,
"end": 603,
"text": "Table 4",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Discussion",
"sec_num": "4.1"
},
{
"text": "Lexical chains appear to be capable of doing this to a certain extent. During the process of computing and selecting the lexical chains, we are implicitly trying to decode the semantics of the documents. Lexical chains work on the basic premise that a document describes topics through a combination of words and these words will exhibit a cohesion among them. This cohesion can be identified using a resource such as WordNet. In the process, lexical chains capture some amount of the semantics contained in the documents, resulting in a better performance in subsequent processing of the documents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "4.1"
},
{
"text": "We have shown that semantically motived features, such as lexical chains, provide a better representation for the documents, resulting in comparable or better performance on clustering tasks while effecting a drastic reduction in time and space complexity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5"
},
{
"text": "Even though the lexical chains manage to represent the semantics to a certain extent, we feel it can be further enhanced by more involved processing. A comparision of lexical chains based representation with other document representation schemes such as LSA also warrants investigation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5"
},
{
"text": "part of, member of, substance of relations, e.g., 'wheel' is part of a 'vehicle' 2 has part, has member, has substance relations, e.g., 'wheel' has part 'rim'",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The copy count will be included only in the case of overlapping clusters, which happens if a document is in more than one cluster.4 It was observed empirically that the time required to compute both the BoW and lexchain features are nearly the same and hence can be ignored.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "The authors would like to thank Director, CAIR for the encouragement and support given for this work. The authors would also like to thank the three anonymous reviewers, whose detailed comments helped improve this work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgement",
"sec_num": "6"
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Using lexical chains for text summarization",
"authors": [
{
"first": "Regina",
"middle": [],
"last": "Barzilay",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Elhadad",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceedings of the Intelligent Scalable Text Summarization Workshop (ISTS'97)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Regina Barzilay and M. Elhadad. 1997. Using lexical chains for text summarization. In In Proceedings of the Intelligent Scalable Text Summarization Workshop (ISTS'97), ACL, Madrid, Spain.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Information-theoretic co-clustering",
"authors": [
{
"first": "S",
"middle": [],
"last": "Inderjit",
"suffix": ""
},
{
"first": "Subramanyam",
"middle": [],
"last": "Dhillon",
"suffix": ""
},
{
"first": "Dharmendra",
"middle": [
"S"
],
"last": "Mallela",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Modha",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD-2003)",
"volume": "",
"issue": "",
"pages": "89--98",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Inderjit S. Dhillon, Subramanyam Mallela, and Dhar- mendra S. Modha. 2003. Information-theoretic co-clustering. In Proceedings of The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD-2003), pages 89- 98.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "WordNet: An Electronic Lexical Database",
"authors": [],
"year": 1998,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christiane Fellbaum, editor. 1998. WordNet: An Elec- tronic Lexical Database. MIT Press.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Information retrieval: data structures and algorithms, chapter Lexical Analysis and Stoplists",
"authors": [
{
"first": "Christopher",
"middle": [],
"last": "Fox",
"suffix": ""
}
],
"year": 1992,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christopher Fox, 1992. Information retrieval: data structures and algorithms, chapter Lexical Analysis and Stoplists. Prentice-Hall, Inc., Upper Saddle River, NJ, USA.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Automatically generating hypertext in newspaper articles by computing semantic relatedness",
"authors": [
{
"first": "J",
"middle": [],
"last": "Stephen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Green",
"suffix": ""
}
],
"year": 1998,
"venue": "NeM-LaP3/CoNLL98: New Methods in Language Processing and Computational Natural Language",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stephen J Green. 1998. Automatically generating hy- pertext in newspaper articles by computing seman- tic relatedness. In D.M.W. Powers, editor, NeM- LaP3/CoNLL98: New Methods in Language Process- ing and Computational Natural Language.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "An investigation of linguistic features and clustering algorithms for topical document clustering",
"authors": [
{
"first": "Vasileios",
"middle": [],
"last": "Hatzivassiloglou",
"suffix": ""
},
{
"first": "Luis",
"middle": [],
"last": "Gravano",
"suffix": ""
},
{
"first": "Ankineedu",
"middle": [],
"last": "Maganti",
"suffix": ""
}
],
"year": 2000,
"venue": "SIGIR 2000",
"volume": "",
"issue": "",
"pages": "224--231",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vasileios Hatzivassiloglou, Luis Gravano, and Ankineedu Maganti. 2000. An investigation of linguistic features and clustering algorithms for topical document clus- tering. In SIGIR 2000, pages 224-231.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Lexical chains as representation of context for the detection and correction of malapropisms",
"authors": [
{
"first": "Graeme",
"middle": [],
"last": "Hirst",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "St-Onge",
"suffix": ""
}
],
"year": 1997,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Graeme Hirst and David St-Onge. 1997. Lexical chains as representation of context for the detection and cor- rection of malapropisms. In C. Fellbaum, editor, WordNet:An electronic lexical database and some of its applications. The MIT Press, Cambrige, MA.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Not as easy as it seems: Automating the construction of lexical chains using roget's thesaurus",
"authors": [
{
"first": "Mario",
"middle": [],
"last": "Jarmasz",
"suffix": ""
},
{
"first": "Stan",
"middle": [],
"last": "Szpakowicz",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 16th Canadian Conference on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mario Jarmasz and Stan Szpakowicz. 2003. Not as easy as it seems: Automating the construction of lexical chains using roget's thesaurus. In Proceedings of the 16th Canadian Conference on Artificial Intelligence.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Document clustering using lexical chains",
"authors": [
{
"first": "Dinakar",
"middle": [],
"last": "Jayarajan",
"suffix": ""
},
{
"first": "Dipti",
"middle": [],
"last": "Deodhare",
"suffix": ""
},
{
"first": "Sandipan",
"middle": [],
"last": "Ravindran",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sarkar",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the Workshop on Text Mining & Link Analysis",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dinakar Jayarajan, Dipti Deodhare, B Ravindran, and Sandipan Sarkar. 2007. Document clustering using lexical chains. In Proceedings of the Workshop on Text Mining & Link Analysis (TextLink 2007), Hyderbad, INDIA, January.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Roget's Thesaurus of English Words and Phrases",
"authors": [
{
"first": "",
"middle": [],
"last": "Kirkpatrick",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "B Kirkpatrick. 1998. Roget's Thesaurus of English Words and Phrases. Penguin.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Biclustering algorithms for biological data analysis: a survey",
"authors": [
{
"first": "C",
"middle": [],
"last": "Sara",
"suffix": ""
},
{
"first": "Arlindo",
"middle": [
"L"
],
"last": "Madeira",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Oliveira",
"suffix": ""
}
],
"year": 2004,
"venue": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"volume": "1",
"issue": "1",
"pages": "24--45",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sara C. Madeira and Arlindo L. Oliveira. 2004. Biclus- tering algorithms for biological data analysis: a sur- vey. IEEE/ACM Transactions on Computational Biol- ogy and Bioinformatics, 1(1):24-45.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Lexical cohesion computed by thesaural relations as an indicator of the structure of text",
"authors": [
{
"first": "Jane",
"middle": [],
"last": "Morris",
"suffix": ""
},
{
"first": "Graeme",
"middle": [],
"last": "Hirst",
"suffix": ""
}
],
"year": 1991,
"venue": "Computational Linguistics",
"volume": "17",
"issue": "1",
"pages": "21--48",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jane Morris and Graeme Hirst. 1991. Lexical cohe- sion computed by thesaural relations as an indicator of the structure of text. Computational Linguistics, 17(1):21-48.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Document clustering with committees",
"authors": [
{
"first": "Patrick",
"middle": [],
"last": "Pantel",
"suffix": ""
},
{
"first": "Dekang",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 2002,
"venue": "SIGIR '02: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval",
"volume": "",
"issue": "",
"pages": "199--206",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Patrick Pantel and Dekang Lin. 2002. Document clus- tering with committees. In SIGIR '02: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, pages 199-206, New York, NY, USA. ACM Press.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Using semantic relatedness for word sense disambiguation",
"authors": [
{
"first": "Siddharth",
"middle": [],
"last": "Patwardhan",
"suffix": ""
},
{
"first": "Satanjeev",
"middle": [],
"last": "Banerjee",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the Fourth International Conference on Intelligent Text Processing and Computational Linguistics (CiCLING-03)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Siddharth Patwardhan, Satanjeev Banerjee, and Ted Ped- ersen. 2003. Using semantic relatedness for word sense disambiguation. In Proceedings of the Fourth International Conference on Intelligent Text Process- ing and Computational Linguistics (CiCLING-03), Mexico City, Mexico.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "An algorithm for suffix stripping",
"authors": [
{
"first": "Martin",
"middle": [
"F"
],
"last": "Porter",
"suffix": ""
}
],
"year": 1980,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Martin F. Porter. 1980. An algorithm for suffix stripping. Program.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "20 Newsgroups dataset",
"authors": [
{
"first": "Jason",
"middle": [
"Rennie"
],
"last": "",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jason Rennie. 1995. 20 Newsgroups dataset. Online: http://people.csail.mit.edu/jrennie/20Newsgroups/.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "A vector space model for automatic indexing",
"authors": [
{
"first": "A",
"middle": [],
"last": "Gerard Salton",
"suffix": ""
},
{
"first": "C",
"middle": [
"S"
],
"last": "Wong",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Yang",
"suffix": ""
}
],
"year": 1975,
"venue": "Commun. ACM",
"volume": "18",
"issue": "11",
"pages": "613--620",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gerard Salton, A. Wong, and C. S. Yang. 1975. A vector space model for automatic indexing. Commun. ACM, 18(11):613-620.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Automatic Text Processing -The Transformation, Analysis, and Retrieval of Information by Computer",
"authors": [
{
"first": "Gerard",
"middle": [],
"last": "Salton",
"suffix": ""
}
],
"year": 1989,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gerard Salton. 1989. Automatic Text Processing -The Transformation, Analysis, and Retrieval of Informa- tion by Computer. Addison-Wesley.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Efficiently computed lexical chains as an intermediate representation for automatic text summarization",
"authors": [
{
"first": "H",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "Gregory",
"middle": [],
"last": "Silber",
"suffix": ""
},
{
"first": "Kathleen",
"middle": [
"F"
],
"last": "Mccoy",
"suffix": ""
}
],
"year": 2002,
"venue": "Computational Linguistics",
"volume": "28",
"issue": "4",
"pages": "487--496",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H. Gregory Silber and Kathleen F. McCoy. 2002. Effi- ciently computed lexical chains as an intermediate rep- resentation for automatic text summarization. Compu- tational Linguistics, 28(4):487-496.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Minimum sum-squared residue coclustering of gene expression data",
"authors": [
{
"first": "Suvrit",
"middle": [],
"last": "Sra",
"suffix": ""
},
{
"first": "Hyuk",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "Inderjit",
"middle": [
"S"
],
"last": "Dhillon",
"suffix": ""
},
{
"first": "Yuqiang",
"middle": [],
"last": "Guan",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the Fourth SIAM International Conference on Data Mining",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Suvrit Sra, Hyuk Cho, Inderjit S. Dhillon, and Yuqiang Guan. 2004. Minimum sum-squared residue co- clustering of gene expression data. In Proceedings of the Fourth SIAM International Conference on Data Mining, Lake Buena Vista, Florida, USA, April 22-24, 2004.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"text": "Reiteration with identity of reference 2. Reiteration without identity of reference 3. Reiteration by means of super ordinate 4. Systematic semantic relation",
"num": null,
"uris": null
},
"FIGREF1": {
"type_str": "figure",
"text": "the chain is assigned to the document and",
"num": null,
"uris": null
},
"FIGREF2": {
"type_str": "figure",
"text": "otherwise. Essentially, what we obtain here is a feature vector of size equal to the number of lexical chains in the global list. The second pass of the algorithm is listed in Algorithm 2. Cluster",
"num": null,
"uris": null
},
"TABREF2": {
"text": "Dimensionality of the Feature Vectors",
"content": "<table><tr><td/><td colspan=\"3\">k-Means Co-cluster Time</td></tr><tr><td/><td/><td/><td>(secs)</td></tr><tr><td colspan=\"4\">cwx-BoW 203 (0.21) 140 (0.14) 1529</td></tr><tr><td>cwx-lc</td><td colspan=\"2\">179 (0.18) 158 (0.16)</td><td>201</td></tr><tr><td>aa-BoW</td><td colspan=\"2\">85 (0.11) 110 (0.13)</td><td>869</td></tr><tr><td>aa-lc</td><td>60 (0.08)</td><td>82 (0.10)</td><td>221</td></tr><tr><td>rm-BoW</td><td colspan=\"3\">113 (0.11) 208 (0.21) 1177</td></tr><tr><td>rm-lc</td><td colspan=\"2\">127 (0.12) 144 (0.14)</td><td>229</td></tr></table>",
"type_str": "table",
"html": null,
"num": null
},
"TABREF3": {
"text": "",
"content": "<table><tr><td>: Edit distance between obtained clusters and</td></tr><tr><td>gold standard. Normalised edit distances are given</td></tr><tr><td>in parenthesis. The fourth column gives runtime for</td></tr><tr><td>the co-clustering algorithm, averaged over four runs.</td></tr><tr><td>(For all cases, lower is better.)</td></tr></table>",
"type_str": "table",
"html": null,
"num": null
}
}
}
} |