Natural language question answering over RDF: a graph data driven approach

RDF question/answering (Q/A) allows users to ask questions in natural languages over a knowledge base represented by RDF. To answer a national 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. 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.

[1]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS '01.

[2]  Christopher D. Manning,et al.  Introduction to Information Retrieval , 2010, J. Assoc. Inf. Sci. Technol..

[3]  Doug Downey,et al.  Local and Global Algorithms for Disambiguation to Wikipedia , 2011, ACL.

[4]  Jens Lehmann,et al.  DBpedia - A crystallization point for the Web of Data , 2009, J. Web Semant..

[5]  Gerhard Weikum,et al.  PATTY: A Taxonomy of Relational Patterns with Semantic Types , 2012, EMNLP.

[6]  Ion Androutsopoulos,et al.  A Survey of Paraphrasing and Textual Entailment Methods , 2009, J. Artif. Intell. Res..

[7]  Gerhard Weikum,et al.  Discovering and Exploring Relations on the Web , 2012, Proc. VLDB Endow..

[8]  Andrew Chou,et al.  Semantic Parsing on Freebase from Question-Answer Pairs , 2013, EMNLP.

[9]  Oren Etzioni,et al.  Towards a theory of natural language interfaces to databases , 2003, IUI '03.

[10]  Jiawei Han,et al.  On graph query optimization in large networks , 2010, Proc. VLDB Endow..

[11]  Daniel Jurafsky,et al.  Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy , 2010, LREC.

[12]  Enrico Motta,et al.  Evaluating question answering over linked data , 2013, J. Web Semant..

[13]  Gerhard Weikum,et al.  Natural Language Questions for the Web of Data , 2012, EMNLP.

[14]  Jens Lehmann,et al.  Template-based question answering over RDF data , 2012, WWW.

[15]  Jian Su,et al.  Entity Linking Leveraging Automatically Generated Annotation , 2010, COLING.

[16]  Christopher D. Manning,et al.  Stanford typed dependencies manual , 2010 .

[17]  Leonard Bolc,et al.  Natural language question answering systems , 1980 .

[18]  Gerhard Weikum,et al.  Robust question answering over the web of linked data , 2013, CIKM.

[19]  Hideki Kashioka,et al.  Answering Complex Questions via Exploiting Social Q&A Collection , 2011, IJCNLP.

[20]  Rada Mihalcea,et al.  Wikify!: linking documents to encyclopedic knowledge , 2007, CIKM '07.

[21]  Hwee Tou Ng,et al.  A Machine Learning Approach to Coreference Resolution of Noun Phrases , 2001, CL.

[22]  David L. Waltz.  Natural-Language Question-Answering Systems , 1975 .

[23]  Wim Martens,et al.  The complexity of regular expressions and property paths in SPARQL , 2013, TODS.

[24]  Eduard H. Hovy,et al.  Learning surface text patterns for a Question Answering System , 2002, ACL.

[25]  Oren Etzioni,et al.  Identifying Relations for Open Information Extraction , 2011, EMNLP.

[26]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  Günter Ladwig,et al.  Combining Query Translation with Query Answering for Efficient Keyword Search , 2010, ESWC.

[28]  Lei Zou,et al.  gStore: Answering SPARQL Queries via Subgraph Matching , 2011, Proc. VLDB Endow..

[29]  Robert F. Simmons,et al.  Computational Linguistics Natural Language Question- Answering Systems: 1969 , 2022 .

[30]  Jason Eisner,et al.  Three New Probabilistic Models for Dependency Parsing: An Exploration , 1996, COLING.

[31]  Soumen Chakrabarti,et al.  Learning joint query interpretation and response ranking , 2013, WWW '13.

[32]  Dragomir R. Radev,et al.  Mining the web for answers to natural language questions , 2001, CIKM '01.

[33]  Jianzhong Li,et al.  Efficient Subgraph Matching on Billion Node Graphs , 2012, Proc. VLDB Endow..

[34]  Elena Cabrio,et al.  Multilingual Question Answering over Linked Data (QALD-3): Lab Overview , 2013, CLEF.