skip to main content
10.1145/2806416.2806616acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
short-paper

Large-Scale Question Answering with Joint Embedding and Proof Tree Decoding

Published:17 October 2015Publication History

ABSTRACT

Question answering (QA) over a large-scale knowledge base (KB) such as Freebase is an important natural language processing application. There are linguistically oriented semantic parsing techniques and machine learning motivated statistical methods. Both of these approaches face a key challenge on how to handle diverse ways natural questions can be expressed about predicates and entities in the KB. This paper is to investigate how to combine these two approaches. We frame the problem from a proof-theoretic perspective, and formulate it as a proof tree search problem that seamlessly unifies semantic parsing, logic reasoning, and answer ranking. We combine our word entity joint embedding learned from web-scale data with other surface-form features to further boost accuracy improvements. Our real-time system on the Freebase QA task achieved a very high F1 score (47.2) on the standard Stanford WebQuestions benchmark test data.

References

  1. G. Andrew and J. Gao. 2010. Scalable training of L1-regularized log-linear models. In Proceedings of the 24th International Conference on Machine Learning, pages 33--40. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Bao, N. Duan, M. Zhou, T. Zhao. 2014. Knowledge-Based Question Answering as Machine Translation. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics, pages 967--976.Google ScholarGoogle ScholarCross RefCross Ref
  3. J. Berant, A. Chou, R. Frostig, and P. Liang. 2013. Semantic parsing on Freebase from question-answer pairs. In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, pages 1533--1544.Google ScholarGoogle Scholar
  4. J. Berant and P. Liang. 2014. Semantic Parsing via Paraphrasing. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics, pages 1415--1425.Google ScholarGoogle Scholar
  5. K. Bollacker, C. Evans, P. Paritosh, T. Sturge, and J. Taylor. 2008. Freebase: A Collaboratively Created Graph Database for Structuring Human Knowledge. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pages 1247--1249. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Bordes, J. Weston, and N. Usunier. 2014a. Open Question Answering with Weakly Supervised Embedding Models. In Proceedings of the 7th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD'14), pages 165--180. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Bordes, S. Chopra, and J. Weston. 2014b. Question Answering with Subgraph Embeddings. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 615--620.Google ScholarGoogle Scholar
  8. Q. Cai. and A. Yates. 2013. Large-Scale Semantic Parsing via Schema Matching and Lexicon Extension. In Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, pages 423--433.Google ScholarGoogle Scholar
  9. Z. Chen, J. Sun, and X. Huang. 2014. Web Information at Your Fingertips: Paper as an Interaction Metaphor. In Computer, pages 62--66. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Fader, L. Zettlemoyer, and O. Etzioni. 2013. Paraphrase-driven learning for open question answering. In Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, pages 1608--1618.Google ScholarGoogle Scholar
  11. X. Huang, J. Baker, and R. Reddy. 2014. A Historical Perspective of Speech Recognition. In Communications of the ACM, 57 (1), pages 94--103. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. O. Kolomiyets and M.-F. Moens. 2011. A survey on question answering technology from an information retrieval perspective. In Information Sciences, 181(24), pages 5412--5434. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. T. Kwiatkowski, E. Choi, Y. Artzi, and L. Zettlemoyer. 2013. Scaling semantic parsers with on-the-fly ontology matching. In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, pages 1545--1556.Google ScholarGoogle Scholar
  14. R. Mooney. 2014. Semantic Parsing, Past, Present and Future, In ACL 2014 Workshop on Semantic Parsing, Invited Talk.Google ScholarGoogle Scholar
  15. J. R. Pierce. 1980. An Introduction to Information Theory: Symbols, Signals and Noise, Dover Books on Mathematics, Dover Publications.Google ScholarGoogle Scholar
  16. M. Steedman. 2014. Robust Semantics of Semantic Parsing, In ACL 2014 Workshop on Semantic Parsing, Invited Talk.Google ScholarGoogle Scholar
  17. S. Wan, M. Dras, R. Dale, and C. Paris. 2006. Using dependency-based features to take the "para-farce" out of paraphrase. In Australasian Language Technology Workshop.Google ScholarGoogle Scholar
  18. Z. Wang, S. Yang, H. Wang, and X. Huang. 2014. An Overview of Microsoft Deep QA System on Stanford WebQuestions Benchmark. Microsoft Research Technical Report MSR-TR-2014-121Google ScholarGoogle Scholar
  19. X. Yao and B. Van Durme. 2014a. Information Extraction over Structured Data: Question Answering with Freebase. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics, pages 956--966.Google ScholarGoogle Scholar
  20. X. Yao, J. Berant, and B. Van Durme. 2014b. Freebase QA: Information Extraction or Semantic Parsing? In Proceedings of the ACL 2014 Workshop on Semantic Parsing, pages 82--86.Google ScholarGoogle Scholar
  21. L. Zettlemoyer and M. Collins. 2005. Learning to map sentences to logical form: structured classification with probabilistic categorial grammars. In Proceedings of the Twenty First Conference on Uncertainty in Artificial Intelligence, pages 658--666.Google ScholarGoogle Scholar

Index Terms

  1. Large-Scale Question Answering with Joint Embedding and Proof Tree Decoding

          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
            CIKM '15: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management
            October 2015
            1998 pages
            ISBN:9781450337946
            DOI:10.1145/2806416

            Copyright © 2015 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: 17 October 2015

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • short-paper

            Acceptance Rates

            CIKM '15 Paper Acceptance Rate165of646submissions,26%Overall Acceptance Rate1,861of8,427submissions,22%

            Upcoming Conference

          • Article Metrics

            • Downloads (Last 12 months)0
            • Downloads (Last 6 weeks)0

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader