Searching Software Knowledge Graph with Question

被引:7
|
作者
Wang, Min [1 ,2 ]
Zou, Yanzhen [1 ,2 ]
Cao, Yingkui [1 ,2 ]
Xie, Bing [1 ,2 ]
机构
[1] Peking Univ, Key Lab High Confidence Software Technol, Minist Educ, Beijing 100871, Peoples R China
[2] Peking Univ, Sch Elect Engn & Comp Sci, Beijing 100871, Peoples R China
来源
REUSE IN THE BIG DATA ERA | 2019年 / 11602卷
关键词
Software reuse; Knowledge repository; Knowledge graph; Natural language search; Graph search;
D O I
10.1007/978-3-030-22888-0_9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Researchers have constructed a variety of knowledge repositories/bases in different domains. These knowledge repositories generally use graph database (Neo4j) to manage heterogeneous and widely related domain data, which providing structured query (i.e., Cypher) interfaces. However, it is time-consuming and labor-intensive to construct a structured query especially when the query is very complex or the scale of the knowledge graph is large. This paper presents a natural language question interface for software knowledge graph. It extracts meta-model of software knowledge repository, constructs question related Inference Sub-Graph, then automatically transfers natural language question to structured Cypher query and returns the corresponding answer. We carry out our experiments on two famous open source software projects, build their knowledge graphs and verify our approach can accurately answer almost all the questions on the corresponding knowledge graph.
引用
收藏
页码:115 / 131
页数:17
相关论文
共 50 条
  • [1] Question Formulation and Question Answering for Knowledge Graph Completion
    Khvalchik, Maria
    Blaschke, Christian
    Revenko, Artem
    DATABASE AND EXPERT SYSTEMS APPLICATIONS (DEXA 2019), 2019, 1062 : 166 - 171
  • [2] Knowledge Graph Based Question Routing for Community Question Answering
    Liu, Zhu
    Li, Kan
    Qu, Dacheng
    NEURAL INFORMATION PROCESSING, ICONIP 2017, PT V, 2017, 10638 : 721 - 730
  • [3] Approach to Searching Software Source Code with Graph Embedding
    Ling C.-Y.
    Zou Y.-Z.
    Lin Z.-Q.
    Xie B.
    Zhao J.-F.
    Ruan Jian Xue Bao/Journal of Software, 2019, 30 (05): : 1481 - 1497
  • [4] Knowledge graph question answering based on TE-BiLTM and knowledge graph embedding
    Li, Jianbin
    Qu, Ketong
    Li, Kunchang
    Chen, Zhiqiang
    Fang, Suwan
    Yan, Jingchen
    2021 5TH INTERNATIONAL CONFERENCE ON INNOVATION IN ARTIFICIAL INTELLIGENCE (ICIAI 2021), 2021, : 164 - 169
  • [5] A knowledge inference model for question answering on an incomplete knowledge graph
    Guo, Qimeng
    Wang, Xue
    Zhu, Zhenfang
    Liu, Peiyu
    Xu, Liancheng
    APPLIED INTELLIGENCE, 2023, 53 (07) : 7634 - 7646
  • [6] A knowledge inference model for question answering on an incomplete knowledge graph
    Qimeng Guo
    Xue Wang
    Zhenfang Zhu
    Peiyu Liu
    Liancheng Xu
    Applied Intelligence, 2023, 53 : 7634 - 7646
  • [7] Knowledge Graph Embedding Based Question Answering
    Huang, Xiao
    Zhang, Jingyuan
    Li, Dingcheng
    Li, Ping
    PROCEEDINGS OF THE TWELFTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM'19), 2019, : 105 - 113
  • [8] LAUREN - Knowledge Graph Summarization for Question Answering
    Jalota, Rricha
    Vollmers, Daniel
    Moussallem, Diego
    Ngomo, Axel-Cyrille Ngonga
    2021 IEEE 15TH INTERNATIONAL CONFERENCE ON SEMANTIC COMPUTING (ICSC 2021), 2021, : 221 - 226
  • [9] Joint Knowledge Graph Completion and Question Answering
    Liu, Lihui
    Du, Boxin
    Xu, Jiejun
    Xia, Yinglong
    Tong, Hanghang
    PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 1098 - 1108
  • [10] Variational Reasoning for Question Answering with Knowledge Graph
    Zhang, Yuyu
    Dai, Hanjun
    Kozareva, Zornitsa
    Smola, Alexander J.
    Song, Le
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 6069 - 6076