File size: 61,306 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 | {
"paper_id": "C02-1007",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T12:17:25.342484Z"
},
"title": "The Computation of Word Associations: Comparing Syntagmatic and Paradigmatic Approaches",
"authors": [
{
"first": "Reinhard",
"middle": [],
"last": "Rapp",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Mainz",
"location": {
"postCode": "FASK D-76711",
"settlement": "Germersheim",
"country": "Germany"
}
},
"email": "rapp@mail.fask.uni-mainz.de"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "It is shown that basic language processes such as the production of free word associations and the generation of synonyms can be simulated using statistical models that analyze the distribution of words in large text corpora. According to the law of association by contiguity, the acquisition of word associations can be explained by Hebbian learning. The free word associations as produced by subjects on presentation of single stimulus words can thus be predicted by applying first-order statistics to the frequencies of word co-occurrences as observed in texts. The generation of synonyms can also be conducted on co-occurrence data but requires second-order statistics. The reason is that synonyms rarely occur together but appear in similar lexical neighborhoods. Both approaches are systematically compared and are validated on empirical data. It turns out that for both tasks the performance of the statistical system is comparable to the performance of human subjects.",
"pdf_parse": {
"paper_id": "C02-1007",
"_pdf_hash": "",
"abstract": [
{
"text": "It is shown that basic language processes such as the production of free word associations and the generation of synonyms can be simulated using statistical models that analyze the distribution of words in large text corpora. According to the law of association by contiguity, the acquisition of word associations can be explained by Hebbian learning. The free word associations as produced by subjects on presentation of single stimulus words can thus be predicted by applying first-order statistics to the frequencies of word co-occurrences as observed in texts. The generation of synonyms can also be conducted on co-occurrence data but requires second-order statistics. The reason is that synonyms rarely occur together but appear in similar lexical neighborhoods. Both approaches are systematically compared and are validated on empirical data. It turns out that for both tasks the performance of the statistical system is comparable to the performance of human subjects.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "According to Ferdinand de Saussure (1916) , there are two fundamental types of relations between words that he believes correspond to basic operations of our brain: syntagmatic and paradigmatic associations. There is a syntagmatic relation between two words if they co-occur in spoken or written language more frequently than expected from chance and if they have different grammatical roles in the sentences in which they occur. Typical examples are the word pairs coffee -drink, sunhot, or teacher -school. The relation between two words is paradigmatic if the two words can substitute for one another in a sentence without affect-ing the grammaticality or acceptability of the sentence. Typical examples are synonyms or antonyms like quick -fast, or eat -drink. Normally, words with a paradigmatic relation are the same part of speech, whereas words with a syntagmatic relation can but need not be the same part of speech.",
"cite_spans": [
{
"start": 26,
"end": 41,
"text": "Saussure (1916)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper we want to show that the two types of relations as defined by de Saussure are reflected in the statistical distribution of words in large corpora. We present algorithms that automatically retrieve words with either the syntagmatic or the paradigmatic type of relationship from corpora and perform a quantitative evaluation of our results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Paradigmatic associations are words with high semantic similarity. According to Ruge (1992) , the semantic similarity of two words can be computed by determining the agreement of their lexical neighborhoods. For example, the semantic similarity of the words red and blue can be derived from the fact that they both frequently co-occur with words like color, flower, dress, car, dark, bright, beautiful, and so forth. If for each word in a corpus a cooccurrence vector is determined whose entries are the co-occurrences with all other words in the corpus, then the semantic similarities between words can be computed by conducting simple vector comparisons. To determine the words most similar to a given word, its co-occurrence vector is compared to the co-occurrence vectors of all other words using one of the standard similarity measures, for example, the cosine coefficient. Those words that obtain the best values are considered to be most similar. Practical implementations of algorithms based on this principle have led to excellent results as documented in papers by Ruge (1992) , Grefenstette (1994) , Agarwal (1995) , Landauer & Dumais (1997) , Sch\u00fctze (1997) , and Lin (1998) .",
"cite_spans": [
{
"start": 80,
"end": 91,
"text": "Ruge (1992)",
"ref_id": "BIBREF11"
},
{
"start": 1075,
"end": 1086,
"text": "Ruge (1992)",
"ref_id": "BIBREF11"
},
{
"start": 1089,
"end": 1108,
"text": "Grefenstette (1994)",
"ref_id": "BIBREF5"
},
{
"start": 1111,
"end": 1125,
"text": "Agarwal (1995)",
"ref_id": "BIBREF0"
},
{
"start": 1128,
"end": 1152,
"text": "Landauer & Dumais (1997)",
"ref_id": "BIBREF7"
},
{
"start": 1155,
"end": 1169,
"text": "Sch\u00fctze (1997)",
"ref_id": "BIBREF14"
},
{
"start": 1172,
"end": 1186,
"text": "and Lin (1998)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Paradigmatic Associations",
"sec_num": "2"
},
{
"text": "In this section we relate the results of our version of such an algorithm to similarity estimates obtained by human subjects. Fortunately, we did not need to conduct our own experiment to obtain the human's similarity estimates. Instead, such data was kindly provided by Thomas K. Landauer, who had taken it from the synonym portion of the Test of English as a Foreign Language (TOEFL). Originally, the data came, along with normative data, from the Educational Testing Service (Landauer & Dumais 1997) .",
"cite_spans": [
{
"start": 478,
"end": 502,
"text": "(Landauer & Dumais 1997)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Human Data",
"sec_num": "2.1"
},
{
"text": "The TOEFL is an obligatory test for foreign students who would like to study at an American or English university.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Human Data",
"sec_num": "2.1"
},
{
"text": "The data comprises 80 test items. Each item consists of a problem word in testing parlance and four alternative words, from which the test taker is asked to choose that with the most similar meaning to the problem word. For example, given the test sentence \"Both boats and trains are used for transporting the materials\" and the four alternative words planes, ships, canoes, and railroads, the subject would be expected to choose the word ships, which is the one most similar to boats.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Human Data",
"sec_num": "2.1"
},
{
"text": "As mentioned above, our method of simulating this kind of behavior is based on regularities in the statistical distribution of words in a corpus. We chose to use the British National Corpus (BNC), a 100million-word corpus of written and spoken language that was compiled with the intention of providing a representative sample of British English.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus",
"sec_num": "2.2"
},
{
"text": "Since this corpus is rather large, to save disk space and processing time we decided to remove all function words from the text. This was done on the basis of a list of approximately 200 English function words. We also decided to lemmatize the corpus as well as the test data. This not only reduces the sparse-data problem but also significantly reduces the size of the co-occurrence matrix to be computed. More details on these two steps of corpus preprocessing can be found in Rapp (1999) .",
"cite_spans": [
{
"start": 479,
"end": 490,
"text": "Rapp (1999)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus",
"sec_num": "2.2"
},
{
"text": "For counting word co-occurrences, as in most other studies a fixed window size is chosen and it is determined how often each pair of words occurs within a text window of this size. Choosing a win-dow size usually means a trade-off between two parameters: specificity versus the sparse-data problem. The smaller the window, the stronger the associative relation between the words inside the window, but the more severe the sparse data problem (see figure 1 in section 3.2). In our case, with \u00b11 word, the window size looks rather small. However, this can be justified since we have reduced the effects of the sparse-data problem by using a large corpus and by lemmatizing the corpus. It also should be noted that a window size of \u00b11 applied after elimination of the function words is comparable to a window size of \u00b12 without elimination of the function words (assuming that roughly every second word is a function word).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Co-occurrence Counting",
"sec_num": "2.3"
},
{
"text": "Based on the window size of \u00b11, we computed a co-occurrence matrix of about a million words in the lemmatized BNC. Although the resulting matrix is extremely large, this was feasible since we used a sparse format that does not store zero entries.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Co-occurrence Counting",
"sec_num": "2.3"
},
{
"text": "To determine the words most similar to a given word, the co-occurrence vector of this word is compared to all other vectors in the matrix and the words are ranked according to the similarity values obtained. It is expected that the most similar words are ranked first in the sorted list.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Computation of Word Similarities",
"sec_num": "2.4"
},
{
"text": "For vector comparison, different similarity measures can be considered. Salton & McGill (1983) proposed a number of measures, such as the cosine coefficient, the Jaccard coefficient, and the Dice coefficient. For the computation of related terms and synonyms, Ruge (1995) and Landauer & Dumais (1997) used the cosine measure, whereas Grefenstette (1994, p. 48 ) used a weighted Jaccard measure. We propose here the city-block metric, which computes the similarity between two vectors X and Y as the sum of the absolute differences of corresponding vector positions:",
"cite_spans": [
{
"start": 72,
"end": 94,
"text": "Salton & McGill (1983)",
"ref_id": "BIBREF13"
},
{
"start": 260,
"end": 271,
"text": "Ruge (1995)",
"ref_id": "BIBREF12"
},
{
"start": 276,
"end": 300,
"text": "Landauer & Dumais (1997)",
"ref_id": "BIBREF7"
},
{
"start": 334,
"end": 359,
"text": "Grefenstette (1994, p. 48",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Computation of Word Similarities",
"sec_num": "2.4"
},
{
"text": "\u2211 = \u2212 = n i i i Y X s 1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Computation of Word Similarities",
"sec_num": "2.4"
},
{
"text": "In a number of experiments we compared it to other similarity measures, such as the cosine measure, the Jaccard measure (standard and binary), the Euclidean distance, and the scalar product, and found that the city-block metric yielded good results (see Rapp, 1999) . Table 1 shows the top five paradigmatic associations to six stimulus words. As can be seen from the table, nearly all words listed are of the same part of speech as the stimulus word. Of course, our definition of the term paradigmatic association as given in the introduction implies this. However, the simulation system never obtained any information on part of speech, and so it is nevertheless surprising that -besides computing term similarities -it implicitly seems to be able to cluster parts of speech. This observation is consistent with other studies (e.g., Ruge, 1995 A qualitative inspection of the word lists generated by the system shows that the results are quite satisfactory. Paradigmatic associations like blue red, cold hot, and tobacco cigarette are intuitively plausible. However, a quantitative evaluation would be preferable, of course, and for this reason we did a comparison with the results of the human subjects in the TOEFL test. Remember that the human subjects had to choose the word most similar to a given stimulus word from a list of four alternatives.",
"cite_spans": [
{
"start": 254,
"end": 265,
"text": "Rapp, 1999)",
"ref_id": "BIBREF10"
},
{
"start": 835,
"end": 845,
"text": "Ruge, 1995",
"ref_id": "BIBREF12"
}
],
"ref_spans": [
{
"start": 268,
"end": 275,
"text": "Table 1",
"ref_id": "TABREF0"
}
],
"eq_spans": [],
"section": "Computation of Word Similarities",
"sec_num": "2.4"
},
{
"text": "In the simulation, we assumed that the system had chosen the correct alternative if the correct word was ranked highest among the four alternatives. This was the case for 55 of the 80 test items, which gives us an accuracy of 69%. This accuracy may seem low, but it should be taken into account that the TOEFL tests the language abilities of prospective university students and therefore is rather difficult. Actually, the performance of the average human test taker was worse than the performance of the system. The human subjects were only able to solve 51.6 of the test items correctly, which gives an accuracy of 64.5%. Please note that in the TOEFL, average performance (over several types of tests, with the synonym test being just one of them) admits students to most universities. On the other hand, by definition, the test takers did not have a native command of English, so the performance of native speakers would be expected to be significantly better. Another consideration is the fact that our simulation program was not designed to make use of the context of the test word, so it neglected some information that may have been useful for the human subjects.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "2.5"
},
{
"text": "Nevertheless, the results look encouraging. Given that our method is rather simple, let us now compare our results to the results obtained with more sophisticated methods. One of the methods reported in the literature is singular value decomposition (SVD); another is shallow parsing. SVD, as described by Sch\u00fctze (1997) and Landauer & Dumais (1997) , is a method similar to factor analysis or multi-dimensional scaling that allows a significant reduction of the dimensionality of a matrix with minimum information loss. Landauer & Dumais (1997) claim that by optimizing the dimensionality of the target matrix the performance of their word similarity predictions was significantly improved.",
"cite_spans": [
{
"start": 306,
"end": 320,
"text": "Sch\u00fctze (1997)",
"ref_id": "BIBREF14"
},
{
"start": 325,
"end": 349,
"text": "Landauer & Dumais (1997)",
"ref_id": "BIBREF7"
},
{
"start": 521,
"end": 545,
"text": "Landauer & Dumais (1997)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "2.5"
},
{
"text": "However, on the TOEFL task mentioned above, after empirically determining the optimal dimensionality of their matrix, they report an accuracy of 64.4%. This is somewhat worse than our result of 69%, which was achieved without SVD and without optimizing any parameters. It must be emphasized, however, that the validity of this comparison is questionable, as many parameters of the two models are different, making it unclear which ones are responsible for the difference. For example, Landauer and Dumais used a smaller corpus (4.7 million words), a larger window size (151 words on average), and a different similarity measure (cosine measure). We nevertheless tend to interpret the results of our comparison as evidence for the view that SVD is just another method for smoothing that has its greatest benefits for sparse data. However, we do not deny the technical value of the method. The one-time effort of the dimensionality reduction may be well spent in a practical system because all subsequent vector comparisons will be speeded up considerably with shorter vectors.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "2.5"
},
{
"text": "Let us now compare our results to those obtained using shallow parsing, as previously done by Grefenstette (1993) . The view here is that the window-based method may work to some extent, but that many of the word co-occurrences in a window are just incidental and add noise to the significant word pairs. A simple method to reduce this problem could be to introduce a threshold for the minimum number of co-occurrences; a more sophisticated method is the use of a (shallow) parser. Ruge (1992) , who was the first to introduce this method, claims that only head-modifier relations, as known from dependency grammar, should be considered. For example, if we consider the sentence \"Peter drives the blue car\", then we should not count the co-occurrence of Peter and blue, because blue is neither head nor modifier of Peter. Ruge developed a shallow parser that is able to determine the headmodifier relations in unrestricted English text with a recall of 85% and a precision of 86% (Ruge, 1995) . Using this parser she extracted all head-modifier relations from the 100 million words of the British National Corpus. Thus, the resulting co-occurrence matrix only contained the counts of the head-modifier relations. The word similarities were computed from this matrix by using the cosine similarity measure. Using this method, Ruge achieved an accuracy of about 69% in the TOEFL synonym task, which is equivalent to our results.",
"cite_spans": [
{
"start": 94,
"end": 113,
"text": "Grefenstette (1993)",
"ref_id": "BIBREF4"
},
{
"start": 482,
"end": 493,
"text": "Ruge (1992)",
"ref_id": "BIBREF11"
},
{
"start": 980,
"end": 992,
"text": "(Ruge, 1995)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "2.5"
},
{
"text": "Again, we need to emphasize that parameters other than the basic methodology could have influenced the result, so we need to be cautious with an interpretation. However, to us it seems that the view that some of the co-occurrences in corpora should be considered as noise is wrong, or else if there is some noise it obviously cancels out over large corpora. It would be interesting to know how a system performed that used all co-occurrences except the head-modifier relations. We tend to assume that such a system would perform worse, so the parser selected the good candidates. However, the experiment has not been done, so we cannot be sure.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "2.5"
},
{
"text": "Although the shallow parsing could not improve the results in this case, we nevertheless should point out its virtues: It improves efficiency since it leads to sparser matrices. It also seems to be able to separate the relevant from the irrelevant co-occurrences. Third, it may be useful for determining the type of relationship between words (e.g., synonymy, antonymy, meronymy, hyponymy, etc., see Berland & Charniak, 1999) . Although this is not within the scope of this paper, it is very relevant for related tasks, for example, the automatic generation of thesauri.",
"cite_spans": [
{
"start": 400,
"end": 425,
"text": "Berland & Charniak, 1999)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "2.5"
},
{
"text": "Syntagmatic associations are words that frequently occur together. Therefore, an obvious approach to extract them from corpora is to look for word pairs whose co-occurrence is significantly larger than chance. To test for significance, the standard chisquare test can be used. However, Dunning (1993) pointed out that for the purpose of corpus statistics, where the sparseness of data is an important issue, it is better to use the log-likelihood ratio. It would then be assumed that the strongest syntagmatic association to a word would be that other word that gets the highest log-likelihood score. Please note that this method is computationally far more efficient than the computation of paradigmatic associations. For the computation of the syntagmatic associations to a stimulus word only the vector of this single word has to be considered, whereas for the computation of paradigmatic associations the vector of the stimulus word has to be compared to the vectors of all other words in the vocabulary. The computation of syntagmatic associations is said to be of first-order type, whereas the computation of paradigmatic associations is of second-order type. Algorithms for the computation of first-order associations have been used in lexicography for the extraction of collocations (Smadja, 1993) and in cognitive psychology for the simulation of associative learning .",
"cite_spans": [
{
"start": 286,
"end": 300,
"text": "Dunning (1993)",
"ref_id": "BIBREF3"
},
{
"start": 1291,
"end": 1305,
"text": "(Smadja, 1993)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Syntagmatic Associations",
"sec_num": "3"
},
{
"text": "As we did with the paradigmatic associations, we would like to compare the results of our simulation to human performance. However, it is difficult to say what kind of experiment should be conducted to obtain human data. As with the paradigmatic associations, we decided not to conduct our own experiment but to use the Edinburgh Associative Thesaurus (EAT), a large collection of association norms, as compiled by Kiss et al. (1973) . Kiss presented lists of stimulus words to human subjects and asked them to write after each word the first word that the stimulus word made them think of. Table 2 gives some examples of the associations the subjects came up with.",
"cite_spans": [
{
"start": 415,
"end": 433,
"text": "Kiss et al. (1973)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [
{
"start": 591,
"end": 598,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Association Norms",
"sec_num": "3.1"
},
{
"text": "As can be seen from the table, not all of the associations given by the subjects seem to be of syntagmatic type. For example, the word pairs blue -black or cold -hot are clearly of paradigmatic type. This observation is of importance and will be discussed later.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Association Norms",
"sec_num": "3.1"
},
{
"text": "blue cold fruit green tobacco whiskey sky hot apple grass smoke drink black ice juice blue cigarette gin green warm orange red pipe bottle red water salad yellow poach soda white freeze machine field road Scotch Table 2 : Some sample associations from the EAT.",
"cite_spans": [],
"ref_spans": [
{
"start": 212,
"end": 219,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Association Norms",
"sec_num": "3.1"
},
{
"text": "For the computation of the syntagmatic associations we used the same corpus as before, namely the British National Corpus. In a preliminary experiment we tested if there is a correlation between the occurrence of a stimulus word in the corpus and the occurrence of the most frequent associative response as given by the subjects. For this purpose, we selected 100 stimulus/response pairs and plotted a bar chart from the co-occurrence data (see figure 1) . In the bar chart, the x-axis corresponds to the distance of the response word from the stimulus word (measured as the number of words separating them), and the y-axis corresponds to the occurrence frequency of the response word in a particular distance from the stimulus word. Please note that for the purpose of plotting this bar chart, function words have been taken into account. As can be seen from the figure, the closer we get to the stimulus word, the more likely it is that we find an occurrence of its strongest associative response. Exceptions are the positions directly neighboring the stimulus word. Here it is rather unlikely to find the response word. This observation can be explained by the fact that content words are most often separated by function words, so that the neighboring positions are occupied by function words. Now that it has been shown that there is some relationship between human word associations and word co-occurrences, let us briefly introduce our algorithm for extracting word associations from texts. Based on a window size of \u00b120 words, we first compute the co-occurrence vector for a given stimulus word, thereby eliminating all words with a corpus frequency of less than 101. We then apply the log-likelihood test to this vector. According to Lawson & Belica 1 the log-likelihood ratio can be computed as follows: Given the word W, for each co-occurring word S, its window frequency A, its residual frequency C in the reference corpus, the residual window size B and the residual corpus size D are stored in a 2 by 2 contingency table.",
"cite_spans": [],
"ref_spans": [
{
"start": 445,
"end": 454,
"text": "figure 1)",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Computation",
"sec_num": "3.2"
},
{
"text": "S \u00acS Total W A B A+B \u00acW C D C+D Total A+C B+D N",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Computation",
"sec_num": "3.2"
},
{
"text": "Then the log-likelihood statistics are calculated: Finally, the vocabulary is ranked according to descending values of G as computed for each word. The word with the highest value is considered to be the primary associative response.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Computation",
"sec_num": "3.2"
},
{
"text": ")) log( ) ( ) log( ) ( ) log( ) ( ) log( ) ( log log log log log ( 2 D C D C D B D B C A C A B A B A N N D D C C",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Computation",
"sec_num": "3.2"
},
{
"text": "In table 3 a few sample association lists as predicted by our system are listed. They can be compared to the human associative responses given in table 2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "3.3"
},
{
"text": "The valuation of the predictions has to take into account that association norms are conglomerates of the answers of different subjects that differ considerably from each other. A satisfactory prediction would be proven if the difference between the pre-dicted and the observed responses were about equal to the difference between an average subject and the rest of the subjects. This is actually the case. For 27 out of the 100 stimulus words the predicted response is equal to the observed primary response. This compares to an average of 28 primary responses given by a subject in the EAT. Other evaluation measures lead to similar good results Rapp, 1996 We conclude from this that our method seems to be well suited to predict the free word associations as produced by humans. And as human associations are not only of syntagmatic but also of paradigmatic type, so does the co-occurrence-based method predict both types of associations rather well. In the ranked lists produced by the system we find a mixture of both types of associations. However, for a given association there is no indication whether it is of syntagmatic or paradigmatic type. We suggest a simple method to distinguish the paradigmatic from the syntagmatic associations. Remember that the 2nd-order approach described in the previous section produced paradigmatic associations only. So if we simply remove the words produced by the 2nd-order approach from the word lists obtained by the 1st-order approach, then this should give us solely syntagmatic associations. Table 4 compares the top five associations to a few stimulus words as produced by the 1st-order and the 2nd-order approach. In the list, we have printed in bold those 1st-order associations that are not among the top five in the second-order lists. Further inspections of these words shows that they are all syntagmatic associations. So the method proposed seems to work in principle. However, we have not yet conducted a systematic quantitative evaluation. Conducting a systematic evaluation is not trivial, since the definitions of the terms syntagmatic and paradigmatic as given in the introduction may not be precise enough. Also, for a high recall, the word lists considered should be much longer than the top five. However, the further down we go in the ranked lists, the less typical are the associations. So it is not clear where to automatically set a threshold. We did not further elaborate on this because for our practical work this issue was of lesser importance. Although both algorithms are based on word cooccurrences, our impression is that their strengths and weaknesses are rather different. So we see a good chance of obtaining an improved generator for associations by combining the two methods. ",
"cite_spans": [
{
"start": 648,
"end": 658,
"text": "Rapp, 1996",
"ref_id": "BIBREF9"
}
],
"ref_spans": [
{
"start": 1541,
"end": 1548,
"text": "Table 4",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "3.3"
},
{
"text": "We have described algorithms for the computation of 1st-order and 2nd-order associations. The results obtained have been compared with the answers of human subjects in the free association task and in the TOEFL synonym test. It could be shown that the performance of our system is comparable to the performance of the subjects for both tasks. We observed that there seems to be some relationship between the type of computation performed (1st-order versus 2nd-order) and the terms syntagmatic and paradigmatic as coined by de Saussure. Whereas the results of the 2nd-order computation are of paradigmatic type exclusively, those of the 1st-order computation are a mixture of both syntagmatic and paradigmatic associations. Removing the 2nd-order associations from the 1st-order associations leads to solely syntagmatic associations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion and Conclusion",
"sec_num": "5"
},
{
"text": "We believe that the observed relation between our statistical models and the intuitions of de Saussure are not incidental, and that the striking similarity of the simulation results with the human associations also has a deeper reason. Our explanation for this is that human associative behavior is governed by the law of association by contiguity, which is well known from psychology (Wettler, Rapp & Ferber, 1993) . In essence, this means that in the process of learning or generating associations the human mind seems to conduct operations that are equivalent to co-occurrence counting, to performing significance tests, or to computing vector similarities (see also Landauer & Dumais, 1997) . However, further work is required to find out to what extent other language-related tasks can also be explained statistically.",
"cite_spans": [
{
"start": 385,
"end": 415,
"text": "(Wettler, Rapp & Ferber, 1993)",
"ref_id": "BIBREF17"
},
{
"start": 670,
"end": 694,
"text": "Landauer & Dumais, 1997)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion and Conclusion",
"sec_num": "5"
},
{
"text": "Handout at GLDV Meeting, Frankfurt/Main 1999.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This research was supported by the DFG. I would like to thank Manfred Wettler and Gerda Ruge for many inspiring discussions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Semantic Feature Extraction from Technical Texts with Limited Human Intervention. Dissertation",
"authors": [
{
"first": "R",
"middle": [],
"last": "Agarwal",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Agarwal, R. (1995). Semantic Feature Extraction from Technical Texts with Limited Human Intervention. Dissertation, Mississippi State University.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Finding Parts in Very Large Corpora",
"authors": [
{
"first": "M",
"middle": [],
"last": "Berland",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Charniak",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of ACL 1999",
"volume": "",
"issue": "",
"pages": "57--64",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Berland, M., Charniak, E. (1999). Finding Parts in Very Large Corpora. In: Proceedings of ACL 1999, Col- lege Park. 57-64.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Cours de linguistique g\u00e9n\u00e9rale",
"authors": [
{
"first": "F",
"middle": [],
"last": "De Saussure",
"suffix": ""
}
],
"year": 1916,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "de Saussure, F. (1916/1996). Cours de linguistique g\u00e9- n\u00e9rale. Paris: Payot.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Accurate methods for the statistics of surprise and coincidence",
"authors": [
{
"first": "T",
"middle": [],
"last": "Dunning",
"suffix": ""
}
],
"year": 1993,
"venue": "Computational Linguistics",
"volume": "19",
"issue": "1",
"pages": "61--74",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dunning, T. (1993). Accurate methods for the statistics of surprise and coincidence. Computational Linguis- tics, 19(1), 61-74.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Evaluation techniques for automatic semantic extraction: comparing syntactic and window based approaches",
"authors": [
{
"first": "G",
"middle": [],
"last": "Grefenstette",
"suffix": ""
}
],
"year": 1993,
"venue": "Proceedings of the Workshop on Acquisition of Lexical Knowledge from Text",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Grefenstette, G. (1993). Evaluation techniques for automatic semantic extraction: comparing syntactic and window based approaches. In: Proceedings of the Workshop on Acquisition of Lexical Knowledge from Text, Columbus, Ohio.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Explorations in Automatic Thesaurus Discovery",
"authors": [
{
"first": "G",
"middle": [],
"last": "Grefenstette",
"suffix": ""
}
],
"year": 1994,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Grefenstette, G. (1994). Explorations in Automatic The- saurus Discovery. Dordrecht: Kluwer.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "An associative thesaurus of English and its computer analysis",
"authors": [
{
"first": "G",
"middle": [
"R"
],
"last": "Kiss",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Armstrong",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Milroy",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Piper",
"suffix": ""
}
],
"year": 1973,
"venue": "The Computer and Literary Studies",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kiss, G.R., Armstrong, C., Milroy, R., Piper, J. (1973). An associative thesaurus of English and its com- puter analysis. In: A. Aitken, R. Beiley and N. Hamilton-Smith (eds.): The Computer and Literary Studies. Edinburgh: University Press.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "A solution to Plato's problem: the latent semantic analysis theory of acquisition, induction, and representation of knowledge",
"authors": [
{
"first": "T",
"middle": [
"K"
],
"last": "Landauer",
"suffix": ""
},
{
"first": "S",
"middle": [
"T"
],
"last": "Dumais",
"suffix": ""
}
],
"year": 1997,
"venue": "Psychological Review",
"volume": "104",
"issue": "2",
"pages": "211--240",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Landauer, T. K.; Dumais, S. T. (1997). A solution to Plato's problem: the latent semantic analysis theory of acquisition, induction, and representation of know- ledge. Psychological Review, 104(2), 211-240.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Automatic Retrieval and Clustering of Similar Words",
"authors": [
{
"first": "D",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 1998,
"venue": "Proceedings of COLING-ACL 1998",
"volume": "2",
"issue": "",
"pages": "768--773",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lin, D. (1998). Automatic Retrieval and Clustering of Similar Words. In: Proceedings of COLING-ACL 1998, Montreal, Vol. 2, 768-773.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Die Berechnung von Assoziationen",
"authors": [
{
"first": "R",
"middle": [],
"last": "Rapp",
"suffix": ""
}
],
"year": 1996,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rapp, R. (1996). Die Berechnung von Assoziationen. Hildesheim: Olms.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Automatic identification of word translation from unrelated English and German corpora",
"authors": [
{
"first": "R",
"middle": [],
"last": "Rapp",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of ACL 1999",
"volume": "",
"issue": "",
"pages": "519--526",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rapp, R. (1999). Automatic identification of word translation from unrelated English and German cor- pora. In: Proceedings of ACL 1999, College Park. 519-526.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Experiments on Linguistically Based Term Associations",
"authors": [
{
"first": "G",
"middle": [],
"last": "Ruge",
"suffix": ""
}
],
"year": 1992,
"venue": "Information Processing & Management",
"volume": "28",
"issue": "3",
"pages": "317--332",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ruge, G. (1992). Experiments on Linguistically Based Term Associations. Information Processing & Ma- nagement 28(3), 317-332.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Wortbedeutung und Termassoziation",
"authors": [
{
"first": "G",
"middle": [],
"last": "Ruge",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ruge, G. (1995). Wortbedeutung und Termassoziation. Hildesheim: Olms.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Introduction to Modern Information Retrieval",
"authors": [
{
"first": "G",
"middle": [],
"last": "Salton",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Mcgill",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Salton, G.; McGill, M. (1983). Introduction to Modern Information Retrieval. New York: McGraw-Hill.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Ambiguity Resolution in Language Learning: Computational and Cognitive Models",
"authors": [
{
"first": "H",
"middle": [],
"last": "Sch\u00fctze",
"suffix": ""
}
],
"year": 1997,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sch\u00fctze, H. (1997). Ambiguity Resolution in Language Learning: Computational and Cognitive Models. Stanford: CSLI Publications.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Retrieving collocations from text: Xtract",
"authors": [
{
"first": "F",
"middle": [],
"last": "Smadja",
"suffix": ""
}
],
"year": 1993,
"venue": "Computational Linguistics",
"volume": "19",
"issue": "1",
"pages": "143--177",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Smadja, F. (1993). Retrieving collocations from text: Xtract. Computational Linguistics 19(1), 143-177.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Computation of word associations based on the co-occurrences of words in large corpora",
"authors": [
{
"first": "M",
"middle": [],
"last": "Wettler",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Rapp",
"suffix": ""
}
],
"year": 1993,
"venue": "Proceedings of the 1st Workshop on Very Large Corpora",
"volume": "",
"issue": "",
"pages": "84--93",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wettler, M.; Rapp, R. (1993). Computation of word associations based on the co-occurrences of words in large corpora. In: Proceedings of the 1st Workshop on Very Large Corpora: Columbus, Ohio, 84-93.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Freie Assoziationen und Kontiguit\u00e4ten von W\u00f6rtern in Texten",
"authors": [
{
"first": "M",
"middle": [],
"last": "Wettler",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Rapp",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Ferber",
"suffix": ""
}
],
"year": 1993,
"venue": "Zeitschrift f\u00fcr Psychologie",
"volume": "201",
"issue": "",
"pages": "99--108",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wettler, M., Rapp, R., Ferber, R. (1993). Freie Asso- ziationen und Kontiguit\u00e4ten von W\u00f6rtern in Texten. Zeitschrift f\u00fcr Psychologie, 201, 99-108.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"text": "Occurrence frequency H of a response word in a particular distance A from the corresponding stimulus word (averaged over 100 stimulus/response pairs).",
"num": null,
"type_str": "figure"
},
"TABREF0": {
"html": null,
"text": "",
"content": "<table><tr><td/><td>).</td><td/></tr><tr><td>blue cold</td><td>fruit</td><td colspan=\"2\">green tobacco whiskey</td></tr><tr><td>red hot</td><td>food</td><td colspan=\"2\">red cigarette whisky</td></tr><tr><td colspan=\"2\">green warm flower</td><td>blue alcohol</td><td>brandy</td></tr><tr><td>grey dry</td><td>fish</td><td colspan=\"2\">white coal champagne</td></tr><tr><td>yellow drink</td><td colspan=\"3\">meat yellow import lemonade</td></tr><tr><td colspan=\"3\">white cool vegetable grey textile</td><td>vodka</td></tr></table>",
"num": null,
"type_str": "table"
},
"TABREF2": {
"html": null,
"text": "Results with the co-occurrence-based approach.",
"content": "<table/>",
"num": null,
"type_str": "table"
},
"TABREF4": {
"html": null,
"text": "Comparison between 1st-order and 2nd-order associations.",
"content": "<table/>",
"num": null,
"type_str": "table"
}
}
}
} |