<?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="367"/><title>KSU KDD: Word Sense Induction by Clustering in Topic Space</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 367-370, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Elshamy" givenname="Wesam"><org  name="Bath University" country="United Kingdom"/></author><author surname="Caragea" givenname="Doina"><org  name="Bath University" country="United Kingdom"/></author><author surname="Hsu" givenname="William"><org  name="Bath University" country="United Kingdom"/></author></firstpageheader><frontmatter><p><b>KSU KDD: Word Sense Induction by Clustering in Topic Space</b></p><p>Wesam Elshamy, Doina Caragea, William H. Hsu</p><p>Kansas State University <b>{welshamy, dcaragea, bhsu}@ksu.edu</b></p></frontmatter><abstract>We describe our language-independent un­supervised word sense induction system. This system only uses topic features to cluster different word senses in their global context topic space. Using unlabeled data, this system trains a latent Dirichlet allo­cation (LDA) topic model then uses it to infer the topics distribution of the test in­stances. By clustering these topics dis­tributions in their topic space we cluster them into different senses. Our hypothesis is that closeness in topic space reflects sim­ilarity between different word senses. This system participated in SemEval-2 word sense induction and disambiguation task and achieved the second highest V-measure score among all other systems. </abstract></header><body><section number="1" title="Introduction"><p>Ambiguity of meaning is inherent in natural lan­guage because the deliverer of words tries to mini­mize the size of the vocabulary set he uses. There­fore, a sizable portion of this vocabulary is polyse-mous and the intended meaning of such words can be encoded in their context.</p><p>Due to the knowledge acquisition bottleneck problem and scarcity in training data (Cai et al., 2007), unsupervised corpus based approaches could be favored over supervised ones in word sense disambiguation (WSD) tasks.</p><p>Similar efforts in this include work by Cai et al. (Cai et al., 2007) in which they use latent Dirichlet allocation (LDA) topic models to extract the global context topic and use it as a feature along other baseline features. Another technique uses clustering based approach with WordNet as an external resource for disambiguation without rely­ing on training data (Anaya-Sânchez et al., 2007).</p><p>To disambiguate a polysemous word in a text document, we use the document topic distribution to represent its context. A document topic distri­bution is the probabilistic distribution of a docu­ment over a set of topics. The assumption is that: given two word senses and the topic distribution of their context, the closeness between these two topic distributions in their topic space is an indi­cation of the similarity between those two senses.</p><p>Our motivation behind building this system was the observation that the context of a polysemous word helps determining its sense to some degree. In our word sense induction (WSI) system, we use LDA to create a topic model for the given corpus and use it to infer the topic distribution of the documents containing the ambiguous words.</p><p>This paper describes our WSI system which par­ticipated in SemEval-2 word sense induction and disambiguation task (Manandhar et al., 2010).</p></section><section number="2" title="Latent Dirichlet allocation"><p>LDA is a probabilistic model for a collection of dis­crete data (Blei et al., 2003). It can be graphically represented as shown in Figure 1 clS <b>cL </b>three level hierarchical Bayesian model. In this model, the corpus consists of <i>M </i>documents, each is a multino­mial distribution over <i>K </i>topics, which are in turn multinomial distributions over words.</p><p>To generate a document <i>d </i>using this probabilis­tic model, a distribution over topics <i>6</i><i>a </i>is generated using a Dirichlet prior with parameter <i>a. </i>Then, for each of the <i>Nj </i>words <i>w</i><i>^n </i>in the document, a topic <i>Zdn </i>is drawn from a multinomial distribu­tion with the parameter <i>64. </i>Then, a word <i>Wdn </i>is drawn from that topic's distribution over words, given <i>ßij </i><i>= p(w = i\z = </i><i>j).</i><i> </i>Where <i>ßij </i>is the proba­bility of choosing word <i>i </i>given topic <i>j.</i></p></section><section number="3" title="System description"><p>We wanted to examine the trade-off between sim­plicity, cost and performance by building a simple language-independent, totally unsupervised, com­putationally cheap system and compare its perfor­mance to other WSI systems participating in the SemEval-2 WSI task (Manandhar et al., 2010).<page local="2" global="368"/> We expect a degradation in precision of our simple ap­proach as the granularity of senses becomes finer; This is due to the degrading sensitivity in mapping between the topics space and the senses space. We note that our simple approach will fail if multiple senses of the same word appear in the same docu­ment; Since these senses will be represented by the same topic distribution of the document, they will be clustered in the same cluster.</p><table caption="Figure 1: A graphical model for LDA" 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></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><b>5—</b></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></p></td><td class="cell"><p><i>M</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></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><p>Our system is a language-independent system. The used LDA topic model has no knowledge of the training or testing corpus language. Unlike most other WSI and WSD systems, it doesn't make use of part of speech (POS) features which are lan­guage dependent and require POS annotated train­ing data. The only features used are the topics dis­tribution of bag-of-words containing the ambigu­ous word.</p><p>First, for each target polysemous word <i>wp </i>(noun or verb), we train a MALLET<footnote anchor="1"/> parallel topic model implementation of LDA on all the training in­stances of that word. Then we use the trained topic model to infer the topics distribution <i>0i </i>for each of the test instances of that word. For a if-topics topic model, each topics distribution can be repre­sented as a point in a if-dimensional topic space. These points can be clustered into <i>C </i>different clus­ters, each representing a word sense. We used MALLET's if-means clustering algorithm with co­sine similarity to measure the distance between dif­ferent topic distributions in the topic space.</p></section><section number="4" title="Evaluation measures"><p>We use the same unsupervised evaluation mea­sures used in SemEval-2 (Manandhar and Kla-paftis, 2009). These measures do not require de­scriptive</p><p>The V-measure is used for unsupervised evalu­ation. It is the harmonic mean of the <i>homogene­ity </i>and <i>completeness. </i>Homogeneity is a measure of the degree that each formed cluster consists of data points that belong to a single gold standard (GS) class as defined below.</p><p><i>homogeneity = </i>1 <i>H (GS)</i></p><doubt alpha="50.0" length="14" tooSmall="False" monospace="0.0">H(GS\C) H (GS)</doubt><doubt alpha="36.4" length="11" tooSmall="False" monospace="0.0">L—^7— log -</doubt><doubt alpha="66.7" length="3" tooSmall="False" monospace="0.0">i=l</doubt><doubt alpha="37.5" length="8" tooSmall="False" monospace="0.0">\C\ \GS\</doubt><doubt alpha="45.0" length="20" tooSmall="False" monospace="0.0">H(GS\C)= - E Ej=\i=i</doubt><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">N</doubt><doubt alpha="60.0" length="5" tooSmall="False" monospace="0.0">V1au■</doubt><doubt alpha="0.0" length="11" tooSmall="False" monospace="0.0">(1) (2) (3)</doubt><table caption="Table 1: Effect of varying the number of topics if on performance"></table><doubt alpha="3.3" length="30" tooSmall="False" monospace="0.0">K 10     50     200    400 500</doubt><doubt alpha="34.1" length="41" tooSmall="False" monospace="0.0">V-measure 5.1 5.8 F-score        8.6 32.0</doubt><doubt alpha="0.0" length="17" tooSmall="False" monospace="0.0">7.2 8.4 53.9 63.9</doubt><doubt alpha="0.0" length="8" tooSmall="False" monospace="0.0">8.1 64.2</doubt><p>Where <i>H()</i><i> </i>is an entropy function, <i>\C\ </i>and <i>\GS\ </i>refer to cluster and class sizes, respectively. <i>N </i>is the number of data points, are data points of class <i>GSi </i>that belong to cluster <i>Cj.</i></p><p>On the other hand, completeness measures the degree that each class consists of data points that belong to a single cluster. It is defined as follows.</p><p><i>completeness</i></p><doubt alpha="46.2" length="13" tooSmall="False" monospace="0.0">H(C)=-H(C\GS)</doubt><doubt alpha="100.0" length="2" tooSmall="False" monospace="0.0">kN</doubt><doubt alpha="37.5" length="8" tooSmall="False" monospace="0.0">\GS\ \C\</doubt><doubt alpha="50.0" length="14" tooSmall="False" monospace="0.0">L_ H(C\GS)H(C)</doubt><doubt alpha="42.9" length="7" tooSmall="False" monospace="0.0">^log2^1</doubt><doubt alpha="66.7" length="12" tooSmall="False" monospace="0.0">y y^ iOKaii_</doubt><doubt alpha="0.0" length="11" tooSmall="False" monospace="0.0">(4) (5) (6)</doubt><doubt alpha="66.7" length="6" tooSmall="False" monospace="0.0">i=ij=i</doubt><footnote label="1">http: / / mallet.cs.umass.edu</footnote><p>Homogeneity and completeness can be seen as entropy based measures of precision and recall, re­spectively. The V-measure has a range of 0 (worst performance) to 1, inclusive.</p><p>The other evaluation measure is the F-score, which is the harmonic mean of precision and re­call. It has a range of 0 to 1 (best performance), inclusive.</p></section><section number="5" title="Experiments and results"><p>The WSI system described earlier was tested on SemEval-1 WSI task (task 2) data (65 verbs, 35 nouns), and participated in the same task in SemEval-2 (task 14) (50 verbs, 50 nouns). The sense induction process was the same in both cases.</p><p>Before running our main experiments, we wanted to see how the number of topics if used in the topic model could affect the performance of our system. We tested our WSI system on SemEval-1 data using different if values as shown in Table 1. We found that the V-measure and F-score values increase with increasing if, as more dimensions are added to the topic space, the different senses in this if-dimensional space unfold. This trend stops at a value of if = 400 in a sign to the limited vocabu­lary of the training data. This if value is used in all other experiments.</p><p>Next, we evaluated the performance of our sys­tem on SemEval-1 WSI task data. Since no train­ing data was provided for this task, we used an un-annotated version of the test instances to create the LDA topic model. For each target word (verb or noun), we trained the topic model on its given test<page local="3" global="369"/></p><doubt alpha="80.0" length="5" tooSmall="False" monospace="0.0">N1UëV</doubt><table caption="Table 2: V-measure and F-score on SemEval-1 All    Verbs Nouns"></table><p>V-measure F-score instances. Then we used the generated model's in-ferencer to find the topics distribution of each one of them. These distributions are then clustered in the topic space using the if-means algorithm and the cosine similarity measure was used to evalu­ate the distances between these distributions. The results of this experiment are shown in Table 2.</p><doubt alpha="0.0" length="8" tooSmall="False" monospace="0.0">8.4 63.9</doubt><doubt alpha="0.0" length="8" tooSmall="False" monospace="0.0">8.0 56.8</doubt><doubt alpha="0.0" length="8" tooSmall="False" monospace="0.0">8.7 69.0</doubt><table caption="Table 3: V-measure and F-score on SemEval-2 All    Verbs Nouns"></table><doubt alpha="0.0" length="9" tooSmall="False" monospace="0.0">15.7 36.9</doubt><doubt alpha="0.0" length="9" tooSmall="False" monospace="0.0">12.4 54.7</doubt><doubt alpha="0.0" length="9" tooSmall="False" monospace="0.0">18.0 24.6</doubt><p>Our WSI system took part in the main SemEval-2 WSI task (task 14). In the unsupervised evalua­tion, our system had the second highest V-measure value of 15.7 for all words<footnote anchor="2"/>. A break down of the obtained V-measure and F-scores is shown in Table 3.</p><p>To analyze the performance of the system, we examined the clustering of the target noun word <i>"promotion" </i>to different senses by our system. We compared it to the GS classes of this word in the answer key provided by the task organizers. For a more objective comparison, we ran the if-means clustering algorithm with <i>K </i>equal to the number of GS classes. Even though the number of formed clusters affects the performance of the system, we assume that the number of senses is known in this analysis. We focus on the ability of the algorithm to cluster similar senses together. A graphical com­parison is given in Figure 2.</p><p>The target noun word "promotion" has 27 in­stances and four senses. The lower four rectangles in Figure 2 represent the four different GS classes, and the upper four rectangles represent the four clusters created by our system. Three of the four instances representing a <i>job </i>"promotion" (O) were clustered together, but the fourth one was clus­tered in a different class due to terms like "driv­ing," "troops," and "hostile" in its context. The offer sense of "promotion" <i>(sj)</i><i> </i>was mainly split between two clusters, cluster 2 which most of its instances has mentions of numbers and monetary units, and cluster 4 which describes business and labor from an employee's eye.</p><p>The 13 instances of the third class which carry the sense <i>encourage </i>of the word promotion (□) are distributed among the four different clusters de-</p><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">3</doubt><doubt alpha="0.0" length="6" tooSmall="False" monospace="0.0">□  □ □</doubt><doubt alpha="36.4" length="11" tooSmall="False" monospace="0.0">o     o o o</doubt><doubt alpha="100.0" length="3" tooSmall="False" monospace="0.0">VWW</doubt><doubt alpha="0.0" length="11" tooSmall="False" monospace="0.0">□ □ □ □□□□□</doubt><p>A complete evaluation of all partic­ipating      systems      is      available     online at:</p><doubt alpha="65.6" length="64" tooSmall="False" monospace="0.0">http:/ /www. es.york.ac.uk/semeval2010_WSI/tas k_14_ranking.html</doubt><p>Job Offer     Encourage Press pending on other topic words that classified them as either belonging to cluster 4 (encouragement in business), cluster 3 (encouragement in conflict or war context), cluster 2 (numbers and money con­text), or cluster 1 (otherwise). We can see that the topic model is unable to detect and extract topic words for the "encourage" sense of the word. Fi­nally, due to the lack of enough training instances of the sense of a promotional issue of a newspaper the topic model inferencer clustered it in the numbers and monetary cluster because it was rich in numbers.</p><figure caption="Figure 2: Analysis of sense clustering"></figure></section><section number="6" title="Conclusion"><p>Clustering the topics distributions of the global context of polysemous words in the topic space to induce their sense is cheap as it does not require any annotated data and is language-independent.</p><p>Even though the clustering produced by our sys­tem did not fully conform with the set of senses given by the GS classes, it can be seen from the analyzed example given earlier that our cluster­ing carried some different senses. In one case, a GS sense was not captured by the topic model, and instead, other cues from its instances context were used to cluster them accordingly. The in­duced clustering had some noise though.</p><p>This simple WSI approach can be used for cheap sense induction or for languages for which no POS tagger has been created yet. This system which had the second highest V-measure score in SemEval-2 WSI task achieves a good trade-off be­tween performance and cost.</p></section><references><p>Henry Anaya-Sânchez, Aurora Pons-Porrata, and Rafael Berlanga-Llavori. 2007. Tkb-uo: Us­ing sense clustering for wsd. In <i>Proceedings of the Fourth International Workshop on Seman­tic Evaluations (SemEval-2007), </i>pages 322-325,<page local="4" global="370"/></p><p>Prague, Czech Republic, June. Association for Computational Linguistics.</p><p>David M. Blei, Andrew Y. Ng, and Michael I. Jor­dan. 2003. Latent dirichlet allocation. <i>J. Mach. Learn. Res., </i>3:993-1022.</p><p>Junfu Cai, Wee Sun Lee, and Yee Whye Teh. 2007. Improving word sense disambiguation us­ing topic features. In <i>Proceedings </i><i>of</i><i> the 2007 Joint Conference on Empirical Methods in Nat­ural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), </i>pages 1015-1023, Prague, Czech Republic, June. Association for Computational Linguistics.</p><p>Suresh Manandhar and Ioannis P. Klapaftis. 2009. Semeval-2010 task 14: evaluation setting for word sense induction &amp; disambiguation sys­tems. In <i>DEW '09: Proceedings of the Workshop on Semantic Evaluations: Recent Achievements and Future Directions, </i>pages 117-122, Morris-town, NJ, USA. Association for Computational Linguistics.</p><p>Suresh Manandhar, Ioannis P. Klapaftis, Dmitriy Dligach, and Sameer S. Pradhan. 2010. Semeval-2010 task 14: Word sense induction &amp; disambiguation. In <i>Proceedings of SemEval-2, </i>Uppsala, Sweden. ACL.</p></references></body></article>