Anaphora Resolution with Word Sense Disambiguation
نویسنده
چکیده
We describe a simple word sense disambiguation system equipped with the Kennedy and Boguraev (1996) anaphora resolution algorithm, evaluated on the SENSEVAL-2 English all-words task. The system relies on the structure of the WordNet hierarchy to pick optimal senses for nouns in the text. Since anaphoric references are known to indicate the topic of the text (Boguraev et al., 1998), they may aid disambiguation.
منابع مشابه
A Large Margin Approach to Anaphora Resolution for Neuroscience Knowledge Discovery
A discriminative large margin classifier based approach to anaphora resolution for neuroscience abstracts is presented. The system employs both syntactic and semantic features. A support vector machine based word sense disambiguation method combining evidence from three methods, that use WordNet and Wikipedia, is also introduced and used for semantic features. The support vector machine anaphor...
متن کاملImproving Japanese Zero Pronoun Resolution by Global Word Sense Disambiguation
This paper proposes unsupervised word sense disambiguation based on automatically constructed case frames and its incorporation into our zero pronoun resolution system. The word sense disambiguation is applied to verbs and nouns. We consider that case frames define verb senses and semantic features in a thesaurus define noun senses, respectively, and perform sense disambiguation by selecting th...
متن کاملNP Animacy Identification for Anaphora Resolution
In anaphora resolution for English, animacy identification can play an integral role in the application of agreement restrictions between pronouns and candidates, and as a result, can improve the accuracy of anaphora resolution systems. In this paper, two methods for animacy identification are proposed and evaluated using intrinsic and extrinsic measures. The first method is a rule-based one wh...
متن کاملComputational Models for Chinese Selectional Preferences Induction
Selectional preference (SP) is an important kind of semantic knowledge. It can be used in various natural language processing tasks, including metaphor computing, lexicon building, syntactic structure disambiguation, word sense disambiguation, semantic role labeling, anaphora resolution, etc. This paper presents and compares two computational models for Chinese SP induction, a HowNet-based Sele...
متن کاملSelectional Restrictions in HPSG
Selectional restrictions are semantic sortal constraints imposed on the participants of linguistic constructions to capture contextuallydependent constraints on interpretation. Despite their limitations, selectional restrictions have proven very useful in natural language applications, where they have been used frequently in word sense disambiguation, syntactic disambiguation, and anaphora reso...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001