TY - GEN
T1 - Natural language question/answering
T2 - 26th ACM International Conference on Information and Knowledge Management, CIKM 2017
AU - Zheng, Weiguo
AU - Cheng, Hong
AU - Zou, Lei
AU - Yu, Jeffrey Xu
AU - Zhao, Kangfei
N1 - Publisher Copyright:
© 2017 Association for Computing Machinery.
PY - 2017/11/6
Y1 - 2017/11/6
N2 - The ever-increasing knowledge graphs impose an urgent demand of providing effective and easy-to-use query techniques for end users. Structured query languages, such as SPARQL, offer a powerful expression ability to query RDF datasets. However, they are difficult to use. Keywords are simple but have a very limited expression ability. Natural language question (NLQ) is promising on querying knowledge graphs. A huge challenge is how to understand the question clearly so as to translate the unstructured question into a structured query. In this paper, we present a data + oracle approach to answer NLQs over knowledge graphs. We let users verify the ambiguities during the query understanding. To reduce the interaction cost, we formalize an interaction problem and design an efficient strategy to solve the problem. We also propose a query prefetch technique by exploiting the latency in the interactions with users. Extensive experiments over the QALD dataset demonstrate that our proposed approach is effective as it outperforms state-of-the-art methods in terms of both precision and recall.
AB - The ever-increasing knowledge graphs impose an urgent demand of providing effective and easy-to-use query techniques for end users. Structured query languages, such as SPARQL, offer a powerful expression ability to query RDF datasets. However, they are difficult to use. Keywords are simple but have a very limited expression ability. Natural language question (NLQ) is promising on querying knowledge graphs. A huge challenge is how to understand the question clearly so as to translate the unstructured question into a structured query. In this paper, we present a data + oracle approach to answer NLQs over knowledge graphs. We let users verify the ambiguities during the query understanding. To reduce the interaction cost, we formalize an interaction problem and design an efficient strategy to solve the problem. We also propose a query prefetch technique by exploiting the latency in the interactions with users. Extensive experiments over the QALD dataset demonstrate that our proposed approach is effective as it outperforms state-of-the-art methods in terms of both precision and recall.
KW - Interactive query
KW - Knowledge graph
KW - Natural language question and answering
UR - https://www.scopus.com/pages/publications/85037374580
U2 - 10.1145/3132847.3132977
DO - 10.1145/3132847.3132977
M3 - Conference contribution
AN - SCOPUS:85037374580
T3 - International Conference on Information and Knowledge Management, Proceedings
SP - 217
EP - 226
BT - CIKM 2017 - Proceedings of the 2017 ACM Conference on Information and Knowledge Management
PB - Association for Computing Machinery
Y2 - 6 November 2017 through 10 November 2017
ER -