earticle

논문검색

An Effective Algorithm for Semantic Similarity Metric of Word Pairs

초록

영어

Semantic similarity is fundamental operation in the field of computational lexical semantics, artificial intelligence and cognitive science. Accurate measurement of semantic similarity between words is crucial. The paper presents an effective algorithm for semantic similarity metric of word pairs. Different from previous work, in the new algorithm not only path length, but also IC values have been taken into account. We evaluate our model on the data set of Rubenstein and Goodenough, which is traditional and widely used. Coefficients of correlation between human ratings of similarity based on seven algorithms are calculated. Experiments show that the coefficient of our proposed algorithm with human judgment is 0.8820, which demonstrate that our new algorithm significantly outperformed others.

목차

Abstract
 1. Introduction
 2. Semantic Similarity Algorithm
  2.1. Path-based Similarity Algorithms
  2.2. Information Content based Similarity Algorithms
 3. A New Algorithm for Semantic Similarity Metric
 4. Evaluation
  4.1. Data Set
  4.2. Words Similarity Calculating Method
  4.3. Results Analysis
 5. Conclusion and Future Work
 References

저자정보

  • Lingling Meng Computer Science and Technology Department, Department of Educational Information Technology, East China Normal University, Shanghai, 200062, China
  • Runqing Huang Shanghai Municipal People's Government, Shanghai, 200003, China
  • Junzhong Gu Computer Science and Technology Department, East China Normal University, Shanghai, 200062, China

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.