PageRank on semantic networks, with application to word sense disambiguation
Published 1 January 2004Open access
Rada Mihalcea, Paul Tarau, Elizabeth Figa
Citations211
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new open text word sense disambiguation method that combines the use of logical inferences with PageRank-style algorithms applied on graphs extracted from natural language documents is presented.
Abstract
This paper presents a new open text word sense disambiguation method that combines the use of logical inferences with PageRank-style algorithms applied on graphs extracted from natural language documents. We evaluate the accuracy of the proposed algorithm on several sense-annotated texts, and show that it consistently outperforms the accuracy of other previously proposed knowledge-based word sense disambiguation methods. We also explore and evaluate methods that combine several open-text word sense disambiguation algorithms.
Keywords
Computer Science
Computer Networks and ISDN SystemsThe anatomy of a large-scale hypertextual Web search engine
15,828 Citations1998Sergey Brin, Lawrence M. Page
This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
Journal of the ACMAuthoritative sources in a hyperlinked environment
9,060 Citations1999Jon Kleinberg
This work proposes and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages” that join them together in the link structure, and has connections to the eigenvectors of certain matrices associated with the link graph.
Cohesion in English
5,806 Citations2014Μ. Α. Κ. Halliday, Ruqaiya Hasan
IEEE Transactions on Systems Man and CyberneticsDevelopment and application of a metric on semantic nets
1,810 Citations1989Roy Rada, Hafedh Mili +2 more
Experiments in which distance is applied to pairs of concepts and to sets of concepts in a hierarchical knowledge base show the power of hierarchical relations in representing information about the conceptual distance between concepts.
Automatic sense disambiguation using machine readable dictionaries
1,756 Citations1986Michael Lesk
This procedure uses available dictionaries, so that it will process any text; and uses solely the immediate context to decide which sense of a word is intended (in written English).
Lexical cohesion computed by thesaural relations as an indicator of the structure of text
941 Citations1991Jane Morris, Graeme Hirst
A semantic concordance
616 Citations1993George A. Miller, Claudia Leacock +2 more
A semantic concordance is a textual corpus and a lexicon so combined that every substantive word in the text is linked to its appropriate sense in the lexicon.
One sense per discourse
524 Citations1992William A. Gale, Kenneth Church +1 more
An experiment confirmed the hypothesis that if a polysemous word such as sentence appears two or more times in a well-written discourse, it is extremely likely that they will all share the same sense and found that the tendency to share sense in the same discourse is extremely strong.
Lecture notes in computer scienceUsing Measures of Semantic Relatedness for Word Sense Disambiguation
490 Citations2003Siddharth Patwardhan, Satanjeev Banerjee +1 more
This paper generalizes the Adapted Lesk Algorithm to a method of word sense disambiguation based on semantic relatedness and finds that the gloss overlaps of AdaptedLesk and the semantic distance measure of Jiang and Conrath (1997) result in the highest accuracy.
One sense per collocation
384 Citations1993David Yarowsky
This paper shows that for certain definitions of collocation, a polysemous word exhibits essentially only one sense per collocation and utilizes this property in a disambiguation algorithm that achieves precision of 92% using combined models of very local context.
Selectional Preference and Sense Disambiguation
225 Citations1997Philip Resnik
Computers and the HumanitiesFramework and Results for English SENSEVAL
191 Citations2000Adam Kilgarriff, Joseph Rosenzweig
The exercise identifies the state-of-the-art for fine-grained word sense disambiguation, where training data is available, as 74–78% correct, with a number of algorithms approaching this level of performance.
Word sense disambiguation with very large neural networks extracted from machine readable dictionaries
160 Citations1990Jean Véronis, Nancy Ide
This paper describes a means for automatically building very large neural networks (VLNNs) from definition texts in machine-readable dictionaries, and demonstrates the use of these networks for word sense disambiguation.
Lexical disambiguation using simulated annealing
159 Citations1992Jim Cowie, Joe Guthrie +1 more
Journal of Natural Language ProcessingGeneral Word Sense Disambiguation Method Based on a Full Sentential Context
51 Citations1998Jiri Stetina, Makoto Nagao
A new general supervised word sense disambiguation method based on a relatively small syntactically parsed and semantically tagged training corpus that exploits a full sentential context and all the explicit semantic relations in a sentence to identify the senses of all of that sentence's content words.