Learning Relational Decomposition of Queries for Question Answering from Tables - Machine Learning and Information Access
Conference Papers Year : 2024

Learning Relational Decomposition of Queries for Question Answering from Tables

Abstract

Table Question-Answering involves both understanding the natural language query and grounding it in the context of the input table to extract relevant information. In this context, many methods have highlighted the benefits of intermediate pre-training using SQL queries. However, while most approaches aim at generating final answers directly from inputs, we claim that there is better to do with SQL queries during training.By learning to imitate a restricted subset of SQL-like algebraic operations, we demonstrate that their execution flow provides intermediate supervision steps that allow for increased generalization and structural reasoning compared to classical approaches. Our method, bridges the gap between semantic parsing and direct answering methods, offering valuable insights into which types of operations should be predicted by a generative architecture and which should be executed by an external algorithm. Our code can be found at https://github.com/RaphaelMouravieff/Partial-Exec.
Fichier principal
Vignette du fichier
2024.acl-long.564.pdf (1.15 Mo) Télécharger le fichier
Origin Publisher files allowed on an open archive
licence
Copyright

Dates and versions

hal-04677411 , version 1 (26-08-2024)

Licence

Copyright

Identifiers

  • HAL Id : hal-04677411 , version 1

Cite

Raphaël Mouravieff, Benjamin Piwowarski, Sylvain Lamprier. Learning Relational Decomposition of Queries for Question Answering from Tables. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Aug 2024, Bangkok, Thailand. pp.10471--10485. ⟨hal-04677411⟩
36 View
30 Download

Share

More