Table of Content

Open Access iconOpen Access


A Longest Matching Resource Mapping Algorithm with State Compression Dynamic Programming Optimization

Zhang Min, Teng Haibin, Jiang Ming, Wen Tao, Tang Jingfan

School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, 310018, China

* Corresponding Author: Zhang Min, email

Intelligent Automation & Soft Computing 2019, 25(3), 625-635.


Mapping from sentence phrases to knowledge graph resources is an important step for applications such as search engines, automatic question answering systems based on acknowledge base and knowledge graphs. The existing solution maps a simple phrase to a knowledge graph resource strictly or approximately from the text. However, it is difficult to detect phrases and map the composite semantic resource. This paper proposes a longest matching resource mapping scheme to solve this problem, namely, to find the longest substring in a sentence that can match the knowledge base resource. Based on this scheme, we propose an optimization algorithm based on state compression dynamic programming. Furthermore, we improve the operating efficiency by removing invalid states. Experimental results show that our proposed optimization algorithm considerably improves the efficiency of the benchmark algorithm in terms of running time.


Cite This Article

Z. Min, T. Haibin, J. Ming, W. Tao and T. Jingfan, "A longest matching resource mapping algorithm with state compression dynamic programming optimization," Intelligent Automation & Soft Computing, vol. 25, no.3, pp. 625–635, 2019.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1294


  • 898


  • 0


Share Link