<?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="127"/><title>Pattern Learning and Active Feature Selection for Word Sense Disambiguation</title><author surname="Moldovan" givenname="Dan I."><org  name="Southern Methodist University" country="USA" city="Dallas"/></author><author surname="Mihalcea" givenname="Rada F."><org  name="University of Texas at Dallas" country="USA" city="Richardson"/></author></firstpageheader><frontmatter><p>Pattern Learning and Active Feature Selection for Word Sense Disambiguation</p><p><b>Rada F. MIHALCEA</b></p><p>Southern Methodist University Dallas, Texas, 75275-0122 r ada@seas. smu. edu</p><p><b>Dan I. MOLDOVAN</b></p><p>University of Texas at Dallas Richardson, Texas, 75083-0688 moldovan@utdallas. edu</p></frontmatter><abstract>We present here the main ideas of the algo­rithm employed in the <i>SMUls </i>and <i>SMU aw </i>sys­tems. These systems have participated in the <b>Senseval</b>-2 competition attaining the best per­formance for both English all words and En­glish lexical sample tasks<footnote anchor="1"/>. The algorithm has two main components (1) pattern learning from available sense tagged corpora (SemCor) and dic­tionary definitions (WordNet), and (2) instance based learning with active feature selection, when training data is available for a particular word. </abstract></header><body><section number="1" title="Introduction"><p>It is well known that WSD constitutes one of the hardest problems in Natural Language Pro­cessing, yet is a necessary step in a large range of applications including machine translation, knowledge acquisition, coreference, information retrieval and others. This motivates a continu­ously increasing number of researchers to develop WSD systems and devote time to finding solu­tions for this challenging problem.</p><p>The system presented here was initially de­signed for the semantic disambiguation of <i>all words </i>in open text. The <b>Senseval </b>competitions created a good environment for supervised sys­tems and this encouraged us to improve our sys­tem with the capability of incorporating larger training data sets when provided.</p><p>There are two important modules in this sys­tem. The first one uses pattern learning relying on large sense tagged corpora to tag all words in open text. The second module is triggered only for the words with large training data, as was the case with the words from the lexical sample tasks. It uses an instance based learning algorithm with active feature selection.</p><footnote label="1">This is in conformity with the original ranking, fol­lowing the evaluation of systems answers submitted before deadline.</footnote><p>To our knowledge, both pattern learning and active feature selection are novel approaches in the WSD field, and they led to very good results during the <b>Senseval</b>-2 evaluation exercise.</p></section><section number="2" title="System description"><p>The WSD algorithm used in this system has the capability of tagging words when no specific sense tagged corpora is available, automatically scaling up to larger training data<footnote anchor="2"/> when provided.</p><p>Due to space constraints, we will not be able to give a detailed description of the system. How­ever we try to gain space and replace one thou­sand words with a picture: Figure 1 shows an overview of the system architecture. It illustrates the two main components, namely pattern learn­ing from available sense tagged corpora and dic­tionary definitions and instance based learning with active feature selection. The two modules are preceded by a preprocessing phase which in­cludes compound concept identification, and fol­lowed by a default phase that assigns the most frequent sense as a last resort, when no other previous methods could be applied. The shaded areas in Figure 1 are specific for the case when larger training data sets are available.</p><p>During the preprocessing stage, SGML tags are eliminated, the text is tokenized, part of speech tags are assigned using Brill tagger (Brill, 1995), and Named Entities (NE) are identified with an <i>in-house </i>implementation of an NE recognizer. To identify collocations, we determine sequences of words that form compound concepts defined in WordNet.</p><p>In the second step, patterns<footnote anchor="3"/> are learned from WordNet, SemCor and GenCor, which is a large<page local="2" global="128"/></p><footnote label="2">I.e. in addition to the publicly available sense tagged corpora</footnote><footnote label="3">We alternatively call them rules as they basically spec­ify the sense triggered by a given local context, using rules like "if the word before is X then sense is Y"</footnote><p><b>FREE UNTAGGED TEXT</b></p><p><i>PREPROCESSING</i></p><p><b>eliminate SGMLtags tokenization part of speech tagging Named Entity recognitior</b></p><p><i>CONCEPT IDENTIFIER</i></p><p><b>- identify compound concepts</b> <b>- identify proper nouns with a semantic role (NE</b> <b>learn patterns from</b> <b>SemCor and WordNet GenCor</b></p><p><b>additional sense tagged corpora</b> <b>if additional training data available, validate patterns keep only error free</b></p><p><b>instance based learning </b><b><i>with </i></b><b>active feature selection</b> <b>- assign the most frequent sense</b> <b>(e.g. first sense in WordNet</b></p><figure caption="Figure 1: System architecture"></figure><p>sense tagged corpus automatically built via a set of heuristics. If additional training data is avail­able, patterns are filtered through a validation process. Practically, the patterns are applied on the sense tagged data and we keep only those with no counter-examples found in the training sets.</p><p>The third step consists of a learning mecha­nism with active feature selection. This step is initiated only for those words with a sufficiently large number of examples, as was the case with the words in the <b>Senseval </b>lexical sample tasks.</p></section><section number="3" title="Pattern learning"><p>This module is intended for solving the semantic ambiguity of <i>all </i>words in open text. To this end, we build disambiguation patterns using SemCor, WordNet and GenCor. Several processing steps were required to transform the first two resources into a useful corpus for our task. Moreover, these lexical resources coupled with a set of heuristics were used as seeds for generating a new sense tagged corpus called GenCor. <u>SemCor</u> The <b>senseval</b>-2 English tasks have de­cided to use the WordNet 1.7 sense inventory, and therefore we had to deal with the task of map­ping SemCor senses, which were assigned using an earlier version of WordNet, to the correspond­ing senses in WordNet 1.7. When a word sense from WordNet 1.6 is missing we assign a default sense of 0.<footnote anchor="4"/> <u>WordNet</u> The main idea in generating a sense tagged corpus out of WordNet is very simple. It is based on the underlying assumption that each ex­ample pertains to a word belonging to the current synset, thereby allowing us to assign the correct sense to at least one word in each example. For instance, the example given for <i>mother</i><b><i>#4 </i></b>is <i>"ne­cessity is the mother of invention", </i>and the word <i>mother </i>can be tagged with its appropriate sense. <u>GenCor</u> is a generated sense tagged corpus, con­taining at the moment about 160,000 tagged words, which uses as seeds the sense tagged ex­amples from SemCor and WordNet, as well as some of the principles for generating sense tagged corpora presented in (Mihalcea and Moldovan, 1999). Due to space limitations we cannot present here the methodology for creating this corpus. A thorough description is provided in (Mihalcea, 2001).</p><footnote label="4">SemCor 1.7a is available for download at http://wivw.seas.smu.edu/~rada/semcor</footnote><page local="3" global="129"/><p>Once we have created this large corpus with examples of word meanings, we can start to learn patterns. A pattern basically consists of the local context for each semantically tagged word found in the corpus. The local context is formed by a window pf N words to the left and M words to the right of each word considered. Additionally, a set of constraints is applied to filter out meaningless patterns.</p><p>Patterns are formed following the rules for reg­ular expressions. Each word in the corpus is rep­resented by its base form, its part of speech, its sense, if there is any provided, and its hypernym, again if the sense is known. Any of these word components can be unspecified, and therefore de­noted with the symbol *. A count is also asso­ciated with every pattern, indicating the number of times it occurred in the corpus.</p><p>When trying to disambiguate a word, first we search for all available patterns that match the current context. In doing so, we use the current word as a pivot to perform matching. If there are several patterns available, then the decision of which pattern to apply is based on the pattern <i>strength. </i>The strength of a pattern is evaluated in terms of (1) number of specified components, (2) number of occurrences and (3) pattern length.</p><p><b>&lt;the/DT modal/JJ/1 age/NN at/IN&gt; </b>is consid­ered to be stronger than <b>&lt;modal/NN/l age/NN&gt;. </b>Also, <b>&lt;clear/JJ/4 water/NN/l&gt; </b>is stronger than <b>&lt;clear/JJ water/NN/l&gt;. </b>Moreover, the inclusion of the hypernym among the word components gives us the means for generalization. For instance, <b>&lt;*/NN/*/room/l door/NN/l&gt; </b>matches "kitchen door" as well as "bedroom door".</p><p>Another important step performed during the all words disambiguation task is sense propaga­tion. The patterns do not guarantee a complete coverage of all words in input text, and therefore additional methods are required. We use a cache­like procedure which assigns to each ambiguous word the sense of its closest occurrence, if any can be found. The words still ambiguous at this point are assigned by default the first sense in WordNet.</p><p>Words with a significant number of seman­tic tagged examples constitute a special case in our system. There is a second module designed to handle the semantic disambiguation of these words. This module, described in the follow­ing section, exploits the benefits of having larger training data available for a particular word.</p></section><section number="4" title="Learning with active feature selection"><p>Learning mechanisms for disambiguating word senses have a long tradition in the WSD field. For our system, we have decided for an instance based algorithm with information gain feature weight­ing. The reasons for this decision are three fold: first, it has been advocated that forgetting ex­ceptions is harmful for language learning applica­tions (Daelemans et al, 1999), and instance based algorithms are known for their property of taking into consideration every single training example when making a classification decision; secondly, instance based learning algorithms have been suc­cessfully used in WSD applications (Veenstra et al, 2000); finally, this type of algorithms are ef­ficient in terms of training and testing time. We have initially used the MLC++ implementation, and later on switched to Timbl (Daelemans et al., 2001).</p><p>Even more important than the choice of learn­ing methodology is the selection of features em­ployed during the learning process. There are several features recognized as good indicators of word sense, including the word itself (CW) and its part of speech (CP), surrounding words and their parts of speech (CF), collocations (COL), syntactic roles, keywords in contexts (SK). More recently, other possible features have been inves­tigated: bigrams in context (B), named entities (NE), the semantic relation with the other words in context, etc.</p><p>Our intuition was that different sets of features have different effects depending on the ambiguous word considered. Feature weighting was clearly proven to be an advantageous approach for a large range of applications, including WSD. Still, weights are computed independently for each fea­ture and therefore this strategy does not always guarantee to provide the best results.</p><p>For our system, we actively select features us­ing a forward search algorithm. In this way, we practically generate <i>meta word experts. </i>Each word will have a different set of features that will eventually lead to the best disambiguation accu­racy.</p><p>Using this approach, we combine the advan­tages of instance based learning mechanisms that have the nice property of <i>anot forgetting ex­ceptions", </i>with an optimized feature selection scheme. One could argue that decision trees have the capability of selecting relevant features, but it has been shown (Almuallim and Dietterich, 1991) that irrelevant features significantly affect the performance of decision trees as well.<page local="4" global="130"/></p><p>The algorithm for active feature selection is sketched in Figure 2. It is worth mentioning that in step 2, the training and testing corpora are ex­tracted for each ambiguous word. This means that examples pertaining to the word <i>"dress down" </i>are separated from the examples for the single word <i>"dress".</i></p><p><b><i>1. Generate pool of features PF = {Fi}. Initialize the set of selected features with the empty set SF={0}.</i></b></p><p><b><i>2. Extract training and testing corpora for the given target ambiguous word.</i></b></p></section><section number="3." title="For each feature Fi in the pool PF:"><p><b><i>3.1. Run a 10-fold cross validation on the training set; each example in the training set contains the features in SF </i>and <i>the feature F{.</i></b></p><p><b><i>3.2. Determine the feature Fi leading to the best accuracy.</i></b></p><p><b><i>3.3. Remove Fi from PF and add it to SF.</i></b></p><p><b><i>4. Repeat step 3 until no improvements are ob­tained.</i></b></p><figure caption="Figure 2: Algorithm for active feature selection"></figure><p>The pool PF contains a large number of fea­tures, including those previously mentioned CW, CP, CF, COL, SK, B, NE, as well as other fea­tures like the noun before and after (NB, NA), head of the noun phrase, surrounding verbs, and others.</p></section><section number="5" title="Results in Senseval -2"><p>The overall performance of the system in the En­glish all words task was 69% for fine-grained scor­ing, respectively 69.8% for coarse-grained scoring <i>(SMUaw). </i>In the English lexical sample task, we obtained 63.8% for fine-grained scoring, respec­tively 71.2% for coarse-grained scoring <i>(SMUls). </i>These results ranked our system before deadline as the best performing for both tasks. <b>Discussion</b></p><p>There were several interesting cases encoun­tered in the <b>Senseval</b>-2 data, justifying our ap­proach of using <i>active </i>feature selection. The in­fluence of a feature greatly depends on the tar­get word: a feature can increase the precision for a word, while making things worse for another word. For example, a word such as <i>free </i>does not benefit from the surrounding keywords <b>(SK) </b>feature, whereas <i>colourless </i>gains almost 7% in pre­cision when this feature is used. <b><i>free.a[CW </i>CP CF SK] 57.85% <i>free.a[CW </i>CP CF ] -&gt; 63.57%</b></p><p><b><i>colourless.</i>o[CW CP CF ] -&gt; 78.57% <i>colourless.a[CW </i>CP CF SK] -&gt; 85.71% </b>Another interesting example is constituted by the noun <i>chair, </i>which was disambiguated with high precision by simply using the current word (CW) feature. This is explained by the fact that the most frequent senses are <i>Chair </i>meaning <i>person </i>and <i>chair </i>meaning <i>furniture, </i>and there­fore the distinction between lower and upper case spellings makes the distinction among the differ­ent meanings of this word.</p><p>We have also tested the system on the <b>Senseval</b>-1 data, and performed the disam­biguation task in respect with Hector definitions, as required by the first disambiguation exercise. The overall result achieved on this data was higher than the one reported by the best per­forming system. Besides proving the validity of our approach, this fact also proved that our sys­tem is not tight in any ways to the sense inventory or data format employed.</p></section><section number="6" title="Conclusion"><p>Pattern learning and active feature selection are new approaches in the WSD field. They have been implemented in a system that participated in the <b>senseval</b>-2 competition, with an excel­lent performance in both <i>English all words </i>and <i>English lexical sample </i>tasks.</p></section><references><p><b>H. Almuallim and T.G. Dietterich. 1991. Learning with many irrelevant features. In <i>Proceedings of AAAI-91, </i>volume 2, pages 547-552, Anaheim, California.</b></p><p><b>e. </b><b>Brill. 1995. Transformation-based error driven learn­ing and natural language processing: A case study in part-of-speech tagging. <i>Computational Linguistics, </i>21(4):543-566, December.</b></p><p><b>W. Daelemans, A. van den Bosch, and J. Zavrel. 1999. Forgetting exceptions is harmful in language learning. <i>Machine Learning, </i>34(1-3): 11-34.</b></p><p><b>W. Daelemans, J. Zavrel, K. van der Sloot, and A. van den Bosch. 2001. Timbl: Tilburg memory based learner, version 4.0, reference guide. Technical report, Univer­sity of Antwerp.</b></p><p><b>R. Mihalcea and D.I. Moldovan. 1999. An automatic method for generating sense tagged corpora. In <i>Pro­ceedings of AAAI-99, </i>Orlando, </b><b>fl, </b><b>July.</b></p><p><b>R. Mihalcea. 2001. GenCor: a large semantically tagged corpus, (in preparation).</b></p><p><b>J. Yeenstra, A. van den Bosch, S. Buchholz, W. Daele­mans, and J. Zavrel. 2000. Memory-based word sense disambiguation. <i>Computers and the Humanities, </i>34:171-177.</b></p></references></body></article>