<?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="257"/><title>OE: WSD Using Optimal Ensembling (OE) Method</title><pubinfo>Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval-2007),pages 257-260, Prague, June 2007. ©2007 Association for Computational Linguistics</pubinfo><author surname="Saarikoski" givenname="Harri M. T."><org  name="Helsinki University" country="Finland" city="Helsinki"/></author></firstpageheader><frontmatter><p><b>OE: WSD Using Optimal Ensembling (OE) Method</b></p><p><b>Harri M. T. Saarikoski</b></p><p>Helsinki University Language Technology PhD Programme F-00014 Helsinki, Finland</p><p>harri.saarikoski@helsinki.fi</p></frontmatter><abstract>Optimal ensembling (OE) is a word sense disambiguation (WSD) method using word-specific training factors (average pos­itive vs negative training per sense, <i>posex </i>and <i>negex) </i>to predict best system (classifier algorithm / applicable feature set) for given target word. Our official entry (OE1) in Senseval-4 Task 17 (coarse-grained En­glish lexical sample task) contained many design flaws and thus failed to show the whole potential of the method, finishing -4.9% behind top system (+0.5 gain over best base system). A fixed system (OE2) finished only -3.4% behind (+2.0% net gain). All our systems were 'closed', i.e. used the official training data only (average 56 training examples per each sense). We also show that the official evaluation mea­sure tends to favor systems that do well with high-trained words. </abstract></header><body><section number="1" title="Introduction"><p>Optimal ensembling is a novel method for combining WSD systems and obtaining higher classification accuracy (presented more fully in Saarikoski et al. 2007). The essential difference from other ensembling methods (such as various types of voting ensembles and cross-validation based best machine selection) is that best machine is predicted using factors calculated from words (e.g. number of senses) and their training data (e.g. number of training examples per sense). The method is loosely based on findings of system performance differences in both WSD (different machines by Yarowsky et al., 2002 and different feature   sets  by  Mihalcea,  2002)  and other classification tasks such as text categorization (Forman et al., 2004, Bay et al., 2002).</p></section><section number="2" title="Method"><p>We first describe in detail the two selection routines in OE as deployed in this experiment.</p><subsection number="2.1" title="Machine (Mach) Selection"><p>We selected support vector machine (SVM) (Vapnik, 1995) and Naive Bayes (NB) (John et al. 1995) as classifiers for our base systems to be optimally ensembled. This was mainly because of their attested strength at earlier Senseval evaluations (Edmonds et al. 2002, Mihalcea et al. 2004) and mutual complementarity discovered by us (Saarikoski et al., 2007). Original batch of candidate machines that we tested for OE using Senseval-2 dataset included the following classifiers: Decision Stump, Decision Tree with various values of confidence (c) parameter 0.05, 0.15, 0.25 and instance-based classifier with <i>k </i>values ranging from 1..15 at intervals of two <footnote anchor="1"/>. After cross-validation runs against current dataset (see below), however, SVM and NB proved again to be overall strongest regardless of training input, so we built OE around those two classifiers.</p></subsection><subsection number="2.2" title="Feature Set (Fset) Selection"><p>We extracted three contextual feature sets from training data for all words to train the machines: 1-grams (1g) and sequential 2-grams both from whole instance (2g) as well as part-of-speech tags from local 1-word window around and including target word (pos3). We also used three 'multifsets' (1g-2g, 1g-pos3, 2g-pos3).</p><footnote label="1">We used Weka implementations (J48, Ibk, SMO, Decision Stump, NaiveBayes) of these algorithms (Witten, 2005).</footnote><page local="2" global="258"/></subsection><subsection number="2.3" title="Best-System Prediction Factors"><p>In Figure 1, we quote prediction factors used for predicting best system for some test words.</p><p>Figure 1. Prediction factors and OE1 accuracy for some test words in Senseval-4 Task 17 (sorted by OE1 accuracy at the word).</p></subsection></section><section number="3" title="System Descriptions"><p>We designed and ran two systems:</p><p><b>OE1 (official): </b>For OE1, we used two machines in three configurations (SVMc=0.1, SVMc=1.0, NB) trained on 3 feature sets, totalling at 3*3 = 9 base systems (number of machines * number of fsets for each). Selection of <i>c(omplexity) </i>parameter for SVM was based on previous knowledge of performance differences of c=0.1 and c=1.0 based systems as reported in Saarikoski et al. (2007). This is based on accounts by e.g. Vapnik (1995) that lower <i>c </i>value makes the classifier generate a more complex training model which is more suitable for tougher words (lower posex, higher negex).</p><p>We learned the best-system predictor model using performance data from Senseval-4 10CV runs only. For 70 words where two fsets performed within +/-5% of each other, we added the next best fset into a 'multifset'.</p><p><b>OE2 (unofficial): </b>This system incorporated the following fixes to OE1 (see Discussion below for motivations for these fixes): First, we significantly reduced the base system grain. We only used two machines strongest in 10CV runs (SVMc=0.1 and NB) and these machines were trained with fsets found best for those machines in 10CV runs: pos3 for both machines, SVMc=0.1 was additionally trained with 1g and NB with 2g respectively. This resulted in a 2 * 2 = 4-system ensemble. Best fset was still selected on the basis of 10CV runs.</p><p>As training data for the best-machine predictor, we used the performance profiles of about 50 systems (both our own and Senseval systems) run mainly against Senseval-2 English lexical sample dataset. We decided to use only two prediction factors (posex and negex, see Figure 1) to predict best machine for each word. This was because previously we had found these two machines (SVM and NB) particularly differing with regard to the combination or cross-section of these two factors. (For illustration of the predictor model with posex and negex as the two axes and discussion of other possible factors, see Saarikoski et. al, 2007. As to reasons for such a performance difference between any two classification machines, see also Yarowsky et al., 2002).</p><p>Difference in the best-system predictions of these two systems (OE1 vs OE2) was substantial: 33 words fully changed machine (from SVM to NB or vice versa), 40 words partially changed the system (change of SVM configuration or change of fset from multifset to single fset). Only 27 words kept the same machine in same configuration and fset. We can therefore call OE2 a substantial revision of OE1 (in effect a rather total departure from CV-based selection toward actual word factor based optimal ensembling).</p><p>In both OEs, the mach-fset combination predicted to be the best for a word was run against the test instances of that word <footnote anchor="2"/>. In case of 'multifsets', each single fset had equal probability-based vote in disambiguating the test instances of that word.<page local="3" global="259"/> As usual, the sense with highest probability was chosen as answer for each instance.</p><footnote label="2">SyntaLex code (Mohammad and Pedersen, 2002, http://www.d.umn.edu/~tpederse/syntalex.html ) was used for extracting n-grams and carrying out disambiguation. Brill Tagger (Brill, 1995) was used for extracting PoS tags. Weka library of classifiers (Witten, 2005) was used to run cross-vali­dations and best-system predictors.</footnote><table class="main" frame="box" rules="all" border="0" 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>uuord</p></td><td class="cell"><p>posex ne</p></td><td class="cell"><p>gex</p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>isl: .V</p></td><td class="cell"><p><b>53</b></p></td><td class="cell"><p><b>290</b></p></td><td class="cell"><p><b>0,52</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>VTijfk .v__</b></p></td><td class="cell"><p><b>26</b></p></td><td class="cell"><p><b>204</b></p></td><td class="cell"><p><b>0j67</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>areiii</p></td><td class="cell"><p><b>65</b></p></td><td class="cell"><p><b>261</b></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>carrier <b>±1</b></p></td><td class="cell"><p><b>9</b></p></td><td class="cell"><p><b>102</b></p></td><td class="cell"><p><b>0,71</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>chanceii</p></td><td class="cell"><p><b>30</b></p></td><td class="cell"><p><b>61</b></p></td><td class="cell"><p><b>0,73</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>prove .v</p></td><td class="cell"><p><b>S</b></p></td><td class="cell"><p><b>41</b></p></td><td class="cell"><p><b>0,73-</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>build .v</p></td><td class="cell"><p><b>40</b></p></td><td class="cell"><p><b>79</b></p></td><td class="cell"><p><b>0,74</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>pT</b><b>.-i</b><b>-hr</b><b>.iKM </b>.v</p></td><td class="cell"><p><b>25</b></p></td><td class="cell"><p><b>25</b></p></td><td class="cell"><p><b>0,75</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>produce v</p></td><td class="cell"><p><b>33</b></p></td><td class="cell"><p><b>77</b></p></td><td class="cell"><p><b>0,75</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>buy.V</p></td><td class="cell"><p><b>23</b></p></td><td class="cell"><p><b>141</b></p></td><td class="cell"><p><b>0,76</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>believe .v</p></td><td class="cell"><p><b>101</b></p></td><td class="cell"><p><b>101</b></p></td><td class="cell"><p><b>0,78</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>r nr. Hit inn n</b></p></td><td class="cell"><p><b>33</b></p></td><td class="cell"><p><b>99</b></p></td><td class="cell"><p><b>0,78</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>State <b>2</b><b>l</b></p></td><td class="cell"><p><b>154</b></p></td><td class="cell"><p><b>463</b></p></td><td class="cell"><p><b>0,79</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>claim, .v</p></td><td class="cell"><p><b>14</b></p></td><td class="cell"><p><b>40</b></p></td><td class="cell"><p><b>0J3</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>re <b>g </b>ird .v</p></td><td class="cell"><p><b>13</b></p></td><td class="cell"><p><b>27</b></p></td><td class="cell"><p><b>ojse</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>camplairi.v</p></td><td class="cell"><p><b>16</b></p></td><td class="cell"><p><b>16</b></p></td><td class="cell"><p><b>0J36</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>recill.v</p></td><td class="cell"><p><b>12</b></p></td><td class="cell"><p><b>37</b></p></td><td class="cell"><p><b>0J87</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>rate ii</p></td><td class="cell"><p><b>505-</b></p></td><td class="cell"><p><b>504</b></p></td><td class="cell"><p><b>0J39</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>repart.v</p></td><td class="cell"><p><b>43</b></p></td><td class="cell"><p><b>85</b></p></td><td class="cell"><p><b>0,91</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>approve <b><i>.v</i></b></p></td><td class="cell"><p><b>27</b></p></td><td class="cell"><p><b>26</b></p></td><td class="cell"><p><b>0,92</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>propose .v</p></td><td class="cell"><p><b>11</b></p></td><td class="cell"><p><b>23</b></p></td><td class="cell"><p><b>0,93</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>complete .v</p></td><td class="cell"><p><b>14</b></p></td><td class="cell"><p><b>28</b></p></td><td class="cell"><p><b>0,54</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>capital ii</p></td><td class="cell"><p><b>56</b></p></td><td class="cell"><p><b>222</b></p></td><td class="cell"><p><b>0,96</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>billii</p></td><td class="cell"><p><b>51</b></p></td><td class="cell"><p><b>353</b></p></td><td class="cell"><p><b>0,56</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>receive .v</p></td><td class="cell"><p><b>63</b></p></td><td class="cell"><p><b>63</b></p></td><td class="cell"><p><b>0,96</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>allow .v</p></td><td class="cell"><p><b>54</b></p></td><td class="cell"><p><b>54</b></p></td><td class="cell"><p><b>0,57</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>value ii</p></td><td class="cell"><p><b>67</b></p></td><td class="cell"><p><b>268</b></p></td><td class="cell"><p><b>0,98</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><section number="4" title="Test Results"><p>Here are the results:</p><p>Table 1. Results of OE systems. In columns 2-3, macro (micro) averaged per-word gross and net gains calculated from actual test runs (not 10CV runs) are reported. Column 4 reports the official macro-averaged accuracy for all words of our systems. (Differences of the respective benefits of these evaluation measures are outlined in Discussion below and more generally in Sebastiani (2002). Terms 'gross (or potential) gain' and 'net (realized) gain' are defined in Saarikoski et al. (2007).).</p></section><section number="5" title="Discussion"><p>We now turn to analyze these results. We can first note that results are largely in line with our previous findings with OEs and other types of ensembles (see Saarikoski et al., 2007). In what follows we attempt to account for the results: why OE1 finished as much behind top system and also why OE2 performed that much better than OE1. This first 'known issue' concerns both OEs:</p><p><b>(1) Base system accuracy was low because we did not use strong fsets: </b>Our official entry finished at 7th place in the evaluation, -4.9% behind top system while the inofficial entry would have finished in 5th place (-3.4% behind). We attribute this mainly to the absence of more advanced feature sets. For example, we did not employ syntactic parse features (such as predicate-object pairs) from which Yarowsky et al. (2002) showed +2% gain. We would also naturally lose to any systems using extra training or lexical knowledge (e.g. 2nd place finisher UBC-ALM, at 86.9 accuracy, used both semantic domains and SemCor corpus). But without knowing how much extra knowledge such 'open' systems used, we cannot say by how much.</p><footnote label="3">Best base system in both OEs was NB-pos3 (83.3).</footnote><p>Specifically in OE1 entry, there were two basic design flaws which we address next.</p><p><b>(2) Base system grain was too high to produce enough net gain: </b>The base system grain (18 base systems) we attempted to predict in OE1 was far too great since prediction accuracy rapidly decreases when adding new systems. The grain was also unnecessarily great, since the 4-grain we used for OE2 could harvest most of the gross gain (cf. gross gains of the two systems in Table 1).</p><p><b>(3) Using 10CV runs uncritically for best fset selection: </b>This was ill-advised because of many reasons. First, selecting best fset for WSD based on CV runs is known to be a difficult task (Mihalcea, 2002). Prediction accuracy for the three fsets we used for OE1 was 0.74, i.e. for 26 words out of 100 best fset was mispredicted. About half of these were cases where machine was mispredicted as well and average loss tended to be even greater. Second, multifsets could not be 10CV-tested with the Weka machine-learning toolkit we used (Witten, 2005). Our custom resolution to this multifset selection task was to select best and next best fset. This turned out to produce many false predictions, some of which were quite substantial (&gt; 10% loss to best fset). For instance, at <i>system.n </i>we lost &gt; 30% from selecting NB-2g instead of actual best system (NB-pos3). Third, only after submitting the entry, we also realized two strongest fsets are not necessarily complementary (i.e. that each would contain relevant clues for <i>different </i>test instances) and that learning machines might be confused (i.e. could not effectively carry out feature selection and weighting) by the profusion and heterogeneity of features in multifsets. In fact, we found that omitting multifsets from OE1 (i.e. having 3 single fsets with the same 3 machines = 6-system OE) would have worked slightly better than OE1 (3*3=9): the accuracy rose from 83.8 to 84.1. Fourth, it was found previously (Saarikoski et al., 2007) that CV-based best system prediction scheme tends to produce less gain than OE (cf. accuracy of OE1 &lt; OE2 in Table 1).</p><p>The remaining argument discusses Senseval evaluation measure (applies to all OE systems):</p><p><b>(4) Official evaluation measure is particularly unfavorable to OE systems: </b>Senseval scoring scheme<footnote anchor="4"/> is calculated as the number of instances disambiguated correctly divided by number of all instances in test dataset.<page local="4" global="260"/> This measure (termed 'macro-averaged accuracy' in Sebastiani, 2002) is known to upweigh classification cases (words) that have more test instances. While we recognize the usefulness of this measure, we calculated in Table 1 the alternative measure (termed 'micro-averaged accuracy' in Sebastiani, 2002). It differs from the former (defined by e.g. Sebastiani, 2002) in that <i>all words are treated equally </i>(i.e. 'normalized') regardless of number of test instances. In addition, it has been Senseval practice (Edmonds et al. 2002, Mihalcea et al. 2004) that words with great number of test instances tend to have an equally great number of training instances. At such 'easier' words, system performance differences (sysdiff) occur much less and since OE is based on locating and making use of sysdiff, it cannot perform well. Therefore, it is liable to lose to single-machine systems with inherently stronger fsets (see point 1 above). For these reasons, the measures are very different with the latter revealing the OE potential more appropriately.</p><footnote label="4">Documentation for scoring scheme can be found at: http://www.cse.unt.edu/~rada/senseval/senseval3/scoring/</footnote><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>system name</p></td><td class="cell"><p>gross gain</p></td><td class="cell"><p>net gain</p></td><td class="cell"><p>accuracy<footnote anchor="3"/></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>OE1</p></td><td class="cell"><p><b>+3.0 (+7.8)</b></p></td><td class="cell"><p><b>+0.5 (+4.4)</b></p></td><td class="cell"><p><b>83.8</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>OE2</p></td><td class="cell"><p><b>+2.3 (+7.0)</b></p></td><td class="cell"><p><b>+2.0 (+5.8)</b></p></td><td class="cell"><p><b>85.3</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><p>In fact, we estimate that only 40 out of the 100 test words in this dataset show any kind of sysdiff between most participating systems (&gt; 5% macro-averaged sysdiff per word). Furthermore, only 20 of them only are likely to produce substantial sysdiff (&gt; 10%). For example, in our 10CV runs, we got 0.99 accuracies by all base systems for the very highly trained word <i>say.v </i>with posex &gt; 500. If there was a participating system that achieved 1.00 in such a single high-train word (say.v), the huge number of test instances of that word raised its macro-averaged accuracy, winning considerably over systems performing well with low-train words (e.g. <i>propose.v </i>with posex=11 and negex=24 and grain=3 where both OE1 and OE2 performed at 0.93 accuracy owing to correct best system choice). In other words, the official measure does not account for the finding (Yarowsky et al., 2002 and Saarikoski et al., 2007) that systems considerably differ precisely in terms of their ability to disambiguate high/low-train words (measured by posex/negex factors). Therefore, it can be said that the official measure fails to treat all systems equally.</p></section><section number="6" title="Conclusion and Further Work"><p>Since OE is a generic method that can be applied to any base systems, we believe it has a place in</p><p>WSD methodology. With remaining open questions resolved (optimizing system grain to feasible prediction accuracy, discovering more predictive factors for both machines and fsets, understanding how the evaluation measures complete each other), it is probable that OE can improve current state of the art WSD systems (especially if provided with stronger while still complementary base systems). Though OE systems run the risk that OE may in fact be inferior to its best base system, we would like to note that thus far no OE of ours (around 10-15 different tests) has failed to produce net gain.</p></section><references><p>Bay, S. D., and Pazzani, M. J. Characterizing model errors and differences. In 17th International Conference on Machine Learning (2000)</p><p>Brill, E. Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part of Speech Tagging Computational Linguistics (1995)</p><p>Edmonds, P., and Kilgarriff, A. Introduction to the Special Issue on evaluating word sense disambiguation programs. Journal of Natural Language Engineering 8(4) (2002)</p><p>Forman, G., and Cohen, I. Learning from Little: Comparison of Classifiers Given Little Training. In ECML, 15th European Conference on Machine Learning and the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)</p><p>John, G. and Langley, P. Estimating Continuous Distributions in Bayesian Classifiers. Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, San Mateo (1995)</p><p>Mihalcea, R. Word sense disambiguation with pattern learning and automatic feature selection. Journal of Natural Language Engineering, 8(4) (2002)</p><p>Mihalcea, R., Kilgarriff, A. and Chklovski, T. The SENSEVAL-3 English lexical sample task. Proceedings of SENSEVAL-3 Workshop at ACL (2004)</p><p>Mohammad, S. and Pedersen, T (2004). Complementarity of Lexical and Simple Syntactic Features: The Syntalex Approach to Senseval-3. Proceedings of Senseval-3</p><p>Saarikoski, H., Legrand, S., Gelbukh, A. (2007) Case-Sensitivity of Classifiers for WSD: Complex Systems</p><p>Disambiguate Tough Words Better. In CICLING 2007 and</p><p>Lecture Notes in Computer Science, Springer Sebastiani,   F.   Machine   learning   in   automated text categorization, ACM Computing Surveys (CSUR), Vol.</p><p>34 Issue 1 (2002) ACM Press, New York, NY, USA. Vapnik, V. N. The Nature of Statistical Learning Theory.</p><p>Springer (1995) Witten, I., Frank, E. Data Mining: Practical Machine Learning</p><p>Tools   and   Techniques   (Second   Edition). Morgan</p><p>Kaufmann (2005).</p><p>Yarowsky, D. and Florian, R. Evaluating sense disambiguation across diverse parameter spaces. Journal of Natural Language Engineering, 8(4) (2002) 293-311.</p></references></body></article>