2012 LargeScaleLearningofWordRelated

From GM-RKB
Jump to navigation Jump to search

Subject Headings:

Notes

Cited By

Quotes

Author Keywords

Abstract

Prior work on computing semantic relatedness of words focused on representing their meaning in isolation, effectively disregarding inter-word affinities. We propose a large-scale data mining approach to learning word-word relatedness, where known pairs of related [[words impose constraint]]s on the learning process. We learn for each word a low-dimensional representation, which strives to maximize the likelihood of a word given the contexts in which it appears. Our method, called CLEAR, is shown to significantly outperform previously published approaches. The proposed method is based on first principles, and is generic enough to exploit diverse types of text corpora, while having the flexibility to impose constraints on the derived word similarities. We also make publicly available a new labeled dataset for evaluating word relatedness algorithms, which we believe to be the largest such dataset to date.

References

;

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2012 LargeScaleLearningofWordRelatedEvgeniy Gabrilovich
Yehuda Koren
Gideon Dror
Guy Halawi
Large-scale Learning of Word Relatedness with Constraints10.1145/2339530.23397512012