The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Answering Natural Language Questions by Subgraph Matching over Knowledge Graphs
Abstract
RDF question/answering (Q/A) allows users to ask questions in natural languages over a knowledge base represented by RDF. To answer a natural language question, the existing work takes a two-stage approach: question understanding and query evaluation. Their focus is on question understanding to deal with the disambiguation of the natural language phrases. The most common technique is the joint disambiguation, which has the exponential search space. In this paper, we propose a systematic framework to answer natural language questions over RDF repository (RDF Q/A) from a graph data-driven perspective. We propose a semantic query graph to model the query intention in the natural language question in a structural way, based on which, RDF Q/A is reduced to subgraph matching problem. More importantly, we resolve the ambiguity of natural language questions at the time when matches of query are found. The cost of disambiguation is saved if there are no matching found. More specifically, we propose two different frameworks to build the semantic query graph, one is relation (edge)-first and the other one is node-first. We compare our method with some state-of-the-art RDF Q/A systems in the benchmark dataset. Extensive experiments confirm that our method not only improves the precision but also speeds up query performance greatly.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Introduction to Information Retrieval
Manning, C. D., Raghavan, P., & Schütze, H. (2008) · doi:10.1017/cbo9780511809071 · Cited by 11,288
Optimizing search engines using clickthrough data
Joachims, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775067 · Cited by 3,873
DBpedia - A crystallization point for the Web of Data
Bizer, C., Lehmann, J., Kobilarov, G., Auer, S., Becker, C., Cyganiak, R., & Hellmann, S. (2009) · Journal of Web Semantics · doi:10.1016/j.websem.2009.07.002 · Cited by 2,137
Semantic Parsing on Freebase from Question-Answer Pairs
Berant, J., Chou, A., Frostig, R., & Liang, P. (2013) · Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d13-1160 · Cited by 1,517
Identifying Relations for Open Information Extraction
Fader, A., Soderland, S. G., & Etzioni, O. (2011) · Cited by 1,144
A Machine Learning Approach to Coreference Resolution of Noun Phrases
Soon, W. M., Ng, H. T., & Lim, D. C. Y. (2001) · Computational Linguistics · doi:10.1162/089120101753342653 · Cited by 982
Semantic Parsing via Staged Query Graph Generation: Question Answering with Knowledge Base
Yih, W.-T., Chang, M.-W., He, X., & Gao, J. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1128 · Cited by 756
Stanford typed dependencies manual
de Marnee, M.-C., & Manning, C. D. (2010) · Cited by 717
Question Answering with Subgraph Embeddings
Bordes, A., Chopra, S., & Weston, J. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1067 · Cited by 635
Cited by
Learning Knowledge Graph Embedding With Heterogeneous Relation Attention Networks
Li, Z., Liu, H., Zhang, Z., Liu, T., & Xiong, N. N. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3055147 · Cited by 345
A survey on the development status and application prospects of knowledge graph in smart grids
Wang, J., Wang, X., Ma, C., & Kou, L. (2021) · IET Generation, Transmission & Distribution · doi:10.1049/gtd2.12040 · Cited by 111
Knowledge Graph Quality Management: a Comprehensive Survey
Xue, B., & Zou, L. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3150080 · Cited by 108
Self-citationHierarchical Query Graph Generation for Complex Question Answering over Knowledge Graph
Qiu, Y., Zhang, K., Wang, Y., Jin, X., Bai, L., Guan, S., & Cheng, X. (2020) · Proceedings of the 29th ACM International Conference on Information & Knowledge Management · doi:10.1145/3340531.3411888 · Cited by 52
Chen, Y., Li, H., Qi, G., Wu, T., & Wang, T. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3207477 · Cited by 41
Metadata
- Authors
- Hu, S., Zou, L., Yu, J. X., Wang, H., & Zhao, D.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2018-05-01
- Volume
- 30
- Issue
- 5
- Pages
- 824-837
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2766317792
- Cited by
- 271
- References
- 28
- FWCI
- 11.81
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Answering Natural Language Questions by Subgraph Matching over Knowledge Graphs. https://app.cochat.ai/papers/10.1109/tkde.2017.2766634
- The paper
- Hu, S., Zou, L., Yu, J. X., Wang, H., & Zhao, D. (2018). Answering Natural Language Questions by Subgraph Matching over Knowledge Graphs. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2017.2766634
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.