skip to main content
10.1145/2588555.2610525acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

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

Published:18 June 2014Publication History

ABSTRACT

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.

References

  1. Natural language question answering over rdf. In technique report, omitted due to the double-blind reviewing. Some materials are provided in our response document.Google ScholarGoogle Scholar
  2. I. Androutsopoulos and P. Malakasiotis. A survey of paraphrasing and textual entailment methods. J. Artif. Intell. Res. (JAIR), 38:135--187, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Berant, A. Chou, R. Frostig, and P. Liang. Semantic parsing on freebase from question-answer pairs. In EMNLP, pages 1533--1544, 2013.Google ScholarGoogle Scholar
  4. C. Bizer, J. Lehmann, G. Kobilarov, S. Auer, C. Becker, R. Cyganiak, and S. Hellmann. Dbpedia - a crystallization point for the web of data. J. Web Sem., 7(3):154--165, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. M. Cer, M.-C. de Marneffe, D. Jurafsky, and C. D. Manning. Parsing to stanford dependencies: Trade-offs between speed and accuracy. In LREC, 2010.Google ScholarGoogle Scholar
  6. P. Cimiano, V. Lopez, C. Unger, E. Cabrio, A.-C. N. Ngomo, and S. Walter. Multilingual question answering over linked data (qald-3): Lab overview. In CLEF, pages 321--332, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell., 26(10):1367--1372, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M.-C. de Marneffe and C. D. Manning. Stanford typed dependencies manual.Google ScholarGoogle Scholar
  9. J. Eisner. Three new probabilistic models for dependency parsing: An exploration. In COLING, pages 340--345, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Fader, S. Soderland, and O. Etzioni. Identifying relations for open information extraction. In EMNLP, pages 1535--1545, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102--113, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. G. Ladwig and T. Tran. Combining query translation with query answering for efficient keyword search. In ESWC (2), pages 288--303, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. V. Lopez, C. Unger, P. Cimiano, and E. Motta. Evaluating question answering over linked data. J. Web Sem., 21:3--13, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. K. Losemann and W. Martens. The complexity of regular expressions and property paths in sparql. ACM Trans. Database Syst., 38(4):24, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. D. Manning, P. Raghavan, and H. Schütze. Introduction to Information Retrieval. Cambridge University Press, New York, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. R. Mihalcea and A. Csomai. Wikify!: linking documents to encyclopedic knowledge. In CIKM, pages 233--242, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. N. Nakashole, G. Weikum, and F. M. Suchanek. Discovering and exploring relations on the web. PVLDB, 5(12):1982--1985, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. N. Nakashole, G. Weikum, and F. M. Suchanek. Patty: A taxonomy of relational patterns with semantic types. In EMNLP-CoNLL, pages 1135--1145, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A.-M. Popescu, O. Etzioni, and H. Kautz. Towards a theory of natural language interfaces to databases. In Proceedings of the 8th international conference on Intelligent user interfaces, pages 149--157. ACM, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. D. R. Radev, H. Qi, Z. Zheng, S. Blair-Goldensohn, Z. Zhang, W. Fan, and J. M. Prager. Mining the web for answers to natural language questions. In CIKM, pages 143--150, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. L.-A. Ratinov, D. Roth, D. Downey, and M. Anderson. Local and global algorithms for disambiguation to wikipedia. In ACL, pages 1375--1384, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. D. Ravichandran and E. Hovy. Learning surface text patterns for a question answering system. In Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, ACL '02, pages 41--47, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. U. Sawant and S. Chakrabarti. Learning joint query interpretation and response ranking. In WWW, pages 1099--1110, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. R. F. Simmons. Natural language question-answering systems: 1969. Commun. ACM, 13(1):15--30, Jan. 1970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. W. M. Soon, H. T. Ng, and D. C. Y. Lim. A machine learning approach to coreference resolution of noun phrases. Comput. Linguist., 27(4):521--544, 2001. Google ScholarGoogle ScholarCross RefCross Ref
  26. Z. Sun, H. Wang, H. Wang, B. Shao, and J. Li. Efficient subgraph matching on billion node graphs. PVLDB, 5(9):788--799, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. C. Unger, L. Bühmann, J. Lehmann, A.-C. N. Ngomo, D. Gerber, and P. Cimiano. Template-based question answering over rdf data. In WWW, pages 639--648, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Y. Wu, C. Hori, H. Kawai, and H. Kashioka. Answering complex questions via exploiting social q&a collection. In IJCNLP, pages 956--964, 2011.Google ScholarGoogle Scholar
  29. M. Yahya, K. Berberich, S. Elbassuoni, M. Ramanath, V. Tresp, and G. Weikum. Natural language questions for the web of data. In EMNLP-CoNLL, pages 379--390, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. M. Yahya, K. Berberich, S. Elbassuoni, and G. Weikum. Robust question answering over the web of linked data. In CIKM, pages 1107--1116, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. W. Zhang, J. Su, C. L. Tan, and W. Wang. Entity linking leveraging automatically generated annotation. In COLING, pages 1290--1298, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. P. Zhao and J. Han. On graph query optimization in large networks. PVLDB, 3(1):340--351, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. L. Zou, J. Mo, L. Chen, M. T. Özsu, and D. Zhao. gstore: Answering sparql queries via subgraph matching. PVLDB, 4(8):482--493, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

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

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data
      June 2014
      1645 pages
      ISBN:9781450323765
      DOI:10.1145/2588555

      Copyright © 2014 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 18 June 2014

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      SIGMOD '14 Paper Acceptance Rate107of421submissions,25%Overall Acceptance Rate785of4,003submissions,20%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader