期刊文献+

New Information Distance Measure and Its Application in Question Answering System 被引量:3

New Information Distance Measure and Its Application in Question Answering System
原文传递
导出
摘要 In a question answering (QA) system, the fundamental problem is how to measure the distance between a question and an answer, hence ranking different answers. We demonstrate that such a distance can be precisely and mathematically defined. Not only such a definition is possible, it is actually provably better than any other feasible definitions. Not only such an ultimate definition is possible, but also it can be conveniently and fruitfully applied to construct a QA system. We have built such a system -- QUANTA. Extensive experiments are conducted to justify the new theory. In a question answering (QA) system, the fundamental problem is how to measure the distance between a question and an answer, hence ranking different answers. We demonstrate that such a distance can be precisely and mathematically defined. Not only such a definition is possible, it is actually provably better than any other feasible definitions. Not only such an ultimate definition is possible, but also it can be conveniently and fruitfully applied to construct a QA system. We have built such a system -- QUANTA. Extensive experiments are conducted to justify the new theory.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2008年第4期557-572,共16页 计算机科学技术学报(英文版)
基金 the National Natural Science Foundation of China under Grant Nos.60572084 and 60621062.
关键词 information distance normalized information distance question answering system information distance, normalized information distance, question answering system
  • 相关文献

参考文献47

  • 1Tan P N, Kumar V, Srivastava J. Selecting the right interestingness measure for association patterns. In Proc. SIGKDD'02, Edmonton, Alberta, Canada, pp.32-44.
  • 2Bennett C H, Gacs P, Li M, Vitanyi P, Zurek W. Information distance. IEEE Trans. Inform. Theory (STOC'93), July 1998, 44(4): 1407-1423.
  • 3Li M, Badger J, Chen X, Kwong S, Kearney P, Zhang H. An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics, 2001, 17(2): 149-154.
  • 4Li M, Chen X, Li X, Ma B, Vitanyi P. The similarity metric. IEEE Trans. Information Theory, 2004, 50(12): 3250-3264.
  • 5Li M, Vitanyi P. An Introduction to Kolmogorov Complexity and Its Applications. 2nd Edition, Springer-Verlag, 1997.
  • 6V'yugin M V. Information distance and conditional complexities. Theoret. Comput. Sci., 2002, 271: 145-150.
  • 7Vereshchagin N K, V'yugin M V. Independent minimum length programs to translate between given strings. Theoret. Comput. Sci., 2002, 271: 131-143.
  • 8Shen A K, Vereshchagin N K. Logical operations and Kolmogorov complexity. Theoret. Comput. Sci., 2002, 271: 125-129.
  • 9An A Muchnik, N Vereshchagin. Shannon entropy vs. Kolmogorov complexity. In Porc. First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, pp.281-191.
  • 10Muchnik An A. Conditional complexity and codes. Theoretical Computer Science, 2002, 271(1): 97-109.

同被引文献12

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部