Short text similarity based on probabilistic topics

  • Authors:
  • Xiaojun Quan;Gang Liu;Zhi Lu;Xingliang Ni;Liu Wenyin

  • Affiliations:
  • City University of Hong Kong, Department of Computer Science, Hong Kong SAR, China;City University of Hong Kong, Department of Computer Science, Hong Kong SAR, China;City University of Hong Kong, Department of Computer Science, Hong Kong SAR, China;University of Science and Technology of China, Department of Computer Science and Technology, Hefei, China and CityU-USTC Advanced Research Institute, Joint Research Lab of Excellence, Suzhou, Chi ...;City University of Hong Kong, Department of Computer Science, Hong Kong SAR, China and CityU-USTC Advanced Research Institute, Joint Research Lab of Excellence, Suzhou, China

  • Venue:
  • Knowledge and Information Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a new method for measuring the similarity between two short text snippets by comparing each of them with the probabilistic topics. Specifically, our method starts by firstly finding the distinguishing terms between the two short text snippets and comparing them with a series of probabilistic topics, extracted by Gibbs sampling algorithm. The relationship between the distinguishing terms of the short text snippets can be discovered by examining their probabilities under each topic. The similarity between two short text snippets is calculated based on their common terms and the relationship of their distinguishing terms. Extensive experiments on paraphrasing and question categorization show that the proposed method can calculate the similarity of short text snippets more accurately than other methods including the pure TF-IDF measure.