<?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="433"/><title>HR-WSD: System Description for All-Words Word Sense Disambiguation on a Specific Domain at SemEval-2010</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 433^-35, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Shih" givenname="Meng-Hsien"><org  name="Frei University" country="Germany" city="Berlin"/></author></firstpageheader><frontmatter><p><b>HR-WSD: System Description for All-words Word Sense Disambiguation on a Specific Domain at SemEval-2010</b></p><p><b>Meng-Hsien Shih</b></p><p>National Taipei University of Technology Taipei, Taiwan, ROC.</p><p>simon.xian@gmail.com</p></frontmatter><abstract>The document describes the knowledge-based Domain-WSD system using heuris­tic rules (knowledge-base). This HR-WSD system delivered the best perfor­mance (55.9%) among all Chinese sys­tems in SemEval-2010 Task 17: All-words WSD on a specific domain. </abstract></header><body><section number="1" title="Introduction"><p>Word Sense Disambiguation (WSD) is essential for language understanding systems such as in­formation retrieval, summarization, and machine translation systems (Dagan and Itai, 1994; Schutze and Pedersen, 1995; Ng and Zelle, 1997). In par­ticular due to the rapid development of other is­sues in computational linguistics, WSD has been considered the next important task to be solved. Among various WSD tasks, the lexical sample task can achieve a precision rate more than 70% in Chinese, so can the all-words task in English, but currently no Chinese all-words WSD system is available. This study proposes an all-words WSD system conducted on a specific domain which can achieve a 55.9% precision rate.</p><p>This system makes use of certain characteristics of WordNet. First, the sense inventory in Chinese WordNet is ordered by the "prototypicality" of the words. In other words, the first sense of a word with multiple senses will be the prototype mean­ing of that word. In addition to semantic relations and sense definitions, Chinese WordNet also in­cludes sense axes which indicate the relations be­tween Chinese senses and corresponding English senses.</p></section><section number="2" title="Proposed Approach"><p>Two heuristic rules are devised to characterize domain texts: In a domain text, domain senses are more likely to occur in words if they have one (Heuristic Rule 1); on the other hand, for words with no domain senses, the most generic usages (prototype senses) are more likely to be adopted (Heuristic Rule 2). Therefore, as proposed by Li et al.(1995) for the WordNet-based domain-independent texts WSD task, two heuristic rules (HR) are taken into consideration in the domain WSD test:</p><p><b>for </b>all senses <i>Sk </i>of w <b>do if </b>w has domain sense</p><p>choose domain sense <i>Sk </i><b>else</b> choose prototype sense <i>s\</i></p><doubt alpha="100.0" length="3" tooSmall="False" monospace="0.0">end</doubt><p>Figure 1 : Heuristic Rules based WSD</p><p>Besides, sense definitions from WordNet were also tested with simplified Lesk algorithm (Lesk, 1986; Kilgarriff and Rosenzweig, 2000) in another experiment to examine the effect of considering sense definitions in domain WSD:</p><p>choose domain sense <i>Sk </i><b>elseif </b><i>Dk </i>overlaps with <i>C :</i></p><p>choose sense <i>Sk </i>with <i>Dk</i></p><p>that overlaps the most <b>else:</b></p><p>Figure 2: HR with simplified Lesk Algorithm. <i>Dk </i>is the set of content words occurring in the dic­tionary definition of sense <i>Sk- </i><i>C </i>is the set of con­tent words in the context.</p><page local="2" global="434"/></section><section number="3" title="Procedures"><p>Before the test only preprocessing including seg­mentation and parts of speech tagging will be applied to the target texts, in order to eliminate those senses of the same word form in other parts of speech; the background documents provided by SemEval-2010 are not used for training since this is not a supervised system. According to Wang (2002), with preprocessing of PoS tagging alone, 20% of word sense ambiguity can be distin­guished.</p><p>Since the current number of semantic relations in Chinese WordNet is still less than that in En­glish WordNet (PWN), to detect domain senses, the sense axes in Chinese WordNet are exploited. By seeding with English words such as "environ­ment" and "ecology," all English words related to these seed words can be captured with the help of the semantic relations in Princeton WordNet. By mapping these environment-related English words to Chinese words with any kind of semantic rela­tions in the sense axes, the corresponding Chinese domain senses can be identified.</p><p>Therefore, the HR-WSD system will first con­sider any domain senses for the words to be dis­ambiguated; if there is no such sense, the proto­type sense will be adopted. Another test where sense definitions from WordNet are considered to facilitate HR-based disambiguation was also con­ducted.</p></section><section number="4" title="Evaluation"><p>The results were evaluated according to three man­ually tagged documents in SemEval-2010 Task 17: All-words WSD on a Specific domain (Agirre et al., 2010). The most frequent sense baseline (MFS) refers to the first sense in WordNet lexical markup framework (In Chinese WordNet senses are ordered according to annotations in hand-labelled corpora). In these tagged domain texts, only nouns and verbs (two major types of content words) as a single word are disambiguated. There­fore, in this system only these two kinds of words will be tagged with senses. Adjectives, adverbs, or words in multiple forms (e.g., idioms and phrases) are not considered, in order to simplify the test and observe the results more clearly.</p></section><section number="5" title="Results"><p>By observing that the HR-WSD system* (Rank 1) outperformed other systems and was closest to the MFS performance we can infer that Heuristic Rule 2 works. However, since this system perfor­mance is still worse than MFS, it may indicate that Heuristic Rule 1 does not work well, or even de­creases the system performance, so the mechanism to detect domain senses needs to be refined. Be­sides, the inclusion of simplified Lesk algorithm** did not perform better than the original HR-WSD system, further investigation such as more fine­grained definition can be expected.</p></section><section number="6" title="Discussion and Future Development"><p>Although PoS tagging may help filter out senses from other parts of speech of the same word form, incorrect PoS tagging will lead to incorrect sense tagging, which did happen in the HR-WSD sys­tem, in particular when there is more than one pos­sible PoS tag for the word. For instance, 'nuan-hua' in 'quan-qiu nuan-hua' (global warming) is manually tagged with a verbal sense in the answer key from SemEval-2010, but tagged as a noun in the pre-processing stage of the HR-WSD sys­tem. The difference between manual tagged texts and automatic tagged texts should be examined, or consider allowing more than one PoS tag for a word, or even no PoS pre-processing at all.</p><p>To disambiguate with the help of gloss defini­tion, gloss words of the polysemous word must have direct overlapping with that of its context word, which does not always occur. To solve this problem, we may expand gloss words to related words such as hyponyms, hypernyms, meronyms, or the gloss definition of the current gloss words.</p><p>Apart from nouns and verbs, if function words and other kinds of content words such as adjec­tives and adverbs are to be disambiguated, the per­formance of the current WSD system needs to be re-examined.</p><p>As mentioned in the beginning, WSD is an es­sential part in language understanding systems.</p><table caption="Table 1: 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><b>Rank</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>MFS</p></td><td class="cell"><p>0.562</p></td><td class="cell"><p>0.562</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>1*</p></td><td class="cell"><p>0.559</p></td><td class="cell"><p>0.559</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>2**</p></td><td class="cell"><p>0.517</p></td><td class="cell"><p>0.517</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>3</p></td><td class="cell"><p>0.342</p></td><td class="cell"><p>0.285</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>4</p></td><td class="cell"><p>0.322</p></td><td class="cell"><p>0.296</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Random</p></td><td class="cell"><p>0.32</p></td><td class="cell"><p>0.32</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>5</p></td><td class="cell"><p>0.310</p></td><td class="cell"><p>0.258</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="3" global="435"/><p>With this Chinese WSD program, information retrieval, summarization, or machine translation tasks would be more plausible. The proposed heuristic rules may also work for other languages with similar WordNet resources. Besides, this sys­tem was currently tested on three texts from the environment domain only. It can be expected that this Chinese WSD can work on texts of other do­mains.</p></section><references><p>Adam Kilgarriff and Joseph Rosenzweig. 2000. Framework and results for English SENSEVAL. <i>Computers and the Humanities.,</i>,34:15^18.</p><p>Eneko Agirre, Oier Lopez de Lacalle, Christiane Fell­baum, Shu-kai Hsieh, Maurizio Tesconi, Monica Monachini, Piek Vossen and Roxanne Segers. 2010. SemEval-2010 Task 17: All-words Word Sense Dis­ambiguation on a Specific Domain. <i>In Proceedings of the 5th International Workshop on Semantic Eval­uations (SemEval-2010), Association for Computa­tional Linguistics, Uppsala, Sweden..</i></p><p>Hinrich Schutze and Jan O. Pedersen. 1995. Informa­tion Retrieval Based on Word Senses. <i>In Proceed­ings of the ACM Special Interest Group on Informa­tion Retrieval.</i></p><p>Hui Wang. 2002. A Study on Noun Sense Disam­biguation Based on Syntagmatic Features. <i>Inter­national Journal of Computational Linguistics and Chinese Language Processing,7(2):77</i><i>-88.</i></p><p>Hwee Tou Ng and John Zelle. 1997. Corpus-Based Approaches to Semantic Interpretation in Natural Language Processing. <i>AI magazine, </i>18(4):45-64.</p><p>Ido Dagan and Alon Itai. 1994. Word-Sense Disam­biguation Using a Second-Language Monolingual Corpus. <i>Computational Linguistics,</i>20(4):563-596.</p><p>Michael Lesk. 1986. Automatic sense disambiguation using machine readable dictionaries: How to tell a pine from a ice cream cone. <i>In Proceedings of the 5th International Conference on Systems Documen­tation, Toronto, CA, pp. 24-26..</i></p><p>Xiaobin Li, Stan Szpakowicz, and Stan Matwin. 1995. A WordNet-based Algorithm for Word Sense Dis­ambiguation. <i>The 14th International Joint Confer­ence on Artificial Intelligence.</i></p></references></body></article>