Abstract
Chinese Knowledge Base Question Answering (CKBQA) aims to predict answers for Chinese natural language questions by reasoning over facts in the knowledge base. In recent years, more attention has been paid to complex problems in KBQA, including multi-hop questions, multi-entity constrained questions, and questions with filtering or ordering. To this end, in this paper, we propose a KBQA system to generate logic forms and retrieve answers for different types of complex questions. For the single-hop and multi-hop questions, which account for the largest proportion among all questions, we propose a novel path construction method that converts the path construction task into a hop-by-hop relation extraction task via text matching. Our method combines the advantages of both the relation extraction and path ranking methods, which can focus on the order of entity-relations as well as alleviate the problem of exponential growth of candidate paths with the number of hops. Our proposed method achieves the averaged F1-score of 75.70% on the final leaderboard of CCKS-2022 CKBQA task.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
References
Berant, J., Liang, P.: Semantic parsing via paraphrasing. In: Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics, pp. 1415–1425. The Association for Computer Linguistics (2014). https://doi.org/10.3115/v1/p14-1133
Chen, Y., Li, H., Hua, Y., Qi, G.: Formal query building with query structure prediction for complex question answering over knowledge base. In: Bessiere, C. (ed.) Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, pp. 3751–3758. International Joint Conferences on Artificial Intelligence Organization (2020). https://doi.org/10.24963/ijcai.2020/519
Chen, Z., Chang, C., Chen, Y., Nayak, J., Ku, L.: UHop: an unrestricted-hop relation extraction framework for knowledge-based question answering. In: Burstein, J., Doran, C., Solorio, T. (eds.) Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 345–356. Association for Computational Linguistics (2019). https://doi.org/10.18653/v1/n19-1031
He, G., Lan, Y., Jiang, J., Zhao, W.X., Wen, J.: Improving multi-hop knowledge base question answering by learning intermediate supervision signals. In: Lewin-Eytan, L., Carmel, D., Yom-Tov, E., Agichtein, E., Gabrilovich, E. (eds.) Proceedings of the Fourteenth ACM International Conference on Web Search and Data Mining, pp. 553–561. ACM (2021). https://doi.org/10.1145/3437963.3441753
Lan, Y., Jiang, J.: Query graph generation for answering multi-hop complex questions from knowledge bases. In: Jurafsky, D., Chai, J., Schluter, N., Tetreault, J.R. (eds.) Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, pp. 969–974. Association for Computational Linguistics (2020). https://doi.org/10.18653/v1/2020.acl-main.91
Li, Z., Wang, H., Zhang, W.: Translational relation embeddings for multi-hop knowledge base question answering. J. Web Semant. 74, 100723 (2022)
Lin, F., et al.: Knowledge-enhanced retrieval: a scheme for question answering. In: Qin, B., Wang, H., Liu, M., Zhang, J. (eds.) CCKS 2021 - Evaluation Track. CCKS 2021. CCIS, vol. 1553, pp. 102–113. Springer (2021). https://doi.org/10.1007/978-981-19-0713-5_12
Saxena, A., Tripathi, A., Talukdar, P.P.: Improving multi-hop question answering over knowledge graphs using knowledge base embeddings. In: Jurafsky, D., Chai, J., Schluter, N., Tetreault, J.R. (eds.) Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, pp. 4498–4507. Association for Computational Linguistics (2020). https://doi.org/10.18653/v1/2020.acl-main.412
Sun, Y., Zhang, L., Cheng, G., Qu, Y.: SPARQA: skeleton-based semantic parsing for complex questions over knowledge bases. In: Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, pp. 8952–8959. AAAI Press (2020)
Yang, Y., Chang, M.: S-MART: novel tree-based structured learning algorithms applied to tweet entity linking (2016)
Yu, M., Yin, W., Hasan, K.S., dos Santos, C.N., Xiang, B., Zhou, B.: Improved neural relation detection for knowledge base question answering. In: Barzilay, R., Kan, M. (eds.) Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, pp. 571–581. Association for Computational Linguistics (2017). https://doi.org/10.18653/v1/P17-1053
Zhen, S., Yi, X., Lin, Z., Xiao, W., Su, H., Liu, Y.: An integrated method of semantic parsing and information retrieval for knowledge base question answering. In: Qin, B., Wang, H., Liu, M., Zhang, J. (eds.) CCKS 2021 - Evaluation Track. CCKS 2021. CCIS, vol. 1553, pp. 44–51. Springer (2021). https://doi.org/10.1007/978-981-19-0713-5_6
Acknowledgments
This work is supported by the National Natural Science Foundation of China (No. 62176185) and the Fundamental Research Funds for the Central Universities (No. 22120220069).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Li, Z., Ni, K., Wang, H., Zhang, W. (2022). Relation Extraction as Text Matching: A Scheme for Multi-hop Knowledge Base Question Answering. In: Zhang, N., Wang, M., Wu, T., Hu, W., Deng, S. (eds) CCKS 2022 - Evaluation Track. CCKS 2022. Communications in Computer and Information Science, vol 1711. Springer, Singapore. https://doi.org/10.1007/978-981-19-8300-9_21
Download citation
DOI: https://doi.org/10.1007/978-981-19-8300-9_21
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-8299-6
Online ISBN: 978-981-19-8300-9
eBook Packages: Computer ScienceComputer Science (R0)