Open Domain Question Answering Using Web Tables

• URL: http://arxiv.org/abs/2001.03272v1
• Date: Fri, 10 Jan 2020 01:25:04 GMT
• Title: Open Domain Question Answering Using Web Tables
• Authors: Kaushik Chakrabarti, Zhimin Chen, Siamak Shakeri, Guihong Cao
• Abstract summary: We develop an open-domain QA approach using web tables that works for both factoid and non-factoid queries. Our solution is used in production in a major commercial web search engine and serves direct answers for tens of millions of real user queries per month.
• Score: 8.25461115955717
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Tables extracted from web documents can be used to directly answer many web search queries. Previous works on question answering (QA) using web tables have focused on factoid queries, i.e., those answerable with a short string like person name or a number. However, many queries answerable using tables are non-factoid in nature. In this paper, we develop an open-domain QA approach using web tables that works for both factoid and non-factoid queries. Our key insight is to combine deep neural network-based semantic similarity between the query and the table with features that quantify the dominance of the table in the document as well as the quality of the information in the table. Our experiments on real-life web search queries show that our approach significantly outperforms state-of-the-art baseline approaches. Our solution is used in production in a major commercial web search engine and serves direct answers for tens of millions of real user queries per month.

Related papers

• Is Table Retrieval a Solved Problem? Exploring Join-Aware Multi-Table Retrieval [52.592071689901196]
  We introduce a method that uncovers useful join relations for any query and database during table retrieval. Our method outperforms the state-of-the-art approaches for table retrieval by up to 9.3% in F1 score and for end-to-end QA by up to 5.4% in accuracy.
  arXiv  Detail & Related papers  (2024-04-15T15:55:01Z)
• MURRE: Multi-Hop Table Retrieval with Removal for Open-Domain Text-to-SQL [51.48239006107272]
  Multi-hop table retrieval with removal (MURRE) removes previously retrieved information from the question to guide towards unretrieved relevant tables. Experiments on two open-domain text-to- retriever datasets demonstrate an average improvement of 5.7% over the previous state-of-the-art results.
  arXiv  Detail & Related papers  (2024-02-16T13:14:35Z)
• Augment before You Try: Knowledge-Enhanced Table Question Answering via Table Expansion [57.53174887650989]
  Table question answering is a popular task that assesses a model's ability to understand and interact with structured data. Existing methods either convert both the table and external knowledge into text, which neglects the structured nature of the table. We propose a simple yet effective method to integrate external information in a given table.
  arXiv  Detail & Related papers  (2024-01-28T03:37:11Z)
• MultiTabQA: Generating Tabular Answers for Multi-Table Question Answering [61.48881995121938]
  Real-world queries are complex in nature, often over multiple tables in a relational database or web page. Our model, MultiTabQA, not only answers questions over multiple tables, but also generalizes to generate tabular answers.
  arXiv  Detail & Related papers  (2023-05-22T08:25:15Z)
• Open-WikiTable: Dataset for Open Domain Question Answering with Complex Reasoning over Table [6.436886630398141]
  Open-WikiTable is the first ODQA dataset that requires complex reasoning over tables. Open-WikiTable is built upon Wiki and WikiTableQuestions.
  arXiv  Detail & Related papers  (2023-05-12T07:24:16Z)
• TabIQA: Table Questions Answering on Business Document Images [3.9993134366218857]
  This paper introduces a novel pipeline, named TabIQA, to answer questions about business document images. TabIQA combines state-of-the-art deep learning techniques 1) to extract table content and structural information from images and 2) to answer various questions related to numerical data, text-based information, and complex queries from structured tables.
  arXiv  Detail & Related papers  (2023-03-27T06:31:21Z)
• Dual Reader-Parser on Hybrid Textual and Tabular Evidence for Open Domain Question Answering [78.9863753810787]
  A large amount of world's knowledge is stored in structured databases. query languages can answer questions that require complex reasoning, as well as offering full explainability.
  arXiv  Detail & Related papers  (2021-08-05T22:04:13Z)
• Representations for Question Answering from Documents with Tables and Text [22.522986299412807]
  We aim to improve question answering from tables by refining table representations based on information from surrounding text. We also present an effective method to combine text and table-based predictions for question answering from full documents.
  arXiv  Detail & Related papers  (2021-01-26T05:52:20Z)
• A Graph Representation of Semi-structured Data for Web Question Answering [96.46484690047491]
  We propose a novel graph representation of Web tables and lists based on a systematic categorization of the components in semi-structured data as well as their relations. Our method improves F1 score by 3.90 points over the state-of-the-art baselines.
  arXiv  Detail & Related papers  (2020-10-14T04:01:54Z)
• TableQnA: Answering List Intent Queries With Web Tables [12.941073798838167]
  We focus on answering two classes of queries with HTML tables: those seeking lists of entities and those seeking superlative entities. Existing approaches train machine learning models to select the answer from the candidates. We develop novel features to compute structure-aware match and train a machine learning model.
  arXiv  Detail & Related papers  (2020-01-10T01:43:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.