Reading Report: Open QA Systems

Slides:



Advertisements
Similar presentations
Knowledge Base Completion via Search-Based Question Answering
Advertisements

Proceedings of the Conference on Intelligent Text Processing and Computational Linguistics (CICLing-2007) Learning for Semantic Parsing Advisor: Hsin-His.
Recognizing Textual Entailment Challenge PASCAL Suleiman BaniHani.
SEARCHING QUESTION AND ANSWER ARCHIVES Dr. Jiwoon Jeon Presented by CHARANYA VENKATESH KUMAR.
1 Unsupervised Semantic Parsing Hoifung Poon and Pedro Domingos EMNLP 2009 Best Paper Award Speaker: Hao Xiong.
Global Learning of Type Entailment Rules Jonathan Berant, Ido Dagan, Jacob Goldberger June 21 st, 2011.
Robust Textual Inference via Graph Matching Aria Haghighi Andrew Ng Christopher Manning.
C. Varela; Adapted w/permission from S. Haridi and P. Van Roy1 Declarative Computation Model Defining practical programming languages Carlos Varela RPI.
© Prentice Hall1 DATA MINING TECHNIQUES Introductory and Advanced Topics Eamonn Keogh (some slides adapted from) Margaret Dunham Dr. M.H.Dunham, Data Mining,
An Overview of Text Mining Rebecca Hwa 4/25/2002 References M. Hearst, “Untangling Text Data Mining,” in the Proceedings of the 37 th Annual Meeting of.
Knowledge Base Who is Justin Bieber’s sister? semantic parsing query inference Jazmyn Bieber.
Enhance legal retrieval applications with an automatically induced knowledge base Ka Kan Lo.
AQUAINT Kickoff Meeting – December 2001 Integrating Robust Semantics, Event Detection, Information Fusion, and Summarization for Multimedia Question Answering.
Empirical Methods in Information Extraction Claire Cardie Appeared in AI Magazine, 18:4, Summarized by Seong-Bae Park.
Processing of large document collections Part 10 (Information extraction: multilingual IE, IE from web, IE from semi-structured data) Helena Ahonen-Myka.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Author: William Tunstall-Pedoe Presenter: Bahareh Sarrafzadeh CS 886 Spring 2015.
Knowledge and Tree-Edits in Learnable Entailment Proofs Asher Stern, Amnon Lotan, Shachar Mirkin, Eyal Shnarch, Lili Kotlerman, Jonathan Berant and Ido.
GLOSSARY COMPILATION Alex Kotov (akotov2) Hanna Zhong (hzhong) Hoa Nguyen (hnguyen4) Zhenyu Yang (zyang2)
Data Mining – A First View Roiger & Geatz. Definition Data mining is the process of employing one or more computer learning techniques to automatically.
Crowdsourcing Inference-Rule Evaluation Naomi Zeichner, Jonathan Berant, Ido Dagan Crowdsourcing Inference-Rule Evaluation Naomi Zeichner, Jonathan Berant,
Data Mining Chapter 1 Introduction -- Basic Data Mining Tasks -- Related Concepts -- Data Mining Techniques.
RELATIONAL FAULT TOLERANT INTERFACE TO HETEROGENEOUS DISTRIBUTED DATABASES Prof. Osama Abulnaja Afraa Khalifah
Searching for Common Sense: Populating Cyc from the Web Presented by Yu-Chung Shen 2007/05/03.
Markov Logic and Deep Networks Pedro Domingos Dept. of Computer Science & Eng. University of Washington.
Query Execution Section 15.1 Shweta Athalye CS257: Database Systems ID: 118 Section 1.
Chapter 5: Business Intelligence: Data Warehousing, Data Acquisition, Data Mining, Business Analytics, and Visualization DECISION SUPPORT SYSTEMS AND BUSINESS.
LOGO 1 Corroborate and Learn Facts from the Web Advisor : Dr. Koh Jia-Ling Speaker : Tu Yi-Lang Date : Shubin Zhao, Jonathan Betz (KDD '07 )
DATA MINING By Cecilia Parng CS 157B.
Building a Semantic Parser Overnight
Automatic Question Answering  Introduction  Factoid Based Question Answering.
For Friday Finish chapter 23 Homework –Chapter 23, exercise 15.
1 Question Answering and Logistics. 2 Class Logistics  Comments on proposals will be returned next week and may be available as early as Monday  Look.
© University of Manchester Creative Commons Attribution-NonCommercial 3.0 unported 3.0 license Quality Assurance, Ontology Engineering, and Semantic Interoperability.
Jon Juett April 21,  Selected very recent papers  Includes some student level event / conference papers  UM Health Counseling Program  Correctly.
NTNU Speech Lab 1 Topic Themes for Multi-Document Summarization Sanda Harabagiu and Finley Lacatusu Language Computer Corporation Presented by Yi-Ting.
Rule-based Reasoning in Semantic Text Analysis
Ensembling Diverse Approaches to Question Answering
Einat Minkov University of Haifa, Israel CL course, U
Building a Semantic Parser Overnight
Approaches to Machine Translation
Open question answering over curated and extracted knowledge bases
DATA MINING © Prentice Hall.
A Brief Introduction to Distant Supervision
Overview of Compilation The Compiler Front End
Overview of Compilation The Compiler Front End
Semantic Parsing for Question Answering
INAGO Project Automatic Knowledge Base Generation from Text for Interactive Question Answering.
Relation Extraction CSCI-GA.2591
Reading Report Semantic Parsing (续)
Reading Report Semantic Parsing: Sempre (自始至终)
4 (c) parsing.
Summarizing Entities: A Survey Report
Data Recombination for Neural Semantic Parsing
--Mengxue Zhang, Qingyang Li
Ensembling Diverse Approaches to Question Answering
Data Warehouse and OLAP
Enhanced Dependency Jiajie Yu Wentao Ding.
Learning to Parse Database Queries Using Inductive Logic Programming
Enriching Structured Knowledge with Open Information
Introduction Task: extracting relational facts from text
Automatic Detection of Causal Relations for Question Answering
Approaches to Machine Translation
Question Answering & Linked Data
Query Execution Presented by Jiten Oswal CS 257 Chapter 15
Effective Entity Recognition and Typing by Relation Phrase-Based Clustering
Reading Report Semantic Parsing (续)
Open Information Extraction from the Web
Rachit Saluja 03/20/2019 Relation Extraction with Matrix Factorization and Universal Schemas Sebastian Riedel, Limin Yao, Andrew.
Data Warehouse and OLAP
Presentation transcript:

Reading Report: Open QA Systems 瞿裕忠 南京大学计算机系

Articles Anthony Fader, Luke Zettlemoyer, Oren Etzioni: Open question answering over curated and extracted knowledge bases. KDD 2014: 1156-1165 Anthony Fader, Luke S. Zettlemoyer, Oren Etzioni: Paraphrase-Driven Learning for Open Question Answering. ACL (1) 2013: 1608-1618

Paraphrase-Driven Learning for Open QA Introduction The problem of answering questions with the noisy knowledge bases that IE systems produce. An approach for learning to map questions to formal queries over a large, open-domain database of extracted facts Learn from a large, noisy, question paraphrase corpus, where question clusters have a common but unknown query WikiAnswers corpus: syntactic and lexical variations Learning to answer a broad class of factual questions.

Paraphrase-Driven Learning for Open QA authored(milne,winnie-the-pooh) treat(bloody-mary, hangover-symptoms)

Paraphrase-Driven Learning for Open QA Lexicon: mappings from NL to DB concepts The lexicon is used to generate a derivation y from an input question x to a database query z.

Paraphrase-Driven Learning for Open QA A derivation of x under L0 New Lexicon Entry Word alignment in (x, x’)

An initial seed lexicon L0 16 hand-written 2-argument question patterns

Compare the following systems Experiment Compare the following systems PARALEX: the lexical learning + parameter learning NoParam: PARALEX without the learned parameters. InitOnly: PARALEX using only the initial Test data 698 questions from WikiAnswers, Create 37 clusters . A gold standard set of approximately 48000 (x, a, l) triples. Database (noisy KB) 15 million REVERB extractions The full set of REVERB extractions: over six billion triples word-alignment for each paraphrase pair MGIZA++ implementation of IBM Model 4

Results

Question patterns that are used to derive a correct query Results Question patterns that are used to derive a correct query

Relation and entity synonyms learned from the WikiAnswers Results Relation and entity synonyms learned from the WikiAnswers

Error Analysis How long does it take to drive from Sacramento to Cancun? What do cats and dogs have in common? How do you make axes in minecraft? When were Bobby Orr’s children born?

Open QA Over Curated and Extracted KB

Open QA Over Curated and Extracted KB Techniques The operators and KB are noisy, so it is possible to construct many different sequences of operations (called derivations) An inference algorithm for deriving high confidence answers and a hidden-variable structured perceptron algorithm for learning a scoring function from data Automatically mining paraphrase operators from a question corpus and KB-query rewrite operators from multiple KBs.

Open QA Over Curated and Extracted KB Question Templates

Open QA Over Curated and Extracted KB Mine paraphrase operators from the WikiAnswers WikiAnswers consists of 23 million question-clusters

Open QA Over Curated and Extracted KB Mine query rewrite rules. Focus on handling the mismatch between relation words in the question and relation words in the KB

Experiments Three question sets Multiple knowl-edge sources: Open IE, Freebase, and Probase.

Experiments

Experiments

Experiments

Related papers Jonathan Berant, Andrew Chou, Roy Frostig, Percy Liang: Semantic Parsing on Freebase from Question-Answer Pairs. EMNLP 2013: 1533-1544 Jonathan Berant, Percy Liang: Semantic Parsing via Paraphrasing. ACL (1) 2014: 1415-1425 Yushi Wang, Jonathan Berant, Percy Liang. Building a Semantic Parser Overnight. Association for Computational Linguistics (ACL), 2015. Roy Bar-Haim, Ido Dagan, Jonathan Berant: Knowledge-Based Textual Inference via Parse-Tree Transformations. J. Artif. Intell. Res. (JAIR) 54: 1-57 (2015)

致谢 欢迎提问!