<?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="59"/><title>Supervised Sense Tagging using Support Vector Machines</title><author surname="Cabezas" givenname="Clara"><org  name="University of Maryland" country="USA" city="College Park"/></author><author surname="Resnik" givenname="Philip"><org  name="University of Maryland" country="USA" city="College Park"/></author><author surname="Stevens" givenname="Jessica"><org  name="University of Maryland" country="USA" city="College Park"/></author></firstpageheader><frontmatter><p>Supervised Sense Tagging using Support Vector Machines</p><p><b>Clara Cabezas, Philip Resnik, </b>and <b>Jessica Stevens</b></p><p>Dept. of Linguistics and Institute for Advanced Computer Studies University of Maryland, College Park, MD 20742 USA {clarac,resnik,stevenj c}@umiacs.umd.edu</p></frontmatter><abstract>We describe the University of Maryland's su­pervised sense tagger, which participated in the <b>Senseval</b>-2 lexical sample evaluations for En­glish, Spanish, and Swedish; we also present un­official results for Basque. We designed a highly modular combination of language-independent feature extraction and supervised learning us­ing support vector machines in order to permit rapid ramp-up, language independence, and ca­pability for future expansion. </abstract></header><body><section number="1" title="Introduction"><p>The <b>Senseval</b>-2 exercise provided an unprece­dented opportunity to explore word sense dis­ambiguation (WSD) in a common evaluation framework for a large number of languages. In past work, we have focused on unsupervised methods for English, taking advantage of the WordNet hierarchy and sometimes also selec-tional preferences between predicates and argu­ments (Resnik, 1997; Resnik, 1999). In the cur­rent exercise, however, WordNet-like sense hi­erarchies were not necessarily going to be avail­able for all languages, and the predominance of lexical selection tasks (rather than all-words tasks) suggested adopting a disambiguation ap­proach capable of exploiting manually anno­tated training data. These considerations mo­tivated a system design based on supervised learning, where senses to be predicted did not need to be treated as part of a semantic hierar­chy.</p><p>Our design was also motivated by the role of semantic selection techniques in our longer term research agenda. In the context of our group's work on cross-language information retrieval and machine translation applications (Resnik et al., 2001; Cabezas et al., 2001), lexical selection — that is, choosing the right target-language word given a source-language word in context — is a crucial task. Because the lexical selec­tion problem is extremely similar to sense selec­tion, and because this was our first foray into supervised methods, we took advantage of the opportunity to construct an architecture that will support both tasks.</p><p>In the sections that follow, we lay out our system architecture, briefly summarize our <b>Senseval</b>-2 results, and discuss our plans for future work.</p></section><section number="2" title="System Architecture"><p>UMD's system follows the classic supervised learning paradigm that, for WSD, is perhaps best exemplified by Yarowsky's (1993) work. Each word in the vocabulary is considered an independent classification problem. First, an­notated training instances for the ambiguous word are analyzed so that each instance can be represented as a collection of feature-value pairs labeled with the correct category. Then, these data are used for parameter estimation within a supervised learning framework in or­der to produce a trained classifier. Finally, the trained classifier is given previously unseen test instances and for each instance it predicts what the appropriate category label should be.</p><subsection number="2.1" title="Contextual Features"><p>We began by tokenizing all the training in­stances using a simple language-specific tok-enizer. Features were then defined in terms of the presence of tokens either within a wide con­text or at a certain position to the right or left of the word being disambiguated.</p><p>In detail, let <i>T </i>be the set of unique tokens found in the full set of training data (all train­ing instances), plus the special token <b>unknown, </b>which replaces any token in test data that was never seen during training.<page local="2" global="60"/> Define <i>fw'1([e = </i><i>T.</i><i> </i>A feature / € <i>F^ife</i><i> </i>will be considered present and have a non-zero value if / appears any­where in the wide context of the word being disambiguated. For example, if we were disam­biguating the word <i>training </i>that appears in the first sentence of this paragraph, using the entire paragraph as the wide context, then there would be non-zero values for features <b>we, began</b>, and every other word in the paragraph. That is, features correspond to surrounding words.<footnote anchor="1"/></p><p>Let <i>C </i>= {Z3,£2,£i,Äi<b>,!22</b><b>,ä3}, </b>signifying the locations "three tokens to the left", "two to­kens to the left",..., "three tokens to the right", and define <i>^Fco][oc </i>= {l:t | / € <i>C </i>and <i>t </i><b>6 </b><i>T}.</i><i> </i>A feature l:t <b>6 </b>^colloc ^e considered present and have a non-zero value if token <i>t </i>appears at position / relative to the word being disam­biguated. For example, if we were disambiguat­ing the word <i>training </i>that appears in the first sentence of this section, there would be non-zero values for the features <b>£3 </b>: tokenizing, <i>L2 </i><b>: all, </b><i>Li </i>:the, <i>L\ </i>: instances, Z2 :using, and <b>£3: </b>a.</p></subsection><subsection number="2.2" title="Feature Weights"><p>The value associated with each feature is a weight indicating how useful the feature is likely to be in disambiguation, analogous to the term weights used in representing documents as fea­ture vectors for information retrieval.</p><p>In detail, let us designate the full feature set as <i>T</i><i> </i>= ^wide u ^colloc and let <i>Nf</i><i> </i><i>=</i><i> </i>l-^l-Clearly some features are more useful than oth­ers. For example, the feature into (word <i>into </i>appearing anywhere in the context) is unlikely to help distinguish among senses, although the feature <i>R\ </i>: into (word <i>into </i>appearing one word to the right) might be useful for disambiguat­ing among the senses of some verbs. In order to assign weights to features based on their likely utility, we follow a strategy similar to what is done in information retrieval, defining inverse category frequency (ICF), by analogy with in­verse document frequency (IDF), as a function of how many distinct categories a feature ap­pears with in training data.</p><footnote label="1">For Senseval -2, we defined the surrounding context for wide contexts as being anywhere within the test in­stance, because instances comprised only a sentence or two. In a more general setting the context could be de­fined as a window of ±50 words, ±100 words, the entire document, etc.</footnote><p>Specifically, if we are disambiguating a word <i>w </i>with senses <i>S </i>= {si, <b>62, • • ? </b><i>SNW}, </i>then we de­fine <i>lCFw(f)</i><i> = ~log</i><i>(Nl/Nw)</i><i> </i>where <i>Nl </i>is the number of distinct elements of <i>S </i>that ever co-occur with feature / in the training data for word <i>w. </i>For example, if a word has five senses, and the feature <i>L\ </i>:the appears in some train­ing instance for each of the five senses, then ICFty(jLi :the) = -log(5/5) = 0, correctly in­dicating that this feature is not at all useful for disambiguating among the five senses of this word. The lower <i>N£ </i>is, the greater the value of the <i>ICFw(f)</i><i> </i>value and hence the greater weight accorded this feature.</p><p>Training and test instances are represented as iVV-ary feature vectors: given a training or test instance for a word the vector representa­tion is defined by <i>vw[f]</i><i> </i>= ICFtt,(/) if / G <i>T</i><i> </i>is present, and zero otherwise.</p></subsection><subsection number="2.3" title="Learning Framework"><p>Once training and test instances are represented as feature vectors, it becomes possible to ex­ploit any number of existing supervised learn­ing algorithms. In general, such algorithms take a set <i>{(vu</i><i> </i>ci), <i>(v2,</i><i> </i>c2),..., <i>(vN,</i><i> </i><i>cN)}</i><i> </i>of training instances, and produce a classifier that takes a feature vector <i>v </i>as input and return a distri­bution or confidence function over the possible categories.</p><p>For <b>Senseval</b>-2, we selected support vec­tor machines (SVMs) as the supervised learn­ing framework. We were motivated by the fact that SVMs have been shown to achieve high per­formance and work efficiently in environments where there are very large numbers of features, and also by the existence of a good off-the-shelf implementation, SVM-Light, available for research purposes (Joachims, 1999; Joachims, 1998).<footnote anchor="2"/></p><p>SVM learning is appropriate for binary clas­sification tasks, rather than the multi-way clas­sification needed for disambiguating among <i>n </i>senses. For each word in the lexical sample tasks, therefore, we constructed a family of SVM classifiers, one for each of the word's <i>Nw</i>senses.   All positive training examples for <b>a</b> sense <i>S{ </i>of <i>w </i>were treated as negative training examples for all the other senses <b>Sj, </b><i>j </i><b>^ i.</b><page local="3" global="61"/><b></b></p><footnote label="2">Hearst   (1998)   presents   a   collection   of brief and    illuminating    discussions    of    SVMs; see http://www.computer.org/intelligent /exl998/pdf/x4018.pdf. SVM-Light   is    available    at http://www-ai.cs.uni- dortmund.de/svmJight .</footnote><doubt alpha="100.0" length="1" tooSmall="True" monospace="0.0">f</doubt><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">i</doubt><p>In the testing phase, we convert test instances for word <i>w </i>into feature vectors, and we then we run these vectors through the SVM classifiers for {si, • • • &gt; <i>SNW}- </i>For each instance, we se­lect the sense for which the SVM classifier's re­sponse is most strongly "yes" (or, equivalently, most weakly "no").</p></subsection></section><section number="3" title="SENSEVAL-2 Results"><p>Table 1 shows the performance of UMD's su­pervised sense tagger (UMD-SST) for the lex­ical sample tasks in four languages. The fig­ures for English, Spanish, and Swedish are offi­cial <b>Senseval</b>-2 results; the figures for Basque are unofficial results kindly computed by the Basque task organizers after <b>Senseval</b>-2 be­cause our Basque responses were not submitted in time for official evaluation.</p><p>In general, we were quite pleased with the re­sults, particularly since this was our first time participating in <b>Senseval</b>. UMD-SST turned in a solid performance in comparison with the baselines and other systems, with essentially no language-specific alterations necessary other than those required for tokenization. This en­abled us to participate in system evaluation for more languages than any site except JHU. We consider this a good starting point for our fur­ther investigations, which we now briefly de­scribe.</p></section><section number="4" title="Future Work"><p>Using the current system as a starting point, we are engaged in three lines of further investi­gation: linguistically richer contextual features, corpus-dependent expansion of feature vectors, and lexical selection via supervised learning.</p><p>In our preliminary tests using training and development data, we experimented first with using <i>Pyjife </i>as the feature set, and obtained sig­nificant improvements when we added <i>^co]ioc</i>in order to capture collocations and other local contextual features. In our follow-up efforts we plan to use broad-coverage parsing to create a set of features augmented further by grammat­ical relations, thus capturing collocations medi­ated by syntactic structure. For example, al­though our current feature vectors could not represent the presence of the word <i>tagger </i>as a nearby collocate of the word <i>describe </i>in the ab­stract of this paper, syntactically richer repre­sentations of this context for the verb <i>describe </i>would include the feature ob j ect=&gt; t agger '. Use of syntactic collocates will require broad-coverage parsing in all the languages of inter­est in order to identify grammatical relations; for this we will take advantage of our other work at Maryland on bootstrapping stochastic parsers for new languages using parallel corpora (Cabezas et al., 2001).</p><p>In our preliminary efforts we were not sur­prised to find that sparseness of data was a problem. Although we expect that some improvements may be obtained by collapsing across word variants — e.g. via morphologi­cal equivalence classes or stemming — we also plan to focus our efforts on semantic expansion, using document expansion techniques we have developed in our research on cross-language in­formation retrieval (Levow et al., 2001). We have implemented a variant of the architecture in which training contexts are used as queries to a comparable corpus in order to retrieve re­lated documents. The features from these docu­ments are then added to the context representa­tions, providing semantically enhanced feature vectors. Evaluation of this approach using <b>Sen­seval </b>data is in progress.</p><p>Our third avenue of investigation focuses on the use of our supervised WSD infrastructure to address problems of lexical selection in ma­chine translation. Empirically, there is a close relationship between sense distinctions and pat­terns of lexicalization across languages (Resnik and Yarowsky, 1999). And operationally, there is no real difference between labeling a word with a sense tag from a monolingual dictionary and labeling that word with a translation from a bilingual dictionary. Using WSD techniques for lexical selection primarily requires solving two problems.<page local="4" global="62"/> The first problem is acquisition of annotated training data, and in this case large corpora of translation-labeled words in context can be created by obtaining parallel corpora, performing word-level alignment, and labeling each word with its correspondent in the other language; this problem is already solved as part of our infrastructure for research on statistical machine translation (Cabezas et al., 2001). The second problem is one of scalability: the ap­proach we have described requires a separate classifer for every sense (or, now, every possi­ble word-level translation) of every source lan­guage word. This remains an open issue, but we are optimistic about rapid developments in this area since scaling up to large vocabularies is a problem shared by everybody who wishes to use supervised WSD techniques in a broad-coverage setting.</p><table caption="Table 1: UMD-SST lexical sample results" 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>Language</p></td><td class="cell"><p>Precision (%)</p></td><td class="cell"><p>Recall (%)</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>English (coarse)</p></td><td class="cell"><p>64.3</p></td><td class="cell"><p>64.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>English (fine)</p></td><td class="cell"><p>56.8</p></td><td class="cell"><p>56.8</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Spanish (fine)</p></td><td class="cell"><p>62.7</p></td><td class="cell"><p>62.7</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Swedish (mixed)</p></td><td class="cell"><p>65.6</p></td><td class="cell"><p>65.6</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Swedish (fine)</p></td><td class="cell"><p>61.1</p></td><td class="cell"><p>61.1</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Basque (fine)</p></td><td class="cell"><p>70.3</p></td><td class="cell"><p>70.3</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></section><section number="5" title="Conclusions"><p>University of Maryland's sense tagger repre­sents a classic instance of the supervised learn­ing approach. At the same time, we have made architectural choices that promote language in­dependence, modularity, extensibility, and scal­ability, and in a relatively short time period we succeeded in putting together an implementa­tion that performs quite credibly among an im­pressive collection of competitors. We are en­couraged by the results and we look forward to participating in further <b>Senseval </b>exercises.</p></section><section title="Acknowledgements"><p>This work was supported in part by De­partment of Defense contract MDA90496C1250 and DARPA/ITO Cooperative Agreement N660010028910. We're very grateful to all the <b>Senseval</b>-2 organizers and task organizers for their hard work, to Thorsten Joachims for mak­ing SVM-Light available, and to David Mar­tinez for computing our results for Basque.</p></section><references><p>Clara Cabezas, Bonnie Dorr, and Philip Resnik. 2001. Spanish language processing at Univer­sity of Maryland: Building infrastructure for multilingual applications. In <i>Proceedings of the Second International Workshop on Span­ish Language Processing and Language Tech­nologies (SLPLT</i><i>-2), </i>Jaen, Spain, September.</p><p>Marti A. Hearst. 1998. Trends and controver­sies: Support vector machines. <i>IEEE Intelli­gent Systems, </i>13(4):18-28.</p><p>Thorsten Joachims. 1998. Text categorization with support vector machines: Learning with many relevant features. In <i>Proceedings of the European Conference on Machine Learning. </i>Springer.</p><p>Thorsten Joachims. 1999. Making large-scale SVM learning practical. In B. Schölkopf, C. Burges, and A. Smola, editors, <i>Advances in Kernel Methods - Support Vector Learn­ing. </i>MIT Press.</p><p>Gina-Anne Levow, Douglas Oard, and Philip Resnik. 2001. Rapidly retargetable interac­tive translingual retrieval. In <i>Human Lan­guage Technology Conference (HLT</i><i>-2001), </i>San Diego, CA, March.</p><p>Philip Resnik and David Yarowsky. 1999. Distinguishing systems and distinguishing senses: New evaluation methods for word sense disambiguation. <i>Natural Language En­gineering, </i>5(2):113-133.</p><p>Philip Resnik, Douglas Oard, and Gina Levow. 2001. Improved cross-language retrieval us­ing backoff translation. In <i>Human Lan­guage Technology Conference (HLT</i><i>-2001), </i>San Diego, March.</p><p>Philip Resnik. 1997. Selectional preference and sense disambiguation. In <i>AN</i><i> LP Work­shop on Tagging Text with Lexical Semantics, </i>Washington, D.C., April.</p><p>Philip Resnik. 1999. Semantic similarity in a taxonomy: An information-based measure and its application to problems of ambiguity in natural language. <i>Journal of Artificial In­telligence Research (JAIR), </i>11:95-130.</p><p>David Yarowsky. 1993. One sense per colloca­tion. ARPA Workshop on Human Language Technology, March. Princeton.</p></references></body></article>