Journal of Jilin University Science Edition

Previous Articles     Next Articles

Ambiguity Resolution Algorithm for Mapping from Natural Language to SPARQL Languege

DONG Liyan1, ZHANG Gaoxiang1, SUN Bo1, LANG Yining2   

  1. 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China;2. School of Computer Science & Technology, Beijing Institute of Technology, Beijing 100081, China
  • Received:2015-12-18 Online:2016-05-26 Published:2016-05-20
  • Contact: ZHANG Gaoxiang E-mail:85192510@qq.com

Abstract:

Aiming at the problem of non ambiguity mapping between computer languages, we proposed an ambiguity resolution algorithm for mapping from natural language to SPARQL language. The algorithm was based on the characteristics of natural language, fitting quantity of facts and the text similarity to resolve ambiguity in the process of entity mapping, fitting the text similarity and the semanticsweight of relation to resolve the ambiguity in the process of relation mapping. Experimental results show that the algorithm is effective.

Key words: ambiguity resolution, text similarity, quantity of facts; , semanticsweight of relation

CLC Number: 

  • TP391