Measuring the Similarity between Implicit Semantic Relations from the Web (2009)
Cached
Download Links
| Venue: | WWW 2009 MADRID! TRACK: SEMANTIC/DATA WEB / SESSION: MINING FOR SEMANTICS |
| Citations: | 7 - 6 self |
BibTeX
@MISC{Bollegala09measuringthe,
author = {Danushka Bollegala and Yutaka Matsuo and Mitsuru Ishizuka},
title = { Measuring the Similarity between Implicit Semantic Relations from the Web},
year = {2009}
}
OpenURL
Abstract
Measuring the similarity between semantic relations that hold among entities is an important and necessary step in various Web related tasks such as relation extraction, information retrieval and analogy detection. For example, consider the case in which a person knows a pair of entities (e.g. Google, YouTube), between which a particular relation holds (e.g. acquisition). The person is interested in retrieving other such pairs with similar relations (e.g. Microsoft, Powerset). Existing keyword-based search engines cannot be applied directly in this case because, in keyword-based search, the goal is to retrieve documents that are relevant to the words used in a query – not necessarily to the relations implied by a pair of words. We propose a relational similarity measure, using a Web search engine, to compute the similarity between semantic relations implied by two pairs of words. Our method has three components: representing







