The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2010 vol.32)
pp: 678-692
Roberto Navigli , Università di Roma, Roma
Mirella Lapata , University of Edinburgh, Edinburgh
ABSTRACT
Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, has been a long-standing research objective for natural language processing. In this paper, we are concerned with graph-based algorithms for large-scale WSD. Under this framework, finding the right sense for a given word amounts to identifying the most “important” node among the set of graph nodes representing its senses. We introduce a graph-based WSD algorithm which has few parameters and does not require sense-annotated data for training. Using this algorithm, we investigate several measures of graph connectivity with the aim of identifying those best suited for WSD. We also examine how the chosen lexicon and its connectivity influences WSD performance. We report results on standard data sets and show that our graph-based approach performs comparably to the state of the art.
INDEX TERMS
Word sense disambiguation, graph connectivity, semantic networks, social network analysis.
CITATION
Roberto Navigli, Mirella Lapata, "An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.32, no. 4, pp. 678-692, April 2010, doi:10.1109/TPAMI.2009.36
REFERENCES
[1] D. Vickrey, L. Biewald, M. Teyssier, and D. Koller, "Word-Sense Disambiguation for Machine Translation," Proc. Conf. Human Language Technology and Empirical Methods in Natural Language Processing, pp. 771-778, 2005.
[2] C. Stokoe, "Differentiating Homonymy and Polysemy in Information Retrieval," Proc. Conf. Human Language Technology and Empirical Methods in Natural Language Processing, pp. 403-410, 2005.
[3] G. Ramakrishnan, A. Jadhav, A. Joshi, S. Chakrabarti, and P. Bhattacharyya, "Question Answering via Bayesian Inference on Lexical Relations," Proc. ACL Workshop Multilingual Summarization and Question Answering, pp. 1-10, 2003.
[4] R. Barzilay and M. Elhadad, "Using Lexical Chains for Text Summarization," Proc. ACL Workshop Intelligent Scalable Text Summarization, pp. 10-17, 1997.
[5] B. Snyder and M. Palmer, "The English All-Words Task," Proc. Senseval-3 Workshop, pp. 41-43, 2004.
[6] S. Pradhan, E. Loper, D. Dligach, and M. Palmer, "Semeval-2007 Task-17: English Lexical Sample, SRL and All Words," Proc. Semeval-2007 Workshop, pp. 87-92, 2007.
[7] D. Yarowsky and R. Florian, "Evaluating Sense Disambiguation across Diverse Parameter Spaces," Natural Language Eng., vol. 9, no. 4, pp. 293-310, 2002.
[8] T.H. Ng, "Getting Serious about Word Sense Disambiguation," Proc. ACL SIGLEX Workshop Tagging Text with Lexical Semantics: Why, What, and How?, pp. 1-7, 1997.
[9] R. Mihalcea, "Unsupervised Large-Vocabulary Word Sense Disambiguation with Graph-Based Algorithms for Sequence Data Labeling," Proc. Human Language Technology and Empirical Methods in Natural Language Processing, pp. 411-418, 2005.
[10] D. McCarthy, R. Koeling, J. Weeds, and J. Carroll, "Finding Predominant Senses in Untagged Text," Proc. 42nd Ann. Meeting Assoc. for Computational Linguistics, pp. 280-287, 2004.
[11] H. Schütze, "Automatic Word Sense Discrimination," Computational Linguistics, vol. 24, no. 1, pp. 97-124, 1998.
[12] D. Lin and P. Pantel, "Discovering Word Senses from Text," Proc. Eighth ACM SIGKDD, pp. 613-619, 2002.
[13] Word Sense Disambiguation: Algorithms and Applications, E. Agirre and P. Edmonds, eds. Springer, 2007.
[14] R. Navigli, "Word Sense Disambiguation: A Survey," ACM Computing Surveys, vol. 41, no. 2, pp. 1-69, 2009.
[15] R. Navigli and P. Velardi, "Structural Semantic Interconnections: A Knowledge-Based Approach to Word Sense Disambiguation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 7, pp. 1075-1088, July 2005.
[16] M. Lesk, "Automatic Sense Disambiguation Using Machine Readable Dictionaries: How to Tell a Pine Cone from an Ice Cream Cone," Proc. Fifth ACM SIGDOC, pp. 24-26, 1986.
[17] S. Brody, R. Navigli, and M. Lapata, "Ensemble Methods for Unsupervised WSD," Proc. Joint Conf. Int'l Committee on Computational Linguistics and the Assoc. for Computational Linguistics, pp. 97-104, 2006.
[18] R.A. Botafogo, E. Rivlin, and B. Shneiderman, "Structural Analysis of Hypertexts: Identifying Hierarchies and Useful Metrics," ACM Trans. Information Systems, vol. 10, no. 2, pp. 142-180, 1992.
[19] P. Hage and F. Harary, "Eccentricity and Centrality in Networks," Social Networks, vol. 13, pp. 57-63, 1995.
[20] S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications. Cambridge Univ. Press, 1994.
[21] S. Brin and M. Page, "Anatomy of a Large-Scale Hypertextual Web Search Engine," Proc. Seventh Conf. World Wide Web, pp. 107-117, 1998.
[22] J.M. Kleinberg, "Authoritative Sources in a Hyperlinked Environment," Proc. Ninth Symp. Discrete Algorithms, pp. 668-677, 1998.
[23] Z. Gyngyi, H. Garcia-Molina, and J. Pedersen, "Combating Web Spam with Trustrank," Proc. 30th Int'l Conf. Very Large Data Bases, pp. 271-279, 2004.
[24] S. Chakrabarti, M. van den Berg, and B. Dom, "Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery," Proc. Eighth Int'l Conf. World Wide Web, pp. 1623-1640, 1999.
[25] A. Balmin, V. Hristidis, and Y. Papakonstantinou, "Objectrank: Authority-Based Keyword Search in Databases," Proc. 13th Conf. Very Large Data Bases, pp. 564-575, 2004.
[26] M.A.R.J. Bollen and H.V. de Sompel, "Mesur: Usage-Based Metrics of Scholarly Impact," Proc. Seventh ACM/IEEE-CS Joint Conf. Digital Libraries, p. 474, 2007.
[27] M. Galley and K. McKeown, "Improving Word Sense Disambiguation in Lexical Chaining," Proc. 18th Int'l Joint Conf. Artificial Intelligence, pp. 1486-1488, 2003.
[28] R. Mihalcea, P. Tarau, and E. Figa, "Pagerank on Semantic Networks, with Application to Word Sense Disambiguation," Proc. 20th Int'l Conf. Computational Linguistics, 2004.
[29] J. Véronis, "Hyperlex: Lexical Cartography for Information Retrieval," Computer, Speech and Language, vol. 18, no. 3, pp. 223-252, 2004.
[30] E. Agirre, D. Martínez, O.L. de Lacalle, and A. Soroa, "Two Graph-Based Algorithms for State-of-the-Art WSD," Proc. Conf. Empirical Methods in Natural Language Processing, pp. 585-593, 2006.
[31] X. Zhu and Z. Ghahramani, "Learning from Labeled and Unlabeled Data with Label Propagation," Technical Report CMU-CALD-02, 2002.
[32] Z. Niu, D. Ji, and C.L. Tan, "Word Sense Disambiguation Using Label Propagation Based Semi-Supervised Learning," Proc. 43rd Ann. Meeting on Assoc. for Computational Linguistics, pp. 395-402, 2005.
[33] G. Erkan and D.R. Radev, "Lexrank: Graph-Based Lexical Centrality as Salience in Text Summarization," J. Artificial Intelligence Research, vol. 22, pp. 457-479, 2004.
[34] R. Mihalcea and P. Tarau, "Textrank: Bringing Order into Texts," Proc. Conf. Empirical Methods in Natural Language Processing, D. Lin and D. Wu, eds., pp. 404-411, 2004.
[35] X. Wan and J. Yang, "Improved Affinity Graph Based Multi-Document Summarization," Proc. Human Language Technology Conf.—North Am. Chapter of the Assoc. for Computational Linguistics Ann. Meeting, pp. 181-184, 2006.
[36] A. Esuli and F. Sebastiani, "Pageranking WordNet Synsets: An Application to Opinion Mining," Proc. 45th Ann. Meeting on Assoc. for Computational Linguistics, pp. 424-431, June 2007.
[37] J. Otterbacher, G. Erkan, and D. Radev, "Using Random Walks for Question-Focused Sentence Retrieval," Proc. Human Language Technology and Empirical Methods in Natural Language Processing, pp. 915-922, 2005.
[38] R. Navigli and P. Velardi, "Learning Domain Ontologies from Document Warehouses and Dedicated Websites," Computational Linguistics, vol. 30, no. 2, pp. 151-179, 2004.
[39] D. Feng, E. Shaw, J. Kim, and E. Hovy, "Learning to Detect Conversation Focus of Threaded Discussions," Proc. Human Language Technology Conf.—North Am. Chapter of the Assoc. for Computational Linguistics Ann. Meeting, pp. 208-215, 2006.
[40] K. Toutanova, C. Manning, and A. Ng, "Learning Random Walk Models for Inducing Word Dependency Distributions," Proc. 21st Int'l Conf. Machine Learning, 2004.
[41] M.E.J. Newman, "The Structure and Function of Complex Networks," SIAM Rev., vol. 45, pp. 167-256, 2003.
[42] A. Budanitsky and G. Hirst, "Evaluating WordNet-Based Measures of Semantic Distance," Computational Linguistics, vol. 32, no. 1, pp. 13-47, 2006.
[43] T. Pedersen, S. Banerjee, and S. Patwardhan, "Maximizing Semantic Relatedness to Perform Word Sense Disambiguation," Technical Report UMSI 2005/25, 2005.
[44] R. Navigli and M. Lapata, "Graph Connectivity Measures for Unsupervised Word Sense Disambiguation," Proc. 20th Int'l Joint Conf. Artificial Intelligence, pp. 1683-1688, 2007.
[45] S. Banerjee and T. Pedersen, "Extended Gloss Overlaps as a Measure of Semantic Relatedness," Proc. 18th Int'l Joint Conf. Artificial Intelligence, pp. 805-810, 2003.
[46] WordNet: An Electronic Lexical Database, C. Fellbaum, ed. MIT Press, 1998.
[47] G. Miller, C. Leacock, T. Randee, and R. Bunker, "A Semantic Concordance," Proc. Third DARPA Workshop Human Language Technology, pp. 303-308, 1993.
[48] A. Novischi, "Combining Methods for Word Sense Disambiguation of WordNet Glosses," Proc. 17th Florida Artificial Intelligence Research Soc. Conf., 2004.
[49] E. Agirre and A. Soroa, "Using the Multilingual Central Repository for Graph-Based Word Sense Disambiguation," Proc. Sixth Language Resources and Evaluation Conf., 2008.
[50] W. Gale, K. Church, and D. Yarowsky, "One Sense per Discourse," Proc. Fourth DARPA Speech and Natural Language Workshop, pp. 233-237, 1992.
[51] L.C. Freeman, "Centrality in Social Networks: Conceptual Clarification," Social Networks, vol. 1, pp. 215-239, 1979.
[52] B.P. Bonacich, "Factoring and Weighing Approaches to Status Scores and Clique Identification," J. Math. Sociology, vol. 2, pp. 113-120, 1972.
[53] S.P. Borgatti, "Identifying Sets of Key Players in a Network," Proc. Conf. Integration of Knowledge Intensive Multi-Agent Systems, pp. 127-131, 2003.
[54] G. Sabidussi, "The Centrality Index of a Graph," Psychometrika, vol. 31, pp. 581-603, 1966.
[55] S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, second ed. Prentice Hall, 2002.
[56] J. Cowie, J. Guthrie, and L. Guthrie, "Lexical Disambiguation Using Simulated Annealing," Proc. Fourth Int'l Conf. Computational Linguistics, pp. 359-365, 1992.
[57] M. Mitchell, An Introduction to Genetic Algorithms. MIT Press, 1996.
[58] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, 1990.
[59] D.B. Johnson, "Efficient Algorithms for Shortest Paths in Sparse Networks," J. ACM, vol. 24, pp. 1-13, 1977.
[60] U. Brandes, "A Faster Algorithm for Betweenness Centrality," J. Math. Sociology, vol. 25, no. 2, pp. 163-177, 2001.
[61] R. Navigli, "Semi-Automatic Extension of Large-Scale Linguistic Knowledge Bases," Proc. 18th Florida Artificial Intelligence Research Soc. Conf., pp. 548-553, 2005.
[62] D. Yarowsky, "One Sense Per Collocation," Proc. ARPA Workshop Human Language Technology, pp. 266-271, 1993.
[63] H.T. Ng and H.B. Lee, "Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-Based Approach," Proc. 34th Ann. Meeting on Assoc. for Computational Linguistics, pp. 40-47, 1996.
[64] Oxford Collocations, D. Lea, ed. Oxford Univ. Press, 2002.
[65] Longman Language Activator, Longman, ed. Pearson Education, 2003.
[66] T. Upstill, N. Craswell, and D. Hawking, "Predicting Fame and Fortune: PageRank or Indegree?" Proc. Eighth Australasian Document Computing Symp., pp. 31-40, 2003.
[67] P. Edmonds and S. Cotton, "Senseval-2: Overview," Proc. Senseval-2 Workshop, pp. 1-6, 2001.
[68] C. Strapparava, A. Gliozzo, and C. Giuliano, "Pattern Abstraction and Term Similarity for Word Sense Disambiguation: IRST at Senseval-3," Proc. Senseval-3 Workshop, pp. 229-234, 2004.
[69] B. Decadt, V. Hoste, W. Daelemans, and A. van den Bosch, "GAMBL, Genetic Algorithm Optimization of Memory-Based WSD," Proc. Senseval-3 Workshop, pp. 108-112, 2004.
[70] E. Agirre, L. Màrquez, and R. Wicentowski, Proc. Semeval-2007 Workshop, 2007.
[71] S.K. Naskar and S. Bandyopadhyay, "Ju-Sknsb: Extended WordNet Based WSD on the English All-Words Task at Semeval-1," Proc. Semeval-2007 Workshop, pp. 203-206, 2007.
[72] R. Ion and D. Tufiş, "RACAI: Meaning Affinity Models," Proc. Semeval-2007 Workshop, pp. 282-287, 2007.
[73] D. Yuret, "Discovery of Linguistic Relations Using Lexical Attraction," PhD dissertation, Dept. of Computer Science and Electrical Eng., Massachusetts Inst. of Tech nology, 1998.
[74] S. Tratz, A. Sanfilippo, M. Gregory, A. Chappell, C. Posse, and P. Whitney, "PNNL: A Supervised Maximum Entropy Approach to Word Sense Disambiguation," Proc. Semeval-2007 Workshop, pp. 264-267, June 2007.
[75] N. Litvak, W. Scheinhardt, and Y. Volkovich, "In-Degree and PageRank of Web Pages: Why Do They Follow Similar Power Laws?" Memorandum 1807, Dept. of Applied Math., Univ. of Twente, 2006.
[76] EuroWordNet: A Multilingual Database with Lexical Semantic Networks, P. Vossen, ed. Kluwer, 1998.
[77] E. Pianta, L. Bentivogli, and C. Girardi, "MultiWordNet: Developing an Aligned Multilingual Database," Proc. First Int'l Conf. Global WordNet, pp. 21-25, 2002.
[78] M. Chodorow, R. Byrd, and G. Heidorn, "Extracting Semantic Hierarchies from a Large On-Line Dictionary," Proc. 23rd Ann. Meeting on Assoc. for Computational Linguistics, pp. 299-304, 1985.
[79] G. Rigau, H. Rodríguez, and E. Agirre, "Building Accurate Semantic Taxonomies from Monolingual mrds," Proc. Seventh Int'l Conf. Computational Linguistics, pp. 1103-1109, 1998.
[80] R. Snow, D. Jurafsky, and A.Y. Ng, "Semantic Taxonomy Induction from Heterogenous Evidence," Proc. Joint Conf. Int'l Committee on Computational Linguistics and the Assoc. for Computational Linguistics, pp. 801-808, 2006.
13 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool