Đang chuẩn bị liên kết để tải về tài liệu:
Báo cáo khoa học: "Using lexical and relational similarity to classify semantic relations"

Many methods are available for computing semantic similarity between individual words, but certain NLP tasks require the comparison of word pairs. This paper presents a kernel-based framework for application to relational reasoning tasks of this kind. The model presented here combines information about two distinct types of word pair similarity: lexical similarity and relational similarity. We present an efficient and flexible technique for implementing relational similarity and show the effectiveness of combining lexical and relational models by demonstrating state-ofthe-art results on a compound noun interpretation task. . | Using lexical and relational similarity to classify semantic relations Diarmuid Ó Seaghdha Computer Laboratory University of Cambridge 15 JJ Thomson Avenue Cambridge CB3 0FD United Kingdom do242@cl.cam.ac.uk Abstract Many methods are available for computing semantic similarity between individual words but certain NLP tasks require the comparison of word pairs. This paper presents a kernel-based framework for application to relational reasoning tasks of this kind. The model presented here combines information about two distinct types of word pair similarity lexical similarity and relational similarity. We present an efficient and flexible technique for implementing relational similarity and show the effectiveness of combining lexical and relational models by demonstrating state-of-the-art results on a compound noun interpretation task. 1 Introduction The problem of modelling semantic similarity between words has long attracted the interest of researchers in Natural Language Processing and has been shown to be important for numerous applications. For some tasks however it is more appropriate to consider the problem of modelling similarity between pairs of words. This is the case when dealing with tasks involving relational or analogical reasoning. In such tasks the challenge is to compare pairs of words on the basis of the semantic relation s holding between the members of each pair. For example the noun pairs steel knife and papercup are similar because in both cases the relation N2 is made of N1 frequently holds between their members. Analogical tasks are distinct from but not unrelated to other kinds of relation extraction tasks where each data item is tied to a specific sentence context e.g. Girju et al. 2007 . One such relational reasoning task is the problem of compound noun interpretation which Ann Copestake Computer Laboratory University of Cambridge 15 JJ Thomson Avenue Cambridge CB3 0FD United Kingdom aac10@cl.cam.ac.uk has received a great deal of .