English
Related papers

Related papers: Is Sluice Resolution really just Question Answerin…

200 papers

Web 2.0 has brought with it numerous user-produced data revealing one's thoughts, experiences, and knowledge, which are a great source for many tasks, such as information extraction, and knowledge base construction. However, the colloquial…

Computation and Language · Computer Science 2018-01-24 Xuancheng Ren , Xu Sun , Ji Wen , Bingzhen Wei , Weidong Zhan , Zhiyuan Zhang

Spoken Language Understanding (SLU) aims to extract the semantics frame of user queries, which is a core component in a task-oriented dialog system. With the burst of deep neural networks and the evolution of pre-trained language models,…

Computation and Language · Computer Science 2021-05-11 Libo Qin , Tianbao Xie , Wanxiang Che , Ting Liu

Question answering is one of the most important and difficult applications at the border of information retrieval and natural language processing, especially when we talk about complex science questions which require some form of inference…

Computation and Language · Computer Science 2019-05-08 George-Sebastian Pirtoaca , Traian Rebedea , Stefan Ruseti

We give here the specific product rule for the lattice of questions. This product rule differs from the product rule for the lattice of statements, hence the qualifier `specific'. This is because the elements in the lattice of statements…

Methodology · Statistics 2013-09-03 H. R. N. van Erp

This paper defines the (first-order) conflict resolution calculus: an extension of the resolution calculus inspired by techniques used in modern SAT-solvers. The resolution inference is restricted to (first-order) unit-propagation and the…

Logic in Computer Science · Computer Science 2016-02-16 John Slaney , Bruno Woltzenlogel Paleo

The task of long-form question answering (LFQA) involves retrieving documents relevant to a given question and using them to generate a paragraph-length answer. While many models have recently been proposed for LFQA, we show in this paper…

Computation and Language · Computer Science 2021-05-20 Kalpesh Krishna , Aurko Roy , Mohit Iyyer

Humans often specify tasks incompletely, so assistants must know when and how to ask clarifying questions. However, effective clarification remains challenging in software engineering tasks as not all missing information is equally…

Software Engineering · Computer Science 2026-04-17 Sanidhya Vijayvargiya , Vijay Viswanathan , Graham Neubig

The shuffle product \(u\shuffle v\) of two words \(u\) and \(v\) is the set of all words which can be obtained by interleaving \(u\) and \(v\). Motivated by the paper \emph{The Shuffle Product: New Research Directions} by Restivo (2015) we…

Combinatorics · Mathematics 2022-03-03 Pamela Fleischmann , Tero Harju , Lukas Haschke , Jonas Höfer , Dirk Nowotka

The ability to generate clarification questions i.e., questions that identify useful missing information in a given context, is important in reducing ambiguity. Humans use previous experience with similar contexts to form a global view and…

Computation and Language · Computer Science 2021-04-15 Bodhisattwa Prasad Majumder , Sudha Rao , Michel Galley , Julian McAuley

Contexts are terms with one `hole', i.e. a place in which we can substitute an argument. In context unification we are given an equation over terms with variables representing contexts and ask about the satisfiability of this equation.…

Logic in Computer Science · Computer Science 2013-11-11 Artur Jeż

Design is often characterized as an act of problem-solving. This is a perspective that, while pervasive, risks reducing complex socio-technical conditions to easily fixable issues. This paper critiques the ideology of "design as…

Human-Computer Interaction · Computer Science 2026-03-17 Jörgen Behrendtz , Lina Rahm

We observe that current conversational language models often waver in their judgments when faced with follow-up questions, even if the original judgment was correct. This wavering presents a significant challenge for generating reliable…

Computation and Language · Computer Science 2024-06-12 Qiming Xie , Zengzhi Wang , Yi Feng , Rui Xia

This paper revisits the conundrum faced when one attempts to understand the dynamics of black hole formation and evaporation without abandoning unitary evolution. Previous efforts to resolve this puzzle assume that information escapes in…

High Energy Physics - Theory · Physics 2009-10-22 S. B. Giddings

We consider answering queries where the underlying data is available only over limited interfaces which provide lookup access to the tuples matching a given binding, but possibly restricting the number of output tuples returned. Interfaces…

Databases · Computer Science 2019-08-28 Antoine Amarilli , Michael Benedikt

Answer sentence selection is the task of identifying sentences that contain the answer to a given question. This is an important problem in its own right as well as in the larger context of open domain question answering. We propose a novel…

Computation and Language · Computer Science 2014-12-05 Lei Yu , Karl Moritz Hermann , Phil Blunsom , Stephen Pulman

Answering complex questions is a time-consuming activity for humans that requires reasoning and integration of information. Recent work on reading comprehension made headway in answering simple questions, but tackling complex questions is…

Computation and Language · Computer Science 2018-03-20 Alon Talmor , Jonathan Berant

Answering complex questions that require making latent decisions is a challenging task, especially when limited supervision is available. Recent works leverage the capabilities of large language models (LMs) to perform complex question…

Computation and Language · Computer Science 2022-12-09 Dheeru Dua , Shivanshu Gupta , Sameer Singh , Matt Gardner

A class of generalized Schr\"{o}dinger elliptic problems involving concave-convex and other types of nonlinearities is studied. A reasonable overview about the set of solutions is provided when the parameters involved in the equation assume…

Analysis of PDEs · Mathematics 2018-12-19 Andrelino V. Santos , João R. Santos Júnior

One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…

Combinatorics · Mathematics 2014-12-25 Jeremy F. Alm , John W. Snow

Math Word Problem (MWP) solving needs to discover the quantitative relationships over natural language narratives. Recent work shows that existing models memorize procedures from context and rely on shallow heuristics to solve MWPs. In this…

Computation and Language · Computer Science 2022-03-11 Zhongli Li , Wenxuan Zhang , Chao Yan , Qingyu Zhou , Chao Li , Hongzhi Liu , Yunbo Cao