SearcharxivSearch

arXiv subjects

Suhail Barot

Publications and source records attributed to Suhail Barot.

3 recordsLinked to original sources

Question Answering via Web Extracted Tables and Pipelined Models

In this paper, we describe a dataset and baseline result for a question answering that utilizes web tables. It contains commonly asked questions on the web and their corresponding answers found in tables on websites. Our dataset is novel in that every question is paired with a table of a different signature. In particular, the dataset contains two classes of tables: entity-instance tables and the key-value tables. Each QA instance comprises a table of either kind, a natural language question, and a corresponding structured SQL query. We build our model by dividing question answering into several tasks, including table retrieval and question element classification, and conduct experiments to measure the performance of each task. We extract various features specific to each task and compose a full pipeline which constructs the SQL query from its parts. Our work provides qualitative results and error analysis for each task, and identifies in detail the reasoning required to generate SQL expressions from natural language questions. This analysis of reasoning informs future models based on neural machine learning.

cs.CL

Acronym Disambiguation: A Domain Independent Approach

Acronyms are omnipresent. They usually express information that is repetitive and well known. But acronyms can also be ambiguous because there can be multiple expansions for the same acronym. In this paper, we propose a general system for acronym disambiguation that can work on any acronym given some context information. We present methods for retrieving all the possible expansions of an acronym from Wikipedia and AcronymsFinder.com. We propose to use these expansions to collect all possible contexts in which these acronyms are used and then score them using a paragraph embedding technique called Doc2Vec. This method collectively led to achieving an accuracy of 90.9% in selecting the correct expansion for given acronym, on a dataset we scraped from Wikipedia with 707 distinct acronyms and 14,876 disambiguations.

cs.CL

A concise, approximate representation of a collection of loads described by polytopes

Aggregations of flexible loads can provide several power system services through demand response programs, for example load shifting and curtailment. The capabilities of demand response should therefore be represented in system operators' planning and operational routines. However, incorporating models of every load in an aggregation into these routines could compromise their tractability by adding exorbitant numbers of new variables and constraints. In this paper, we propose a novel approximation for concisely representing the capabilities of a heterogeneous aggregation of flexible loads. We assume that each load is mathematically described by a convex polytope, i.e., a set of linear constraints, a class which includes deferrable loads, thermostatically controlled loads, and generic energy storage. The set-wise sum of the loads is the Minkowski sum, which is in general computationally intractable. Our representation is an outer approximation of the Minkowski sum. The new approximation is easily computable and only uses one variable per time period corresponding to the aggregation's net power usage. Theoretical and numerical results indicate that the approximation is accurate for broad classes of loads.

math.OC