<?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="79"/><title>Semantic Tagging Using WordNet Examples</title><author surname="Haynes" givenname="Sherwood"><org  name="Illinois Institute of Technology" country="USA" city="Chicago"/></author></firstpageheader><frontmatter><p><b>Semantic Tagging Using WordNet Examples</b></p><p><b>Sherwood Haynes</b></p><p>Illinois Institute of Technology Department of Computer Science Chicago, Illinois, 60616 USA skhii@mindspring.com</p></frontmatter><abstract>This paper describes IIT1, IIT2, and IIT3, three versions of a semantic tagging system basing its sense discriminations on WordNet examples. The system uses WordNet relations aggressively, both in identifying examples of words with similar lexical constraints and matching those examples to the context. </abstract></header><body><section number="1" title="Introduction"><p>The ability of natural language understanding systems to determine the meaning of words in context has long been suggested as a necessary precursor to a deep understanding of the context (Ide and Véronis, 1998; Wilks, 1988). Competitions such as <b>SENSEVAL </b>(Kilgarriff anfl Palmer, 2000) and <b>SENSEVAL-2 (SENSEVAL-2, </b>2001) model the determination of word meaning as a choice of one or more items from a fixed sense inventory, comparing a gold standard based on human judgment to the performance of computational word sense disambiguation systems.</p><p>Statistically based systems that train on tagged data have regularly performed best on these tasks (Kilgarriff and Rosenzweig, 2000). The difficulty with these supervised systems is their insatiable need for reliable annotated data, frequently called the "data acquisition bottleneck."</p><p>The systems described here avoid the data acquisition bottleneck by using only a sense repository, or more specifically the examples and relationships contained in the sense repository.</p><p>WordNet version 1.7 (Miller 1990; Fellbaum 1998; WordNet, 2001) was chosen as the sense repository for the English Lexical Sample task (where systems disambiguate a single word or collocation in context) and the English All Word task (where systems disambiguate all content words) of the <b>SENSEVAL</b>-2 competition. WordNet defines a word sense (or synset) as a collection of words that can express the sense, a definition of the sense (called a gloss), zero or more examples of the use of the word sense, and a set of tuples that define relations between synsets or synset words.</p></section><section number="2" title="General Approach"><p>This paper describes three systems that were entered in <b>SENSEVAL</b>-2 competition, IIT1, IIT2, and IIT3. IIT1 and ÏÏT2 were entered in both the English All Word task and the English Lexical Sample task, IIT3 was entered in the English All Word task only. All three systems use the same unsupervised approach to determine the sense of a target word:</p><p>1. for each syntactically plausible sense, find the set of WordNet examples that appear in that synset or a related synset.</p><p>2. for each example, compare the example to the context, scoring the quality of the match.</p><p>3. choose the sense whose synset is responsible for the inclusion of the highest scoring example.</p><p>Hereafter, <b>target words </b>identify the words to be disambiguated (so identified by the <b>SENSEVAL</b>-2 task). The <b>context </b>identifies the text surrounding and including a target word.</p><subsection number="2.1" title="Collecting Examples of a Sense"><p>The systems first collect a set of example sentences and phrases from WordNet for each synset matching a target word (or its canonical or collocational form). The set includes examples from the synset itself as well as those of related synsets. Table 1 lists the relations available in WordNet 1.7. The application of direct relations includes only the examples of the related synset (or synsets of related words). The transitive  closure  of relations additionally includes examples from repeated application of the relation.<page local="2" global="80"/> That is, for the hypernym relation, examples from all ancestor synsets are included.</p><p>Table 2 lists the examples identified for the synset for <i>faithful - steadfast in affection or allegiance. </i>WordNet 1.7 displays the synset as:</p><p>faithful (vs. unfaithful) =&gt; firm, loyal, truehearted, fast(postnominal) =&gt; true</p><p>Also See-&gt; constant#3; true#l; txustworthy#l, trusty#l</p><p>This <i>faithful </i>synset contributes 3 examples, the <i>see also </i>relation contributes examples for <i>constant, true, </i>and <i>trustworthy, </i>the <i>similarity </i>relation contributes the examples from the <i>firm </i>synset and the <i>antonym </i>relation contributes the <i>unfaithful </i>example.</p></subsection><subsection number="2.2" title="Comparing Examples to the Context"><p>Each example is compared to the context. Consider the first example in Table 2, <i>a man constant in adherence to his ideals. </i>Since each example contains a word being defined, the systems consider that this word matches the target word, so <i>constant </i>is assumed to match <i>faithful. </i>Call this word the <b>example anchor.</b></p><p>The remaining words of the example are compared to the words surrounding the target word. The comparison begins with the word to <b>Examples Relate to Synset <i>faithful - steadfast in affection or allegiance</i></b> the left of the example anchor followed by the word immediately to the right of the anchor, the second word to the left of the anchor, the second word to the right of the anchor, and so on. So the order of comparison of the example words is <i>man, in, a, adherence, to, his, ideals.</i></p><doubt alpha="71.4" length="7" tooSmall="False" monospace="0.0">Table 2</doubt><p>Each example word is compared to the unmatched context words in a similar sequence. So, for example, the example word <i>man </i>would first be compared to the word immediately to the left of the context word followed by the word to its left, and so on, until a match is found.</p><p>Word matches also use the WordNet relations as described in Table 1. Under parent relations, two words match if they have a common ancestor. Other transitive closure relations generate a match if either word appears in the other's transitive closure. The words also match if there is a direct relation between the words.</p></subsection></section><section number="23" title="Scoring the Match"><p>Once the words of an example have been matched to the context, the result is scored. The score for all systems is computed as:</p><table caption="Table 1 Use of WordNet Relations" 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><b>WordNet</b></p></td><td class="cell"><p><b>Relation</b></p></td><td class="cell"><p><b>Relation</b></p></td><td class="cell"><p><b>Application of</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Relation</b></p></td><td class="cell"><p><b>Type</b></p></td><td class="cell"><p><b>Operands</b></p></td><td class="cell"><p><b>Relation</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Antonym</p></td><td class="cell"><p></p></td><td class="cell"><p>Word</p></td><td class="cell"><p>Direct</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Hypernym</p></td><td class="cell"><p>Parent</p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Transitive Closure</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Hyponym</p></td><td class="cell"><p>Child</p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Direct</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Entailment</p></td><td class="cell"><p></p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Transitive Closure</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Similarity</p></td><td class="cell"><p>Set</p></td><td class="cell"><p>Word</p></td><td class="cell"><p>Transitive Closure</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Member</p></td><td class="cell"><p>Child</p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Direct</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Stuff</p></td><td class="cell"><p>Child</p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Direct</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Part</p></td><td class="cell"><p>Child</p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Direct</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Has</p></td><td class="cell"><p>Parent</p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Transitive Closure</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Member</p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Has Stuff</p></td><td class="cell"><p>Parent</p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Transitive Closure</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Has Part</p></td><td class="cell"><p>Parent</p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Transitive Closure</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Holonym</p></td><td class="cell"><p>Parent</p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Transitive Closure</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Meronym</p></td><td class="cell"><p>Child</p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Direct</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>PPL</p></td><td class="cell"><p></p></td><td class="cell"><p>Word</p></td><td class="cell"><p>Transitive Closure</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>See Also</p></td><td class="cell"><p></p></td><td class="cell"><p>Word</p></td><td class="cell"><p>Direct</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Pertains</p></td><td class="cell"><p></p></td><td class="cell"><p>Word</p></td><td class="cell"><p>Transitive Closure</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Attribute</p></td><td class="cell"><p></p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Transitive Closure</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Verb</p></td><td class="cell"><p>Set</p></td><td class="cell"><p>Synset</p></td><td class="cell"><p>Not Used</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Group</p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"><p></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><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></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Synset Words</b></p></td><td class="cell"><p><b>Example</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>constant</p></td><td class="cell"><p>a man constant in adherence to his ideals</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>a constant lover</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>constant as the northern star</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>faithful</p></td><td class="cell"><p>years of faithful service</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>faithful employees</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>we do not doubt that England has a faithful patriot in the Lord Chancellor</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>firm, loyal, truehearted, fast</p></td><td class="cell"><p>"the true-hearted soldier...of Tippecanoe" -Campaign song for William Henry Harrison;</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>a firm ally</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>loyal supporters</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>fast friends</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>true</p></td><td class="cell"><p>true believers bonded together against all who disagreed with them</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>the story is true</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>"it is undesirable to believe a proposition when there is no ground whatever for supposing it true" - B. Russell;</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>the true meaning of the statement</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>trustworthy</p></td><td class="cell"><p>a trustworthy report</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>an experienced and trustworthy traveling companion</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>unfaithful</p></td><td class="cell"><p>an unfaithful lover</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><page local="3" global="81"/><doubt alpha="71.4" length="7" tooSmall="False" monospace="0.0">Table 3</doubt><p><b>Scoring Penalty Characteristics</b></p><doubt alpha="71.4" length="7" tooSmall="False" monospace="0.0">score =</doubt><p>The scoring function <i>s </i>generates a non-negative value for each example word <i>wh </i>penalty characteristic <b><i>Cj </i></b>(Table 3), distance <i>dt </i>of <i>wt </i>from the example anchor. In IIT1, <i>dt </i>is not considered, so a penalty calculation is independent of the word position in the example. In IIT2, <i>di </i>reduces penalties for <i>wt </i>further away from the example anchor.</p><p>If an example anchor alignment with the context word is the only open-class match for an example, the example receives a zero score.</p><p>Haynes (2001) describes these calculations in more detail.</p><p>A sense of a target word receives the maximum score of the examples related to that sense. The systems suggest the sense(s) with the highest score, with multiple senses in the response in the event of ties. (If a tie occurs because the same example was included for two senses, the other senses are eliminated, the common example is dropped from the example set of the remaining senses, and the sense scores are recomputed.) If no sense receives a score greater than zero, the first sense is chosen.</p><p>IIT1 and IIT2 match a context word independent of other sense assignment decisions. The IIT3 system (English All Word</p><doubt alpha="71.4" length="7" tooSmall="False" monospace="0.0">Table 5</doubt><p><b>SENSEVAL-2 </b><b>English All Word Results</b></p><p>task only) uses the IIT1 scoring algorithm for target words, but limits the senses of preceding context words to the sense tags already assigned.</p></section><section number="3" title="Results"><p>Table 4 and Table 5 show the results for IIT1, IIT2 and IIT3 as well as that of the Lesk Baseline (English Lexical Sample task) and the best non-corpus based system, the CRL DMAP system. The <b>SENSEVAL</b>-2 (2001) website presents the complete competition results as well as the CRL DIMAP and baseline system descriptions.</p><p>The IIT1 and IIT2 performed better than the comparable baseline system but not as well as the best system in its class. The IIT3 approach improves on the performance of IIT1 by using its prior annotations in tagging subsequent words.</p><p>Due to time constraints, the English All Word submissions only processed the first 12% of the corpus. The recall values marked * consider only those instances attempted.</p></section><section number="4" title="Discussion"><p>Many of the examples in WordNet were the result of lexicographers expanding synset information to clarify sense distinctions for the annotators of the Semcor corpus (Fellbaum, 1998). This makes a compelling argument for the use of these WordNet examples to assist in a computational disambiguating process.</p><p>The examples for rare word senses could be used to provide corpus-based statistical methods with additional evidence. Such an approach should help address the knowledge acquisition bottleneck.</p><table class="main" frame="box" rules="all" border="1" regular="True"><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><b>Characteristic</b></p></td><td class="cell"><p><b>Description</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Distance</p></td><td class="cell"><p>Magnitude of the difference in the word position of the matching example and context words relative to the position of the example and context anchors</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Direction Change</p></td><td class="cell"><p><b>1 </b>if the example words adjacent to a word match context words both occurring before or after its matching context word, 0 otherwise.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Lexical Proximity</p></td><td class="cell"><p>0 for exact matches; <b>1 </b>for matches based on non-parent relation matches; sum of the distances to the closest common ancestor for matches under parent relations</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Maximum and Minimum Lexical Generalization</p></td><td class="cell"><p>0,0 for exact matches; <b>1</b>,0 for matches based on non-parent relation matches; maximum and minimum distance to the closest common ancestor for matches under parent relations</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Alignment Skew</p></td><td class="cell"><p>Ratio of the matching phrase length to the example length.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Match Failure</p></td><td class="cell"><p><b>1 </b>for example words with no matching context word, 0 otherwise</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></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>System</b></p></td><td class="cell"><p><b>Course Grained Precision/Recall</b></p></td><td class="cell"><p><b>Fine Grained Precision/Recall</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>IIT1 Lexical Sample</p></td><td class="cell"><p>34.1%/33.6%</p></td><td class="cell"><p>24.3%/23.9%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>IIT2 Lexical Sample</p></td><td class="cell"><p>34.6%/34.1%</p></td><td class="cell"><p>24.7%/24.4%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Baseline Lesk</p></td><td class="cell"><p>33.1%/ 33.1%</p></td><td class="cell"><p>22.6%/22.6%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Best Non-Corpus</p></td><td class="cell"><p>36.7%/36.7%</p></td><td class="cell"><p>29.3%/ 29.3%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Table 4</b></p><p><b>SENSEVAL-2 </b><b>English Lexical Sample Results</b></p></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>Course Grained Precision/Recall</b></p></td><td class="cell"><p><b>Fine Grained Precision/Recall</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>IIT1 All Word</p></td><td class="cell"><p>29.4%/29.1%*</p></td><td class="cell"><p>28.7%/28.3%*</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>IIT2 All Word</p></td><td class="cell"><p>33.5% / 33.2% *</p></td><td class="cell"><p>32.8%/32.5%*</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>IIT3 All Word</p></td><td class="cell"><p>30.1%/29.7%*</p></td><td class="cell"><p>29.4%/29.1%*</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Best Non-Corpus</p></td><td class="cell"><p>46.0%/46.0%</p></td><td class="cell"><p>45.1%/45.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="82"/><p>The implementation and results presented here do not seem to justify this optimism. There are several reasons, though, why the method should not be dismissed without further investigation:</p><p>• The example sets were empty for a number of the candidate word senses. When this occurred, the system constructed a pseudo example by appending the WordNet gloss to the target word. This was sufficient for most collocation senses and some non-collocation senses such as <i>call </i>as in <i>calling a square dance </i>(where the gloss includes <i>square </i>and <i>dance, </i>one of which is highly likely to occur in any use of the sense). Others such as <i>day </i>as in <i>sidereal day </i>or <i>turn off </i>(gloss <i>cause to feel intense dislike or distaste) </i>competed at a disadvantage.</p><p>• The pattern matching and scoring methods were never tuned against any corpus data. This allowed the algorithm to have few competitors in the class of untrained systems, but scoring methods relied on intuition-founded heuristics. Such tuning should improve precision and recall.</p><p>• The approach was developed to be used in tandem with statistical approaches. Further research is required before its additive value can be fully assessed. IIT3 would have done better to be based on IIT2 and an approach maximizing the scores for a sentence should do even better.</p><p>• The best-matching example was chosen regardless of how bad a match was involved. The system also defaulted to the first sense encountered when all examples had a zero score. Using threshold score values may well provide substantial precision improvements (at the expense of recall).</p><p>• Semantic annotation of the WordNet examples should improve the results.</p><p>In addition, the following programming errors affected the precision and recall results:</p><p>• The generated answers for many adjective senses (those with similarity relations) were incorrectly formatted and were therefore always scored as incorrect. For example, in the IIT1 entry for the English Lexical Sample, 7.1% of all annotations were incorrectly formatted. Scoring only the answers that were correctly formatted raises the course-grained precision for IIT1</p><p>to 36.7% and fine-grained precision to 26.1%, competitive with the course-grained performance of the best non-corpus system.</p><p>• No annotations were generated for target words preceded by the word <i>to. </i>This results in recall ^ precision as seen in Table 4 and Table 5.</p><p>• In a few rare cases, the system identified the incorrect example word as the example anchor. One such occurrence was the synset <i>art, fine art </i>and the example <i>a fine collection of art </i>The system considered it an example of the <i>fine art </i>collocation and chose <i>fine </i>as the anchor.</p></section><section number="5" title="Conclusion"><p>The approach presented here does not appear to be sufficient for a stand-alone word sense disambiguation solution. Whether this method can be combined with other methods to improve their results requires further investigation.</p></section><references><p><b>Christiane Fellbaum, ed. (1998) </b><i>WordNet: An Electronic Lexical Database. </i><b>The MIT Press, Cambridge, Massachusetts</b></p><p><b>Sherwood Haynes (2001) </b><i>http:V/skhii. home.mindspr </i>ing.com</p><p><b>Nancy Ide and Jean Veronis (1998) </b><i>Introduction to the Special Issue on Word Sense Disambiguation: The State of the Art. </i><b>Computational Linguistics, 24/1, pp. 1 - 40.</b></p><p><b>Adam Kilgarriff and Martha Palmer (2000) </b><i>Introduction to the Special Issue on SENSEVAL. </i><b>Computers and the Humanities 34/1, pp. </b><b>1-13.</b></p><p><b>Adam Kilgarriff and Joseph Rosenzweig (2000) </b><i>Framework and Results for English SENSEVAL. </i><b>Computers and the Humanities 34/1, pp. 15 - 48.</b></p><p><b>George Miller, ed. (1990) </b><i>WordNet: An On-line Lexical Database. </i><b>International Journal of Lexicography, 3/4</b></p><doubt alpha="64.8" length="54" tooSmall="False" monospace="0.0">SENSEVAL-2 (2001)http://www.sle.sharp.co.uk/sensev al2</doubt><p><b>Yorick Wilks (1988) </b><i>Forward. </i><b>In "Lexical Ambiguity Resolution: Perspectives from Psycholinguistics, Neuropsychology, and Artificial Intelligence," Small, S., Cottrell, G., &amp; Tanenhaus, M. ed., Morgan Kaufmann Publishers, Inc., San Mateo, California, pp. iii - ix.</b></p><doubt alpha="65.8" length="79" tooSmall="False" monospace="0.0">WordNet (2001) version 1.7, available athttp://www. cogsci.princeton. edu/~ wn/</doubt></references></body></article>