English
Related papers

Related papers: Extending QuAK with Nested Quantitative Automata

200 papers

Review-based Product Question Answering (PQA) allows e-commerce platforms to automatically address customer queries by leveraging insights from user reviews. However, existing PQA systems generate answers with only a single perspective,…

Computation and Language · Computer Science 2025-06-05 An Quang Tang , Xiuzhen Zhang , Minh Ngoc Dinh , Zhuang Li

Quantum computing (QC) seems to show potential for application in machine learning (ML). In particular quantum kernel methods (QKM) exhibit promising properties for use in supervised ML tasks. However, a major disadvantage of kernel methods…

Quantum Physics · Physics 2025-01-14 Kilian Tscharke , Sebastian Issel , Pascal Debus

Question Answering (QA) datasets are crucial in assessing reading comprehension skills for both machines and humans. While numerous datasets have been developed in English for this purpose, a noticeable void exists in less-resourced…

Computation and Language · Computer Science 2025-06-10 Bernardo Leite , Tomás Freitas Osório , Henrique Lopes Cardoso

A question answering (QA) system is a type of conversational AI that generates natural language answers to questions posed by human users. QA systems often form the backbone of interactive dialogue systems, and have been studied extensively…

Software Engineering · Computer Science 2021-01-12 Aakash Bansal , Zachary Eberhart , Lingfei Wu , Collin McMillan

Question Answering (QA) is a longstanding challenge in natural language processing. Existing QA works mostly focus on specific question types, knowledge domains, or reasoning skills. The specialty in QA research hinders systems from…

Computation and Language · Computer Science 2022-12-12 Wanjun Zhong , Yifan Gao , Ning Ding , Yujia Qin , Zhiyuan Liu , Ming Zhou , Jiahai Wang , Jian Yin , Nan Duan

We study 1-way quantum finite automata (QFAs). First, we compare them with their classical counterparts. We show that, if an automaton is required to give the correct answer with a large probability (over 0.98), then the power of 1-way QFAs…

Quantum Physics · Physics 2007-05-23 A. Ambainis , R. Freivalds

Query Auto-Completion (QAC) suggests query completions as users type, helping them articulate intent and reach results more efficiently. Existing approaches face fundamental challenges: traditional retrieve-and-rank pipelines have limited…

Variational Quantum Algorithms (VQAs) are promising methods for solving combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) devices. However, benchmarking VQAs is difficult due to their stochastic behavior and the…

Noisy Intermediate-Scale Quantum (NISQ) devices have begun to exhibit early quantum advantages on classically intractable problems, spanning physics simulations to Gaussian boson sampling. Yet, realizing these benefits remains challenging…

Artificial Intelligence · Computer Science 2025-08-29 Zhenxiao Fu , Fan Chen , Lei Jiang

We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as a relatively simple technique to introduce quantum computation concepts to computer scientists. We also describe a…

Formal Languages and Automata Theory · Computer Science 2014-06-17 A. C. Cem Say , Abuzer Yakaryilmaz

If a question cannot be answered with the available information, robust systems for question answering (QA) should know _not_ to answer. One way to build QA models that do this is with additional training data comprised of unanswerable…

Computation and Language · Computer Science 2023-10-31 Vagrant Gautam , Miaoran Zhang , Dietrich Klakow

The task of Question Answering has gained prominence in the past few decades for testing the ability of machines to understand natural language. Large datasets for Machine Reading have led to the development of neural models that cater to…

Computation and Language · Computer Science 2018-06-20 Soumya Wadhwa , Khyathi Raghavi Chandu , Eric Nyberg

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal…

Logic in Computer Science · Computer Science 2009-09-10 Krishnendu Chatterjee , Laurent Doyen , Thomas A. Henzinger

Weighted automata are non-deterministic automata where the transitions are equipped with weights. They can model quantitative aspects of systems like costs or energy consumption. The value of a run can be computed, for example, as the…

Logic in Computer Science · Computer Science 2015-06-22 Manfred Droste , Vitaly Perevoshchikov

Operational consistent query answering (CQA) is a recent framework for CQA based on revised definitions of repairs, which are built by applying a sequence of operations (e.g., fact deletions) starting from an inconsistent database until we…

Databases · Computer Science 2025-08-25 Marco Calautti , Ester Livshits , Andreas Pieris , Markus Schneider

Traditional quality assurance (QA) methods face significant challenges in addressing the complexity, scale, and rapid iteration cycles of modern software systems and are strained by limited resources available, leading to substantial costs…

Software Engineering · Computer Science 2025-06-23 Ihor Pysmennyi , Roman Kyslyi , Kyrylo Kleshch

Motivated by the emerging demand in the financial industry for the automatic analysis of unstructured and structured data at scale, Question Answering (QA) systems can provide lucrative and competitive advantages to companies by…

Computation and Language · Computer Science 2025-05-05 Bithiah Yuan

Commercially available Noisy Intermediate-Scale Quantum (NISQ) devices now make small hybrid quantum-classical experiments practical, but many tools hide configuration or demand ad-hoc scripting. We introduce the Quantum Experiment…

Quantum Physics · Physics 2025-11-07 Vincent Gierisch , Wolfgang Mauerer

Question Answering (QA) systems require a large amount of annotated data which is costly and time-consuming to gather. Converting datasets of existing QA benchmarks are challenging due to different formats and complexities. To address these…

Computation and Language · Computer Science 2022-10-14 Saptarashmi Bandyopadhyay , Shraman Pal , Hao Zou , Abhranil Chandra , Jordan Boyd-Graber

Question Answer Generation (QAG) is an effective data augmentation technique to improve the accuracy of question answering systems, especially in low-resource domains. While recent pretrained and large language model-based QAG methods have…

Computation and Language · Computer Science 2024-06-27 Vikas Yadav , Hyuk Joon Kwon , Vijay Srinivasan , Hongxia Jin
‹ Prev 1 4 5 6 7 8 10 Next ›