Abstract
Measuring the relational similarity between word pairs is important in numerous natural language processing tasks such as solving word analogy questions, classifying noun-modifier relations and disambiguating word senses. We propose a supervised classification method to measure the similarity between semantic relations that exist between words in two word pairs. First, each pair of words is represented by a vector of automatically extracted lexical patterns. Then a binary Support Vector Machine is trained to recognize word pairs with similar semantic relations to a given word pair. To train and evaluate the proposed method, we use a benchmark dataset that contains 374 SAT multiple-choice word-analogy questions. To represent the relations that exist between two word pairs, we experiment with 11 different feature functions, including both symmetric and asymmetric feature functions. Our experimental results show that the proposed method outperforms several previously proposed relational similarity measures on this benchmark dataset, achieving an SAT score of 46.9.
Original language | English |
---|---|
Pages (from-to) | 2227-2233 |
Number of pages | 7 |
Journal | IEICE Transactions on Information and Systems |
Volume | E94-D |
Issue number | 11 |
DOIs | |
Publication status | Published - 2011 Nov |
Externally published | Yes |
Keywords
- Relational similarity
- Supervised classification
- Support vector machines
- Word analogies
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Software
- Artificial Intelligence
- Hardware and Architecture
- Computer Vision and Pattern Recognition