<?xml version="1.0"?><!DOCTYPE article SYSTEM "/project/take/software/searchbench_offline_processing/paperxml_generator/aclextractor/src/python/../resource/dtd/paperxml.dtd"><article><header><firstpageheader><page local="1" global="83"/><title>Classifier Optimization and Combination in the English All Words Task</title><author surname="Hoste" givenname="Véronique"><org  name="University of Antwerp" country="Belgium" city="Antwerp"/></author><author surname="Kool" givenname="Anne"><org  name="University of Antwerp" country="Belgium" city="Antwerp"/></author><author surname="Daelemans" givenname="Walter"><org  name="University of Antwerp" country="Belgium" city="Antwerp"/></author></firstpageheader><frontmatter><p>Classifier optimization and combination in the English all words</p><p>task.</p><p>Véronique Hoste and Anne Kool and Walter Daelemans</p><p>CNTS - Language Technology Group University of Antwerp Universiteitsplein 1, 2610 Wilrijk hoste@uia.ua.ac.be, kool@uia.ua.ac.be, daelem@uia.ua.ac.be</p></frontmatter><abstract>We report on the use of machine learning tech­niques for word sense disambiguation in the English all words task of SENSEVAL2. The task was to automatically assign the appropri­ate sense to a possibly ambiguous word form given its context. A "word expert" approach was adopted, leading to a set of classifiers, each specialized in one single word form-POS combi­nation. Experts consist of multiple classifiers trained on Semcor using two types of learn­ing techniques, viz. memory-based learning and rule-induction. Through optimization by cross-validation of the individual classifiers and the voting scheme for combining them, the best possible word expert was determined. Results show that especially memory-based learning in a word-expert approach is a feasible method for unrestricted word-sense disambiguation, even with limited training data. </abstract></header><body><section number="1" title="Introduction"><p>We report on the use of machine learning, especially memory-based learning and classi­fier combination, for word sense disambiguation (WSD) in the English all words task of SEN-SEVAL2. WSD can be described as the prob­lem of assigning the appropriate sense to a given word in a given context. Machine learning tech­niques show state-of-the-art accuracy on WSD, e.g. memory-based learning (Ng and Lee, 1996; Veenstra et al., 2000), decision lists (Yarowsky, 2000), and combination methods (Escudero et al., 2000).</p><p>Results of the first SENSEVAL exercise for English (Killgarriff and Rosenzweig, 2000), in which only a restricted set of words had to be disambiguated, showed that supervised learn­ing systems outperform unsupervised ones, even when little corpus training material was available. In our submission to SENSEVAL2, we in­vestigated whether the supervised learning ap­proach can be scaled to the all-words task. As a back-off for word-tag pairs for which no or not enough training data was available, we used the most frequent sense in the WordNetl.7 sense lexicon (Fellbaum, 1998) as default classifier in the disambiguation process. Sense disambigua­tion was mainly performed by a memory-based learning classifier. Also the use of rule induc­tion was explored. Furthermore, the outputs of these different classifiers were combined in order to study the usefulness of different voting strate­gies. Results show that all classifiers outperform the WordNet baseline and that memory-based learning compares favorably to rule induction and different voting strategies.</p><p>In the remainder of this paper, we first out­line the sense-disambiguation architecture used in the experiments, and discuss the word ex­pert approach and the optimization procedure. Then we report on the generalization accuracy achieved for the SENSEVAL2 test data.</p></section><section number="2" title="Experimental Setup 2.1 Preprocessing"><p>In the experiments, the Semcor corpus included in WordNetl.6 was used as training corpus. In the corpus, every word is linked to its appropri­ate sense in the lexicon. Texts that were used to create the semantic concordances were ex­tracted from the Brown Corpus and then linked to senses in the WordNet lexicon. The training corpus consists of 409,990 wordforms, of which 190,481 are sense-tagged. For each word form in the corpus, a lemma and a part of speech is given.</p><p>The test data in the English all words task consist of three articles on different topics, with at total of 2,473 words to be sense-tagged. For<page local="2" global="84"/></p><doubt alpha="66.7" length="6" tooSmall="False" monospace="0.0">(text)</doubt><p>Tokenization Lemmatization POS tagging</p><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">T</doubt><p>WordNet lookup per word/POS</p><p>WORD EXPERT MODULE</p><p>Local context (word-lemma-POS)</p><p>Context keywords &gt; threshold -keywords WN examples</p><p>Local context+ all context keywords</p><p>TWO-LEVEL CROSS-VALIDATION</p><doubt alpha="100.0" length="5" tooSmall="False" monospace="0.0">TiMBL</doubt><doubt alpha="100.0" length="6" tooSmall="False" monospace="0.0">Ripper</doubt><doubt alpha="100.0" length="7" tooSmall="False" monospace="0.0">WordNet</doubt><p>(assign sense</p><p>Majority voting Weighted Voting</p><figure caption="Figure 1: Disambiguation process."></figure><p>both the training and the test corpus, only the word forms were used and tokenization, lemma­tization and POS-tagging were done with our own software. For the part of speech tagging, the memory-based tagger MBT (Daelemans et al., 1996), trained on the Wall Street Journal corpus<footnote anchor="1"/>, was used. On the basis of word and POS information, lemmatization was done<footnote anchor="2"/>.</p><subsection number="2.2" title="Word experts"><p>After the preprocessing stage, WordNetl.7 was used to guide the sense disambiguation pro­cess. For every combination of a word form and a POS, WordNet was consulted to determine whether this combination had one or more pos­sible senses. In case of only one possible sense (about 20% of the test words), the appropriate WordNet sense was assigned. In case of more possible senses, a threshold of 11 occurrences in the Semcor training data was determined. For all words below this threshold, the most frequent sense according to WordNet was as­signed as sense-tag. For the other words, which represent more than 60% of the word forms to be sense-tagged, word experts were built for each word form-POS combination, leading to 568 word experts for the SENSEVAL2 test data.</p><p>These word experts consist of different trained subcomponents (see Figure 1) which make use of different knowledge.</p><footnote label="1">ACL Data Collection Initiative CD-Rom 1, Septem­ber 1991</footnote><footnote label="2">With a memory-based lemmatizer trained by Antal van den Bosch, see http://ilk.kub.nl/</footnote><p>The first subcomponent is trained us­ing TiMBL, a package containing several memory-based learning algorithms and metrics (Daelemans et al., 2000). It takes as input a vector representing the local context of the focus word in a window of three word forms to the left and three to the right. For the focus word, also the lemma and POS are provided. For the context word forms, POS information is given. E.g., the following is a training instance: <b>many JJ times MS , , yet yet RB on IN each JJ occasion NN yet</b>%4:02:02 : :. During training, those instances are stored in memory and during sense-tagging, the instance most similar to that of the ambiguous word and its context is selected and the associated class is returned as sense-tag.</p><p>A second subcomponent of each word ex­pert trained with TiMBL is trained with in­formation about possible disambiguating con­tent keywords in a context of three sentences. The method used to extract these keywords for each sense is based on the work of (Ng and Lee, 1996). They determine the probability of a sense s of a focus word / given keyword <i>k </i>by dividing <i>Ns^ioc </i>(the number of occurrences of a possible local context keyword <i>k </i>with a par­ticular focus word-POS combination <i>w </i>with a particular sense <i>s)</i><i> </i>by <i>N^ioc </i>(the number of oc­currences of a possible local context keyword <i>kloc </i>with a particular focus word-POS combination <i>w </i>ignoring its sense).<page local="3" global="85"/> In addition, we also took into account the frequency of a pos­sible keyword in the complete training corpus</p><doubt alpha="26.7" length="15" tooSmall="False" monospace="0.0">p(s\k) = ^X (^)</doubt><p>A word is a keyword for a given sense if (i) the word occurs more than Mi times in that sense <i>s, </i>where Mi is a predefined minimum number of times and if (ii) <i>p(s\k) &gt; </i><b>M2</b><b> </b>for that sense <i>s, </i>where <b>M2</b><b> </b>is some predefined minimum proba­bility. Due to time restrictions Mi was not op­timized by cross-validation, but arbitrarily set to 3 and M2 to 0.001.</p><p>In addition to the keyword information ex­tracted from the local context of the focus word, possible disambiguating content words were also extracted from the examples that accompany the different sense definitions for a given focus word in WordNet. For each combination of a word form, POS and sense, all content words were extracted and added to the input vector of the memory-based learner. Both the contex­tual keywords and the example keywords were represented as binary features, with a value of 1 when the keyword was present in the example and 0 if not<footnote anchor="3"/>.</p><p>The third subcomponent of each word expert was trained with Ripper (Cohen, 1995), a rule learning algorithm, allowing both single-valued and set-valued attributes. In our disambigua­tion task, the ripper input vector contained lo­cal context feature values (as the first TiMBL), and a set-valued feature with all content words in a context of three sentences.</p></subsection></section><section number="3" title="Optimization and Voting"><p>In order to improve the predictions of the dif­ferent single learning algorithms, algorithm pa­rameter optimization was performed where pos­sible. Furthermore, the possible gain in accu­racy of different voting strategies was explored.</p><subsection number="3.1" title="Optimization"><p>For the first TiMBL memory-based learner, backward sequential selection (BSS) (Aha and</p><footnote label="3">Since no length limitations were taken into account when building these vectors, they could grow very large. Therefore, a version of TiMBL was used that is opti­mized for sparse binary features, and allows a positional representation of the active keywords rather than a bi­nary one, written by Jakub Zavrel.</footnote><p>Bankert, 1994) was performed for each word form-POS combination. BSS starts from the complete feature set and generates in each iter­ation new subsets by discarding a feature. The feature string with the best performance is re­tained. Furthermore, the use of different fea­ture weighting possibilities was explored, viz. gain ratio weighting, information gain weight­ing, chi-squared weighting and shared variance weighting. For each feature weighting possi­bility, the <i>k </i>value, representing the number of nearest neighbours used for extrapolation, was varied between 1 and 19. Leave-one-out was used as testing method: testing was done on each instance of the training file, while the re­mainder of the training file functioned as train­ing material.</p><p>Due to the size of the feature vectors for the second memory-based learner, which takes content words from the surrounding sentences and from the example sentences in the Word-Net definitions as input, no feature selection was performed. For the same reasons, 10-fold cross-validation was used as testing method: the training data was split into 10 different parts and in each iteration, one part served as test set, while the remainder was used to train the classifier. The <i>k </i>value was varied (1-19), dif­ferent weighting techniques (gain ratio weight­ing, chi-squared weighting and log likelihood weighting) and different distance metrics (num­ber of mismatches, number of matches, number of matches minus number of mismatches) were explored.</p><p>For Ripper, the default parameter settings were used, due to time constraints and the slow­ness of the cross-validation process. 10-fold-cross-validation was used as testing method.</p></subsection><subsection number="3.2" title="Voting"><p>On the output of these three (optimized) classi­fiers and the default Word .Not 1.7. most frequent sense, both majority voting and weighted vot­ing was performed. In case of majority voting, each sense-tagger is given one vote and the tag with most votes is selected. In weighted vot­ing, more weight is given to the taggers with a higher overall accuracy. In case of ties when voting over the output of 4 classifiers, the first decision (TiMBL) was taken as output class. Voting was also performed on the output of the three learning classifiers without taking into account the WordNet class.<page local="4" global="86"/> Table 1 shows the best performing classifiers per word form-POS combination of the Semcor train set: both op­timized memory-based learners outperform the other classifiers.</p></subsection></section><section number="4" title="Results"><p>Table 2 shows the accuracy of our disambigua­tion system on the English all words test set. Since all 2,473 word forms were covered, no dis­tinction is made between precision and recall. An accuracy of 63.61% and 64.54% were ob­tained according to the fine-grained and coarse­grained SENSEVAL2 scoring, respectively. Just as in the first SENSEVAL task for English (Kill­garriff and Rosenzweig, 2000), top performance was for the nouns. All 86 "unknown" word forms, for which the test set annotators decided that no WordNetl.7 sense-tag was applicable, were obviously incorrectly classified.</p><table caption="Table 2: Results on the SENSEVAL2 test data.5Conclusion"></table><p>This paper reported on the architecture and the results of the CNTS-Antwerp automatic disam­biguation system in the context of the SENSE-VAL2 English all words task. Disambiguation per word form-POS pair is performed through the application of word experts trained on local context information and cross-validated on the limited available training data. Among these word experts, optimized memory-based learning proves to be more accurate than default Ripper rule-induction and various voting strategies.</p></section><section title="Acknowledgements"><p>We like to thank Antal van den Bosch for taking care of the lemmatization and Erik Tjong Kim Sang for programming support.</p><table caption="Table 1: Best performing word experts on the Semcor train set" class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Classifier</p></td><td class="cell"><p>no. WE</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Default <b>(WordNetl.7)</b></p></td><td class="cell"><p>16</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>TiMBL (context)</p></td><td class="cell"><p><b>155</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>TiMBL (keywords)</p></td><td class="cell"><p><b>185</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Ripper</p></td><td class="cell"><p>16</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Majority Voting</p></td><td class="cell"><p>33</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Weighted Voting</p></td><td class="cell"><p>58</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Majority Voting (no WordNet)</p></td><td class="cell"><p>53</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Weighted Voting (no WordNet)</p></td><td class="cell"><p>52</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>568</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>key</p></td><td class="cell"><p>fine %</p></td><td class="cell"><p>coarse %</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>noun (%1)</p></td><td class="cell"><p>1,067</p></td><td class="cell"><p>74.51</p></td><td class="cell"><p>75.45</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>verb (%2)</p></td><td class="cell"><p>554</p></td><td class="cell"><p>47.83</p></td><td class="cell"><p>49.64</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>adj. (%3-%5)</p></td><td class="cell"><p>465</p></td><td class="cell"><p>62.58</p></td><td class="cell"><p>63.44</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>adv. (%2)</p></td><td class="cell"><p>301</p></td><td class="cell"><p>73.42</p></td><td class="cell"><p>73.42</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>unkn.</p></td><td class="cell"><p></p></td><td class="cell"><p>0.00</p></td><td class="cell"><p>0.00</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>total</p></td><td class="cell"><p><b>2,473</b></p></td><td class="cell"><p><b>63.61</b></p></td><td class="cell"><p><b>64.54</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table></section><references><p>D.W. Aha and R.L. Bankert. 1994. Feature selec­tion for case-based classification of cloud types: An empirical comparison. In <i>Proceedings of the 1994 A A AI Workshop on Case-Based Reasoning, </i>pages 106-112. AAAI Press.</p><p>W.W. Cohen. 1995. Fast effective rule induction. In <i>Proc. 12th International Conference on Machine Learning, </i>pages 115-123. Morgan Kaufmann.</p><p>W. Daelemans, J. Zavrel, P. Berck, and S. Gillis. 1996. Min : A memory-based part of speech tagger-generator. In E. Ejerhed and I. Dagan, ed­itors, <i>Fourth Workshop on Very Large Corpora, </i>pages 1 1 27.</p><p>W. Daelemans, J. Zavrel, K. van der Sloot, and A. van den Bosch. 2000. Timbl: Tilburg mem­ory based learner, version 3.0, reference guide.</p><p>G. Escudero, L. Marquez, and G. Rigau. 2000. Boosting applied to word sense disambiguation. In <i>European Conference on Machine Learning, </i>pages 129-141.</p><p>C. Fellbaum. 1998. <i>WordNet : An Electronic Lexi­cal Database. </i>MIT Press.</p><p>A. Killgarriff and J. Rosenzweig. 2000. English sen-seval: Report and results. In <i>Proceedings of the 2nd International Conference on Language Re­sources and Evaluation, </i>pages 1239-1243.</p><p>H. T. Ng and H.B. Lee. 1996. Integrating multiple knowledge sources to disambiguate word sense: An exemplar-based approach. In Arivind Joshi and Martha Palmer, editors, <i>Proceedings of the Thirty-Fourth Annual Meeting of the Association for Computational Linguistics, </i>pages 40-47, San Francisco. Morgan Kaufmann Publishers.</p><p>J. Veenstra, A. Van den Bosch, S. Buchholz, W. Daelemans, and J. Zavrel. 2000. Memory-based word sense disambiguation. <i>Computers and the Humanities, </i>34(1/2):171-177.</p><p>D. Yarowsky. 2000. Hierarchical decision lists for word sense disambiguation. <i>Computers and the Humanities, </i>34(1/2):179-186.</p></references></body></article>