<?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="264"/><title>PNNL: A Supervised Maximum Entropy Approach to Word Sense Disambiguation</title><pubinfo>Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval-2007),pages 264-267, Prague, June 2007. ©2007 Association for Computational Linguistics</pubinfo><author surname="Tratz" givenname="Stephen"><org  name="Pacific Northwest National Laboratory" country="USA" city="Richland"/></author><author surname="Sanfilippo" givenname="Antonio"><org  name="Pacific Northwest National Laboratory" country="USA" city="Richland"/></author><author surname="Gregory" givenname="Michelle"><org  name="Pacific Northwest National Laboratory" country="USA" city="Richland"/></author><author surname="Chappell" givenname="Alan"><org  name="Pacific Northwest National Laboratory" country="USA" city="Richland"/></author><author surname="Posse" givenname="Christian"><org  name="Pacific Northwest National Laboratory" country="USA" city="Richland"/></author><author surname="Whitney" givenname="Paul"><org  name="Pacific Northwest National Laboratory" country="USA" city="Richland"/></author></firstpageheader><frontmatter><p><b>PNNL: A Supervised Maximum Entropy Approach to Word Sense</b></p><p><b>Disambiguation</b></p><p><b>Stephen Tratz, Antonio Sanfilippo, Michelle Gregory, Alan Chappell, Christian</b></p><p><b>Posse, Paul Whitney</b></p><p>Pacific Northwest National Laboratory 902 Battelle Blvd, PO Box 999 Richland, WA 99352, USA {stephen.tratz,  antonio.sanfilippo, michelle, alan.chap-pell,  christian.posse, paul.whitney}@pnl.gov</p></frontmatter><abstract>In this paper, we described the PNNL Word Sense Disambiguation system as ap­plied to the English all-word task in Se-mEval 2007. We use a supervised learning approach, employing a large number of features and using Information Gain for di­mension reduction. The rich feature set combined with a Maximum Entropy classi­fier produces results that are significantly better than baseline and are the highest F-score for the fined-grained English all-words subtask of SemEval. </abstract></header><body><section number="1" title="Introduction"><p>Accurate word sense disambiguation (WSD) can support many natural language processing and knowledge management tasks. The main goal of the PNNL WSD system is to support Semantic Web applications, such as semantic-driven search and navigation, through a reliable mapping of words in naturally occurring text to ontological classes. As described in Sanfilippo et al. (2006), this goal is achieved by defining a WordNet-based (Fellbaum, 1998) ontology that offers a manage­able set of concept classes, provides an extensive characterization of concept class in terms of lexical instances, and integrates an automated class recog­nition algorithm. We found that the same features that are useful for predicting word classes are also useful in distinguishing individual word senses.</p><p>Our main objective in this paper is to predict in­dividual word senses using a large combination of features including contextual, semantic, and syn­tactic information. In our earlier paper (Sanfilippo et al., 2006), we reported that the PNNL WSD system exceeded the performance of the best perform­ers for verbs in the SENSEVAL-3 English all-words task dataset. SemEval 2007 is our first op­portunity to enter a word sense disambiguation competition.</p></section><section number="2" title="Approach"><p>While many unsupervised word sense disambigua­tion systems have been created, supervised systems have generally produced superior results (Snyder and Palmer, 2004; Mihalcea et al., 2004). Our sys­tem is based on a supervised WSD approach that uses a Maximum Entropy classifier to predict WordNet senses.</p><p>We use SemCor<footnote anchor="1"/>, OMWE 1.0 (Chklovski and Mihalcea, 2002), and example sentences in Word­Net as the training corpus. We utilize the OpenNLP MaxEnt implementation<footnote anchor="2"/> of the maxi­mum entropy classification algorithm (Berger et al., 1996) to train classification models for each lemma and part-of-speech combination in the train­ing corpus. These models are used to predict WordNet senses for words found in natural text. For lemma and part-of-speech combinations that are not present in the training corpus, the PNNL WSD system defaults to the most frequent Word­Net sense.</p><subsection number="2.1" title="Features"><p>We use a rich set of features to predict individual word senses. A large number of features are ex­tracted for each word sense instance in the training data. Following Dang &amp; Palmer (2005) and Ko-homban &amp; Lee (2005), we use contextual, syntac­tic and semantic information to inform our word sense disambiguation system.<page local="2" global="265"/> However, there are significant differences between the specific types of contextual, syntactic and semantic information we use in our system and those proposed by Dang &amp; Palmer (2005) and Kohomban &amp; Lee (2005). More specifically, we employ novel features and feature combinations, as described below.</p><footnote label="1"> http://www.cs.unt.edu/~rada/downloads.html .</footnote><footnote label="2"> http://maxent.sourceforge.net/ .</footnote><p><i>• Contextual information. </i>The contextual infor­mation we use includes the word under analy­sis plus the three tokens found on each side of the word, within sentence boundaries. Tokens include both words and punctuation.</p><p><i>• Syntactic information. </i>We include grammatical dependencies (e.g. subject, object) and mor-pho-syntactic features such as part of speech, case, number and tense. We use the Connexor parser<footnote anchor="3"/> (Tapanainen and Järvinen, 1997) to ex­tract lemma information, parts of speech, syn­tactic dependencies, tense, case, and number information. A sample output of a Connexor parse is given in Table 1. Features are extract­ed for all tokens that are related through no more than 3 levels of dependency to the word to be disambiguated.</p><p><i>• Semantic information. </i>The semantic informa­tion we incorporate includes named entity types (e.g. PERSON, LOCATION, ORGANI­ZATION) and hypernyms. We use OpenNLP<footnote anchor="4"/>and LingPipe<footnote anchor="5"/> to identify named entities, re­placing the strings identified as named entities (e.g., Joe Smith) with the corresponding entity type (PERSON). We also substitute personal pronouns that unambiguously denote people with the entity type PERSON. Numbers in the text are replaced with type label NUMBER. Hypernyms are retrieved from WordNet and added to the feature set for all noun tokens se­lected by the contextual and syntactic rules. In contrast to Dang &amp; Palmer (2005), we only in­clude the hypernyms of the most frequent sense, and we include the entire hypernym chain (e.g. motor, machine, device, instrumen­tality, artifact, object, whole, entity).</p><p>To address feature extraction processes specific to noun and verbs, we add the following condi­tions.</p><footnote label="3"> http://www.connexor.com/ .</footnote><footnote label="4"> http://opennlp.sourceforge.nt/ .</footnote><footnote label="5"> http://www.alias-i.com/lingpipe/ .</footnote><p><i>• Syntactic information for verbs. </i>If the verb does not have a subject, the subject of the clos­est ancestor verb in the syntax tree is used in­stead.</p><p><i>• Syntactic information for nouns. </i>The first verb ancestor in the syntax tree is also used to gen­erate features.</p><p><i>• Semantic information for nouns. </i>A feature in­dicating whether a token is capitalized for each of the tokens used to generate features.</p><p>A sample of the resulting feature vectors that are used by the PNNL word sense disambiguation sys­tem is presented in Table 2.</p><doubt alpha="85.7" length="7" tooSmall="False" monospace="0.0">ID Word</doubt><doubt alpha="60.0" length="5" tooSmall="False" monospace="0.0">1 the</doubt></subsection></section><section number="2" title="engine"></section><section number="3" title="throbbe"><doubt alpha="33.3" length="3" tooSmall="False" monospace="0.0">4 d</doubt><doubt alpha="66.7" length="6" tooSmall="False" monospace="0.0">5 into</doubt><doubt alpha="66.7" length="6" tooSmall="False" monospace="0.0">6 life</doubt><doubt alpha="100.0" length="5" tooSmall="False" monospace="0.0">Lemma</doubt><doubt alpha="100.0" length="3" tooSmall="False" monospace="0.0">the</doubt><doubt alpha="100.0" length="6" tooSmall="False" monospace="0.0">engine</doubt><doubt alpha="100.0" length="5" tooSmall="False" monospace="0.0">throb</doubt><doubt alpha="100.0" length="4" tooSmall="False" monospace="0.0">into</doubt><doubt alpha="100.0" length="4" tooSmall="False" monospace="0.0">life</doubt><p><b>Grammatical Dependen­cies</b> <b>Morphosyntactic Features</b></p><doubt alpha="50.0" length="6" tooSmall="False" monospace="0.0">det:&gt;2</doubt><doubt alpha="57.1" length="7" tooSmall="False" monospace="0.0">subj:&gt;3</doubt><doubt alpha="57.1" length="7" tooSmall="False" monospace="0.0">main:&gt;0</doubt><doubt alpha="50.0" length="6" tooSmall="False" monospace="0.0">goa:&gt;3</doubt><doubt alpha="62.5" length="8" tooSmall="False" monospace="0.0">pcomp:&gt;4</doubt><doubt alpha="58.3" length="84" tooSmall="True" monospace="0.0">@DN&gt; %&gt;N DET @SUBJ %NH N NOM SG @+FMAINV °%/A V PAST @ADVL %EH PREP @&lt;P %NH N NOM SG</doubt><p><b>Table 1. </b>Connexor sample output for the sentence <i>"The engine throbbed into life".</i><i></i></p><doubt alpha="66.7" length="60" tooSmall="False" monospace="0.0">pre:2:the, pre:2:pos:DET, det.the, det:pos:DET, hassubj:det:</doubt><p>pre.1.num.SG,subj.instrumentality,subj.object, subj.arti-fact, subj.device, subj.engine, subj.motor, subj.whole, subj.entity, subj.machine, subj.pos.N, hassubj., subj.case.NOM, subj.num.SG,</p><p>throbbed   haspre.1.,haspre.2.,haspost.1., haspost.2., haspost.3., self.throb, self.pos.V, main.,throbbed, self.tense.PAST post.2.case.NOM, post.2.num.SG, hasgoa., pcomp.life, pcomp.state, pcomp.being, pcomp.pos.N, hasgoa.pcomp., goa.pcomp.case.NOM, goa.pcomp.num.SG</p><doubt alpha="61.5" length="65" tooSmall="False" monospace="0.0">into        post.1.into, post.1.pos.PREP, goa.into, goa.pos.PREP,</doubt><doubt alpha="64.4" length="59" tooSmall="False" monospace="0.0">life post.2.life, post.2.state, post.2.being, post.2.pos.N,</doubt><p>. post.3.. <b>Table 2. </b>Feature vector for <i>throbbed </i>in the sen­tence <i>"The engine throbbed into life".</i></p><p>As the example in Table 2 indicates, the combi­nation of contextual, syntactic, and semantic infor­mation types results in a large number of features. Inspection of the training data reveals that some features may be more important than others in es­tablishing word sense assignment for each choice of word lemma. We use a feature selection proce-</p><p>pre.1 .instrumentality, pre.l.object, pre.l.artifact, pre.l.device, pre.I.engine, pre.l.motor, pre.1 .whole, pre.1 .entity, pre.l.machine, pre.l.pos.N, pre.l.case.NOM,<page local="3" global="266"/></p><p>dure to reduce the full set of features to the feature subset that is most relevant to word sense assign­ment for each lemma. This practice improves the efficiency of our word sense disambiguation algo­rithm. The feature selection procedure we adopted consists of scoring each potential feature according to a particular feature selection metric, and then taking the best <i>k </i>features.</p><p>We choose Information Gain as our feature se­lection metric. Information Gain measures the de­crease in entropy when the feature is given versus when it is absent. Yang and Pederson (1997) report that Information Gain outperformed other feature selection approaches in their multi-class bench­marks, and Foreman (2003) showed that it per­formed amongst the best for his 2-class problems.</p></section><section number="3" title="Evaluation"><p>To evaluate our approach and feature set, we ran our model on the Senseval-3 English all-words task test data. Using data provided by the Sense-val website<footnote anchor="6"/>, we were able to compare our results for verbs to the top performers on verbs alone. Upali S. Kohomban and Wee Sun Lee provided us with the results file for the Simil-Prime system (Kohomban and Lee, 2005). As reported in Sanfil­ippo et al. (2006) and shown in table 3, our results for verbs rival those of top performers. We had a significant improvement (p-value&lt;0.05) over the baseline of 52.9%, a marginal improvement over the second best performer (SenseLearner) (Mihal-cea and Faruque, 2004), and we were as good as the top performer (GAMBL) (Decadt et al., 2004).<footnote anchor="7"/></p><p><b>Table 3. </b>Results for verb sense disambiguation on Senseval-3 data, adapted from Sanfilippo et al.</p><p>(2006).</p><p>Since then, we have expanded our evaluation to all parts of speech. Table 4 provides the evaluation of our system as compared to the three top per­formers on the Senseval-3 data and the baseline. The baseline of 0.631 F-score<footnote anchor="8"/> was computed us­ing the most frequent WordNet sense. The PNNL WSD system performs significantly better than the baseline (p-value&lt;0.05) and rivals the top perform­ers. The performance of the PNNL WSD system relative to the other three systems and the baseline remains unchanged when the unknown sense an­swers (denoted by a 'U') are excluded from the evaluation.</p><footnote label="6"> http://www.senseval.org/ .</footnote><footnote label="7">The 2% improvement in precision which our system showed as compared to GAMBL was not statistically significant (p=0.21).</footnote><p><b>Table 4. </b><b>Senseval-3 </b>English all-words.</p><p><b>Table 5. </b><b>Senseval-3 </b>English all-words, No "U".</p></section><section number="4" title="Experimental results on SemEval all-words subtask"><p>This was our first opportunity to test our model in a WSD competition. For this competition, we fo­cused our efforts on the fine-grained English all-words task because our system was set up to per­form fine-grained WordNet sense prediction. We are pleased that our system achieved the highest score for this subtask. Our results for the SemEval dataset as compared to baseline are reported in Ta­ble 6. The PNNL WSD system did not assign the unknown sense, 'U', to any word instances in the SemEval dataset.</p><footnote label="8">This baseline is slightly higher than that reported by others (Snyder and Palmer 2004).</footnote><table caption="Table 4. Senseval-3English all-words." 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></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>System</b></p></td><td class="cell"><p><b>Precision</b></p></td><td class="cell"><p><b>Recall</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>PNNL</p></td><td class="cell"><p>0.670</p></td><td class="cell"><p>0.670</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Simil-Prime</p></td><td class="cell"><p>0.661</p></td><td class="cell"><p>0.663</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>GAMBL</p></td><td class="cell"><p>0.652</p></td><td class="cell"><p>0.652</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SenseLearner</p></td><td class="cell"><p>0.646</p></td><td class="cell"><p>0.646</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Baseline</p></td><td class="cell"><p>0.631</p></td><td class="cell"><p>0.631</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></tr></table><table caption='Table 5. Senseval-3English all-words, No "U".' 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></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>System</b></p></td><td class="cell"><p><b>Recall</b></p></td><td class="cell"><p><b>Precision</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>PNNL</p></td><td class="cell"><p>0.669</p></td><td class="cell"><p>0.671</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>GAMBL</p></td><td class="cell"><p>0.651</p></td><td class="cell"><p>0.651</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Simil-Prime</p></td><td class="cell"><p>0.644</p></td><td class="cell"><p>0.657</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SenseLearner</p></td><td class="cell"><p>0.642</p></td><td class="cell"><p>0.651</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Baseline</p></td><td class="cell"><p>0.631</p></td><td class="cell"><p>0.631</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></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></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>System</b></p></td><td class="cell"><p><b>Precision</b></p></td><td class="cell"><p><b>Fraction of Recall</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Our system</p></td><td class="cell"><p>61%</p></td><td class="cell"><p>22%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>GAMBL</p></td><td class="cell"><p>59.0%</p></td><td class="cell"><p>21.3%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SenseLearner</p></td><td class="cell"><p>56.1%</p></td><td class="cell"><p>20.2%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Baseline</p></td><td class="cell"><p>52.9%</p></td><td class="cell"><p>19.1%</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></tr></table><page local="4" global="267"/><p><b><u>System</u>__<u>F-score</u>_</b> <b>Table 6.</b><b> </b>SemEval Results.</p><doubt alpha="33.3" length="12" tooSmall="False" monospace="0.0">PNNL__0.591_</doubt><doubt alpha="50.0" length="16" tooSmall="False" monospace="0.0">Baseline__0.514_</doubt><doubt alpha="50.0" length="14" tooSmall="False" monospace="0.0">~p-valueI&lt;0.01</doubt></section><section number="5" title="Discussion"><p>Although these results are promising, there is still much work to be done. For example, we need to investigate the contribution of each feature to the overall performance of the system in terms of pre­cision and recall. Such a feature sensitivity analysis will provide us with a better understanding of how the algorithm can be further improved and/or made more efficient by leaving out features whose con­tribution is negligible.</p><p>Another important point to make is that, while our system shows the best precision/recall results overall, we can only claim statistical relevance with reference to the baseline and results worse than baseline. The size of the SemEval data set (N=465) is too small to establish whether the dif­ference in precision/recall results with the other top systems is statistically significant.</p></section><section title="Acknowledgements"><p>We would like to thank Upali S. Kohomban and Wee Sun Lee for providing us with their Sense-val-3 English all-words task results file for Simil-Prime. Many thanks also to Patrick Paulson, Bob Baddeley, Ryan Hohimer, and Amanda White for their help in developing the word class disam­biguation system on which the work presented in this paper is based.</p></section><references><p>Berger, A., S. Della Pietra and V. Della Pietra (1996) A Maximum Entropy Approach to Natural Language Processing. <i>Computational Linguistics, </i>volume 22, number 1, pages 39-71.</p><p>Chklovski, T. and R. Mihalcea (2002) Building a sense tagged corpus with open mind word expert. In <i>Pro­ceedings of the ACL-02 workshop on Word sense dis­ambiguation: recent successes and future directions.</i></p><p>Dang, H. T. and M. Palmer (2005) The Role of Semant­ic Roles in Disambiguating Verb Senses. In <i>Proceed­ings of the 43rd Annual Meeting of the Association for Computational Linguistics, </i>Ann Arbor MI, June 26-28, 2005.</p><p>Decadt, B., V. Hoste, W. Daelemans and A. Van den Bosch (2004) GAMBL, genetic algorithm optimiza­tion of memory-based WSD. <i>SENSEVAL-3: Third In­ternational Workshop on the Evaluation of Systems for the Semantic Analysis of Text. </i>Barcelona, Spain.</p><p>Fellbaum, C., editor. (1998) WordNet: An Electronic Lexical Database. MIT Press, Cambridge, MA.</p><p>Foreman, G. (2003) An Extensive Empirical Study of Feature Selection Metrics for Text Classification.</p><p><i>Journal of Machine Learning Research, </i>3, pages 1289-1305.</p><p>Kohomban, U. and W. Lee (2005) Learning semantic classes for word sense disambiguation. In <i>Proceed­ings of the 43rd Annual meeting of the Association for Computational Linguistics, </i>Ann Arbor, MI.</p><p>Mihalcea, R., T. Chklovski, and A. Kilgarriff (2004) The SENSEVAL-3 English Lexical Sample Task, <i>SENSEVAL-3:</i><i> Third International Workshop on the Evaluation of Systems for the Semantic Analysis of Text. </i>Barcelonna, Span.</p><p>Mihalcea, R. and E. Faruque (2004) SenseLearner: Minimally supervised word sense disambiguation for all words in open text. <i>SENSEVAL-3: Third Interna­tional Workshop on the Evaluation of Systems for the Semantic Analysis of Text. </i>Barcelona, Spain.</p><p>Sanfilippo, A., S. Tratz, M. Gregory, A. Chappell, P. Whitney, C. Posse, P. Paulson, B. Baddeley, R. Hohi-mer, A. White (2006) Automating Ontological An­notation with WordNet. <i>Proceedings to the Third In­ternational WordNet Conference, </i>Jan 22-26, Jeju Is­land, Korea.</p><doubt alpha="62.5" length="48" tooSmall="False" monospace="0.0">Snyder, B. and M. Palmer. 2004. The English All-</doubt><p>Words Task. <i>SENSEVAL-3: Third International Workshop on the Evaluation of Systems for the Se­mantic Analysis of Text. </i>Barcelona, Spain.</p><p>Tapanainen, P. and Timo Järvinen (1997) A nonproject-ive dependency parser. In <i>Proceedings of the 5th Conference on Applied Natural Language Processing, </i>pages 64-71, Washington D.C. Association for Com­putational Linguistics.</p><p>Yang, Y. and J. O. Pedersen (1997) A Comparative Study on Feature Selection in Text Categorization. In <i>Proceedings of the 14th International Conference on</i> <i>Machine Learning </i>(ICML), pages 412-420, 1997.</p></references></body></article>