Applying VSM and LCS to develop an integrated text retrieval mechanism

  • Authors:
  • Cheng-Shiun Tasi;Yong-Ming Huang;Chien-Hung Liu;Yueh-Min Huang

  • Affiliations:
  • Department of Engineering Science, National Cheng Kung University, No. 1 Ta-Hsueh Road, Tainan 701, Taiwan, ROC;Department of Engineering Science, National Cheng Kung University, No. 1 Ta-Hsueh Road, Tainan 701, Taiwan, ROC;Department of Network Multimedia Design, Hsing Kuo University of Management, No. 600, Sec. 3, Taijiang Blvd., Tainan 709, Taiwan, ROC;Department of Engineering Science, National Cheng Kung University, No. 1 Ta-Hsueh Road, Tainan 701, Taiwan, ROC

  • Venue:
  • Expert Systems with Applications: An International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 12.05

Visualization

Abstract

Text retrieval has received a lot of attention in computer science. In the text retrieval field, the most widely-adopted similarity technique is using vector space models (VSM) to evaluate the weight of terms and using Cosine, Jaccard or Dice to measure the similarity between the query and the texts. However, these similarity techniques do not consider the effect of the sequence of the information. In this paper, we propose an integrated text retrieval (ITR) mechanism that takes the advantage of both VSM and longest common subsequence (LCS) algorithm. The key idea of the ITR mechanism is to use LCS to re-evaluate the weight of terms, so that the sequence and weight relationships between the query and the texts can be considered simultaneously. The results of mathematical analysis show that the ITR mechanism can increase the similarity on Jaccard and Dice similarity measurements when a sequential relationship exists between the query and the texts.