<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>ITUNLP at IberLEF-PRESTA: A Zero-Shot Code Generation Approach for Question Answering over Spanish Tabular Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Atakan Site</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Emre Hakan Erdemir</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gülşen Eryiğit</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Artificial Intelligence and Data Engineering, Istanbul Technical University</institution>
          ,
          <addr-line>Istanbul</addr-line>
          ,
          <country country="TR">Turkey</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>This paper presents our zero-shot, LLM-driven code generation approach for solving the IberLEF 2025 - PRESTA: Question Answering over Tabular Data in Spanish task. Our approach relies on a Python code generation framework that employs state-of-the-art large language models (LLMs), including OpenAI o3, Qwen3, DeepSeekR1, DeepSeek-V3, Llama 4, to generate executable Pandas code via optimized prompting strategies. Experimental results show that diferent LLMs vary in their efectiveness for code generation, and our hybrid configuration achieved the highest accuracy among the seven participating teams in the shared task. Specifically, our system reached 90% accuracy on the development set and 87% on the test set, demonstrating the viability of zero-shot methods for tabular question answering.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Tabular Question Answering</kwd>
        <kwd>Large Language Models</kwd>
        <kwd>Zero-Shot Code Generation</kwd>
        <kwd>Executable Code Generation</kwd>
        <kwd>Error Correction</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Question Answering (QA) is a core task in Natural Language Processing (NLP), traditionally focused on
retrieving relevant information from unstructured sources. However, many real-world applications rely
heavily on structured data, which often carries broader and more precise semantic representations. A
prominent example of such data is tabular data, where information is organized into rows and columns
with consistent feature sets. Unlike unstructured text, tabular data encodes complex, heterogeneous
relationships that require complex reasoning and processing strategies. Conventional approaches
to querying tabular data primarily rely on structured query languages such as SQL. While these
methods ofer high precision and deterministic behaviors, they struggle to generalize across semantically
equivalent natural language expressions and require technical expertise. These limitations are especially
evident when users query structured data using natural language, which is often ambiguous,
contextdependent, and underspecified. To address these challenges, recent work has focused on developing
question answering systems specifically designed for tabular data.</p>
      <p>
        The task of converting natural language queries into executable logical forms is commonly referred
to as semantic parsing [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. Early approaches to semantic parsing over tabular data typically relied
on task-specific logical form grammars, requiring manual adaptation to each table schema [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. While
efective in narrow domains, such methods often failed to generalize to open-domain or heterogeneous
tabular settings.
      </p>
      <p>
        More recent work has shifted toward end-to-end neural architectures, particularly pre-trained
transformer models, which jointly model both the natural language query and the underlying tabular
structure [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. These models remove the need for explicit logical form supervision by directly producing
answers or intermediate executable forms. The emergence of large language models (LLMs) has enabled
promising advances in zero-shot and few-shot tabular question answering [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. These models
demonstrate strong cross-domain generalization capabilities by leveraging in-context learning, thus reducing
or eliminating the need for task-specific fine-tuning. However, they also introduce several limitations,
including high computational cost, restricted context window, lack of guaranteed execution correctness
and limited interpretability. To tackle these challenges and advance the development of robust tabular
question-answering systems, SemEval-2025 Task 8 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] introduced a benchmark comprising two subtasks,
targeting various question formats and table domains in English. As a follow-up, the IberLEF 2025
PRESTA task [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], organized as part of the Iberian Languages Evaluation Forum (IberLEF) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], extends
this initiative to the Spanish language through the DataBenchSPA benchmark dataset. This progression
enables a broader evaluation of state-of-the-art methods in tabular question answering and ofers a new
testing ground for assessing the generalization capabilities of LLM-based approaches across languages
and domains.
      </p>
      <p>
        In this paper, we evaluate our previously proposed unified framework, originally developed for
SemEval-2025 Task 8 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], in the context of the IberLEF 2025 - PRESTA task [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. This updated version
integrates a range of recent state-of-the-art LLMs, including DeepSeek-R1 [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], DeepSeek-V3-0324 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ],
Qwen3-235B-A22B [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], OpenAI o3 [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], and Llama-4-Maverick-17B-128E-Instruct [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], to address
tabular question answering in Spanish. The system uses an inference-time prompting approach to
generate executable Python code using the Pandas1 library, which is executed in a controlled environment
to ensure safe and accurate access to tabular data. To improve robustness, we incorporate an iterative
error-handling mechanism: when code execution fails, the faulty code and corresponding error message
are sent back to the LLM for correction, with a maximum of three iterations. This process enhances the
overall reliability of the system, particularly in handling linguistically or structurally complex queries.
      </p>
      <p>We observe that our hybrid configuration combining OpenAI o3 (high) and Qwen3-235B-A22B
achieves the highest overall accuracy, reaching 90% on the development set and 87% on the test set.
Among individual models, Qwen3-235B-A22B yields the best performance, with 86% on the development
set and 85% on the test set. All code is available on our GitHub repository2.</p>
      <sec id="sec-1-1">
        <title>1https://pandas.pydata.org/ 2https://github.com/erdemire21/iberlef-presta-itunlp</title>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>This section provides an overview of recent developments in LLMs, with a particular emphasis on their
applications in tabular question answering.</p>
      <p>
        The advent of the Transformer architecture [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] has driven major breakthroughs in language modeling,
enabling substantial improvements across a wide range of NLP tasks. As a result, adapting
Transformerbased models to structured representations has become increasingly common. Initial eforts in this area
primarily explored novel embedding techniques [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], pre-training objectives [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], and architectural
adjustments [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] for tabular inputs. One dominant approach involved training Transformer-based
models from scratch specifically for tabular data [
        <xref ref-type="bibr" rid="ref19 ref4">4, 19</xref>
        ]. While these models showed promise in
constrained settings, they often struggled with eficiency and scalability, especially when deployed
across heterogeneous domains. In practice, pre-trained language models tend to underperform when
applied directly to task-specific tabular datasets without extensive adaptation.
      </p>
      <p>
        In recent years, LLMs have revolutionized the way tabular data tasks are approached. Models such
as GPT-3 [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and Llama [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] have demonstrated strong generalization capabilities through zero-shot
and few-shot learning, allowing them to perform competitively on a wide range of NLP benchmarks
with minimal or no task-specific supervision. This shift has paved the way for using a single,
generalpurpose model across diverse tasks, including table-based reasoning, without the need for fine-tuning or
specialized architectures. This trend marks a substantial departure from earlier methods that required
training models specifically for each domain or task. Instead, LLMs enable task solving via in-context
learning, where the model is guided by natural language instructions or few-shot examples. In the
context of tabular question answering, this allows for greater flexibility, especially in low-resource or
multilingual settings such as Spanish, where labeled data is scarce.
      </p>
      <p>Despite their impressive capabilities, deploying LLMs in tabular QA remains challenging. One of
the most prominent limitations is the limited context window, which can hinder the model’s ability to
handle large tables or multiple tables simultaneously. When essential portions of the table are truncated
due to token limits, the model’s outputs can become unreliable. Furthermore, LLMs may particularly
hallucinate when reasoning requires precise alignment between the question and table content.</p>
      <p>
        To address these limitations, recent research has increasingly relied on the in-context learning
capabilities of LLMs. The success of LLM-based tabular question answering systems is highly dependent
on how both the tabular input and natural language queries are represented. For table understanding,
schema-guided prompts and exemplars are commonly employed to help the model attend to the
structural semantics of the data. In parallel, the formulation of the query itself plays a critical role:
strategies such as query decomposition have been shown to improve reasoning and interpretability
capabilities [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Another approach is transforming queries into intermediate representations such as
Python code or SQL queries, enabling structured execution [
        <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
        ]. These techniques have collectively
enabled LLMs to generalize across diverse table structures and query intents without task-specific
ifne-tuning.
      </p>
      <p>
        Recently, eforts have been made to expand the scope of tabular question answering to non-English
languages and more structurally complex settings. For instance, TableEval [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] introduces a multilingual
benchmark that includes a strong emphasis on Chinese table understanding. Similarly, [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] investigates
tabular QA in low-resource Indic languages, applying translation and cross-lingual transfer methods with
multilingual encoders. In the context of Spanish, DataBenchSPA [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] ofers a domain-diverse benchmark
to evaluate QA models on real-world tabular data. These works emphasize the growing importance of
evaluating LLM-based systems in multilingual and low-resource contexts, where linguistic variability
and domain shifts can significantly afect performance. However, despite these recent advances, studies
addressing tabular question answering in languages other than English remain limited. This highlights
the need for systematic evaluation in diverse languages, as exemplified by the PRESTA task’s focus on
semantically rich, non-English tabular data.
      </p>
      <p>
        Building on previous studies and our prior work for SemEval-2025 Task 8 [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], we extend our unified
framework to evaluate its efectiveness on the IberLEF 2025 - PRESTA task. Specifically, we examine how
well the system generalizes to a new language (Spanish) and benefits from more recent and powerful
LLMs. The PRESTA task introduces distinct challenges which allow us to test the robustness of our
architecture. Experimental results show that integrating newer models such as Qwen3-235B-A22B
within the same architecture leads to improved performance. These findings highlight not only the
adaptability of the original framework but also its practical value in real-world settings where tabular
data must be processed in multiple languages without task-specific fine-tuning.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Data</title>
      <p>
        The DataBenchSPA dataset [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], used as part of the competition, contains 250 questions from 8 diferent
domains, each containing question-answer pairs written in Spanish. For the IberLEF 2025 - PRESTA
competition, DataBenchSPA was used as the basis, and a new test split was introduced specifically for
the task. The exact dataset statistics are presented in Table 1. The train and development splits contain
the following columns:
• question: The natural language question.
• answer: The response to the question for the task.
• type: The type of the answer, which can be boolean, number, category, list[category],
list[number].
      </p>
      <p>• dataset: The name of the dataset from which the question is derived.</p>
      <p>In contrast to the train and development splits, which include the columns ‘question‘, ‘answer‘,
‘type‘, and ‘dataset‘, the test split for the PRESTA competition contains only the ‘question‘ and ‘dataset‘
columns to prevent data leakage and ensure a fair evaluation.</p>
      <p>Although the dataset provides structured train and development splits with detailed annotations,
this study did not utilize these data for training, as we preferred a zero-shot approach that does not
involve fine-tuning.</p>
    </sec>
    <sec id="sec-4">
      <title>4. System Overview</title>
      <p>
        Our approach involves two main steps in providing an answer to questions over tabular data:
preprocessing and then code generation and execution. The complete workflow, originally developed for
SemEval-2025 Task 8 [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] is illustrated in Figure 1.
      </p>
      <sec id="sec-4-1">
        <title>4.1. Preprocessing</title>
        <p>Our preprocessing steps include obtaining the given questions and datasets from the competition
platform, followed by a series of normalization and standardization techniques, and finally, the creation
of a schema for each dataset for LLM prompting. Each dataset is transformed using a set of rules
applied to column names. First, Spanish special characters (e.g., accented vowels) in column names are
normalized to their English counterparts, following the mappings shown in Table 2. Second, all spaces
and non-word characters are replaced with underscores, except for trailing special characters, which
are removed. Third, all column names are converted to lowercase, and duplicate columns are renamed
by appending a number to each duplicate. For example, if there are two columns named "Educación"
and "Educación@", they would be transformed to "educacion" and "educacion_2", respectively.</p>
        <p>After normalization and standardization, we construct a schema for each dataset to enhance the LLM’s
understanding of the table structure. The schemas include each dataset’s name, each column, each
column’s data type, five unique values from each column, and the total number of unique values that the
column contains. The example values are limited to a total of 100 characters to avoid excessive verbosity
and potential token overload. Examples of the constructed schemas can be found in Appendix A (e.g., see
the schema for the Dormir dataset in Appendix A.1). Note that the schemas presented in the appendix
have been truncated for brevity due to space constraints.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Code Generation and Execution</title>
        <p>The code generation step is performed using a prompt that includes the question, detailed instructions,
and the corresponding dataset schema. Although the questions are in Spanish, prompts are constructed
in English to maximize LLM performance, given their stronger capabilities in English. A detailed
breakdown of the code generation prompt is provided in Appendix B. The generated code is executed in
a controlled environment, where dynamic imports are extracted, and the execution output is captured
in its original format. In cases where execution fails, an error-handling mechanism is triggered. The
system captures the error message along with the faulty code and sends it to the LLM for automatic
correction (see Appendix B.2 for the prompt structure). The LLM then generates a revised version of
the code. This iterative process runs until the predefined threshold is met. If the provided code remains
faulty after the maximum number of attempts, execution is terminated for that query. The execution
result from the last successfully executed code is then set as the final answer for the corresponding
question.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Experimental Setup</title>
      <p>
        Our zero-shot framework was evaluated on the oficial development and test datasets provided for
the IberLEF 2025 - PRESTA task. These datasets are derived from the DataBenchSPA benchmark
[
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], with a dedicated test split compiled for the PRESTA competition. Building on our findings from
SemEval-2025 Task 8 [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], we selected the most recent and capable models available at the time of
system development to ensure optimal performance. We report results for individual models as well as
for a hybrid configuration, which achieved the highest overall accuracy.
      </p>
      <p>Specifically, for the configuration labeled ‘o3 (high) + Qwen3-235B-A22B’, we employed a fallback
strategy. The o3 (high) model served as the primary answer generator. For this model, an additional
instruction (see Appendix B.3) was added to the prompt due to its tendency to generate overly complex
code which led to subpar performance. For any question where o3 (high) failed to produce executable
code (resulting in an ‘Error‘ placeholder in its output line), we substituted the answer generated by the
Qwen3-235B-A22B model for that specific question. This fallback mechanism was designed to maximize
coverage and leverage the complementary strengths of both models.</p>
      <p>Additionally, based on our previous study and preliminary experiments, we set the maximum number
of error correction iterations to three, as attempts beyond this threshold rarely yielded additional
improvements. To evaluate system performance, we used Accuracy, the oficial evaluation metric of
the IberLEF 2025 - PRESTA task. Furthermore, we analyzed the impact of our iterative error-handling
mechanism on execution reliability by measuring error reduction rates across diferent models. These
evaluations provide insights into both models’ accuracy and execution robustness in tabular question
answering.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Results</title>
      <p>The performance of the models is presented in Table 3. Our results demonstrate strong performance
across diferent model configurations, with the hybrid approach achieving the best results. We observe
that our hybrid configuration o3 (high) + Qwen3-235B-A22B achieves the highest accuracy, reaching
90% on the development set and 87% on the test set. Among individual models, Qwen3-235B-A22B
shows strong performance with 86% accuracy on the development and 85% on the test set, while
o3 (high) maintains consistent performance with 85% accuracy on both splits. On the test set, both
Qwen3-235B-A22B and o3 (high) deliver the best individual model performance at 85%. DeepSeek-R1
follows with 84% accuracy on the development set and 81% on the test set. These results highlight
the benefits of combining complementary models and showcase the efectiveness of recent LLMs in
Spanish tabular question answering tasks. Notably, while DeepSeek-R1 was our best-performing model
in SemEval-2025 Task 8, the improvements observed in this study reflect how advancements in LLMs
directly scale our system’s performance. Furthermore, the results confirm the feasibility of applying our
framework to non-English tabular question answering, underscoring its adaptability across languages.</p>
      <p>Moreover, in the oficial evaluation for the IberLEF 2025 - PRESTA task, our best-performing hybrid
configuration achieved first place among 7 competitors. These results further validate the efectiveness
of our approach in zero-shot tabular question answering. At the time of this paper’s submission, due
to limited details on other solutions, we were unable to evaluate our performance relative to other
zero-shot systems in the PRESTA competition. However, our manual inspection suggest that the test
datasets are more challenging than the development set. The variation in performance across test
conditions reveals difering levels of generalization among models, with our hybrid configuration
consistently delivering robust results on both datasets.</p>
      <p>In addition, as shown in Table 4, our error-handling mechanism substantially reduces the number of
execution errors, demonstrating not only its efectiveness but also its necessity for ensuring reliable
execution. It should be noted that there appears to be a general trend between the initial error rate
and accuracy, where models achieving higher accuracy often generate less faulty code initially, though
some exceptions can be observed (e.g., DeepSeek-R1 on the development set had few initial errors but
was not the top performer). This suggests that while better-performing models may inherently produce
more reliable code, the error correction mechanism remains crucial for overall execution eficiency and
robustness.</p>
      <p>To analyze error patterns and the impact of our correction mechanism in greater detail, we grouped
errors into three main categories: Runtime, Degenerate Loop, and Syntax. Notably, the Runtime category
includes diverse errors such as KeyError and ValueError, but for simplicity, we report them under a
single label. Our findings also indicate that some errors transform into diferent types across iterations.</p>
      <p>We define Degenerate Loop errors as cases where an LLM repeatedly generates identical or nearly
identical output sequences, continuing indefinitely until it reaches its maximum token limit.</p>
      <p>Table 5 presents the distribution of error types across models and iterations. Results show that most
initial failures are due to Runtime errors, while Syntax and Loop errors are less frequent but may
persist across multiple correction attempts. Specifically, initial Syntax errors were most prominent
for the Llama-4-Maverick-17B-128E-Instruct model on the development set, and were also present for
Qwen3-235B-A22B. The DeepSeek models and o3 (high) did not exhibit Syntax errors in their initial
generation. Degenerate Loop errors were initially observed for DeepSeek-R1 and Qwen3-235B-A22B
on the development set, while DeepSeek-V3-0324, Llama-4-Maverick-17B-128E-Instruct, and o3 (high)
did not encounter this error type in their first attempts. As shown in Figures 2 and 3, while the specific
’Degenerate Loop’ error type is often resolved in subsequent iterations (as also indicated by Table 5
where loop counts tend to decrease), some queries initially exhibiting this error may still ultimately
result in failure. This can occur if the loop is replaced by a diferent, unresolvable error type. These
instances, however, represent a very small fraction of the total errors encountered.</p>
      <p>Finally, Figure 2 provides an overview of error resolution across iterations, showing that most runtime
errors are resolved within the first two attempts. Figure 3 further breaks down specific error types,
such as FileNotFoundError, KeyError, and NameError, ofering a more fine-grained view.</p>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusions</title>
      <p>In conclusion, this paper presented the solution developed by the ITUNLP group for the IberLEF 2025
PRESTA task, addressing the tabular question answering problem in zero-shot settings. Our method
demonstrated strong performance, with the hybrid configuration of o3 (high) + Qwen3-235B-A22B
achieving 90% accuracy on the development set and 87% on the test set. Our system ranked first among
7 competitors in the PRESTA competition. As these systems may have employed fine-tuning or few-shot
learning techniques, further analysis will be possible once the working notes papers from the PRESTA
shared task are published.</p>
      <p>Importantly, our findings highlight the viability of deploying a single, unified framework across
diferent languages, emphasizing the critical role of multilingual generalization in practical, real-world
applications. We also believe that integrating more recent models such as Qwen3-235B-A22B into
our existing architecture would lead to even better performance on earlier benchmarks, including our
previous submission for SemEval-2025 Task 8. This demonstrates the scalability of our framework as
LLMs continue to evolve.</p>
      <p>Finally, our study reafirms the value of zero-shot approaches: unlike fine-tuned systems that are often
limited to specific tasks or domains, our method remains broadly applicable, language-agnostic, and
easily extensible. In future work, we aim to extend this framework to handle more complex scenarios
such as multi-table reasoning, thereby further enhancing its applicability beyond current benchmarks.</p>
    </sec>
    <sec id="sec-8">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the author(s) used OpenAI GPT-4o in order to paraphrase, reword,
and spelling check. After using this tool/service, the author(s) reviewed and edited the content as
needed and take(s) full responsibility for the publication’s content.</p>
    </sec>
    <sec id="sec-9">
      <title>A. Example Schemas</title>
      <p>A.1. ES_02_40dB_Dormir
Column Name : identificador , Data type -- uint16 , -- Example values : 1, 2,
3, 4, 5, Total unique elements : 2000
Column Name : sexo , Data type -- category , -- Example values : Hombre ,</p>
      <p>Mujer , Total unique elements : 2
Column Name : edad_recodificada , Data type -- category , -- Example values :
55 -64 , 65+ , 35 -44 , 45 -54 , 25 -34 , Total unique elements : 6
Column Name : tamano_de_habitat , Data type -- category , -- Example values :
10.001 - 20.000 , 20.001 - 50.000 , &lt; 10.000 , 100.001 - 500.000 , Total
unique elements : 6
Column Name : provincia , Data type -- category , -- Example values :
Albacete , Ciudad Real , Girona , Asturias , Granada , Total unique
elements : 50
Column Name : comunidad_autonoma , Data type -- category , -- Example values :
Castilla - La Mancha , C a t a l u a , Asturias , Principado de , Total unique
elements : 17
Column Name : nivel_educativo_del_encuestado , Data type -- category ,
-Example values : Licenciatura , Grado - 2 Ciclo ( Universitarios ,
Licenciados superiores , Facultades , Escuelas t c n ... , Total unique
elements : 9
Column Name : regimen_laboral_del_encuestado , Data type -- category ,
-Example values : Cuenta ajena (p.e: empleado ) , Cuenta propia (p.e:
a u t n o m o o empresario ) , Total unique elements : 2
Column Name : profesion_del_encuestado , Data type -- category , -- Example
values : Mando IntermedioEmpleado a nivel medio de Empresas
A d m i n i s t r a c i n P b l i c a u Oficiales E j r c i t o Oc ... , Total unique
elements : 24
Column Name : clase_social , Data type -- category , -- Example values : A1 ,</p>
      <p>A2 , C , E1 , D , Total unique elements : 7
Column Name : tamano_de_habitat_recodificada , Data type -- category ,
-Example values : M s de 10.000 , Menos de 10.000 , Total unique elements :
2
Column Name : clase_social_recodificada , Data type -- category , -- Example
values : Alta / Media Alta , Media , Media baja / Baja , Total unique
elements : 3
Column Name : situacion_laboral_recodificada , Data type -- category ,
-Example values : Trabaja , Pensionista , Estudiante , Parado , Trabajo del
hogar no remunerado , Total unique elements : 5
Column Name : educacion_recodificada , Data type -- category , -- Example
values : Tercer grado , segundo ciclo y m s , Tercer grado , primer ciclo ,
Total unique elements : 5
Column Name : ponderacion , Data type -- float64 , -- Example values :
1.0562153017104814 , 0.9891829936759208 , 1.1776869300720032 , Total
unique elements : 1419
Column Name : edad , Data type -- uint8 , -- Example values : 58 , 66 , 42 , 70 ,
37 , Total unique elements : 67</p>
      <sec id="sec-9-1">
        <title>Listing 1: Schema for ES_02_40dB_Dormir (truncated for brevity).</title>
        <p>A.2. ES_04_CEA_Barometro_Andaluz_Septiembre_2023
Here are the columns for the dataset
Column Name : identificador_de_encuesta , Data type -- uint16 , -- Example
values : 1, 2, 3, 4, 5, Total unique elements : 3600
Column Name : peso , Data type -- float64 , -- Example values :
1.2500192224089317 , 0.8259640766746262 , 1.201067534371049 , Total unique
elements : 8
Column Name : provincia , Data type -- category , -- Example values : Sevilla ,</p>
        <p>A l m e r a , M l a g a , J a n , C d i z , Total unique elements : 8
Column Name : tamano_de_habitat , Data type -- category , -- Example values :
De 10.001 a 20.000 habitantes , De 50.001 a 100.000 habitantes , Total
unique elements : 5
Column Name : sexo , Data type -- category , -- Example values : Hombre ,</p>
        <p>Mujer , Total unique elements : 2
Column Name : edad , Data type -- uint8 , -- Example values : 46 , 66 , 29 , 19 ,
73 , Total unique elements : 70
Column Name : edad_cod , Data type -- category , -- Example values : 45 -54 ,
65 -74 , 25 -34 , 18 -24 , 35 -44 , Total unique elements : 7
Column Name : conoce_juanma_moreno , Data type -- category , -- Example
values : S , No , Total unique elements : 2
Column Name : valoracion_juanma_moreno_1_10 , Data type -- float64 ,
-</p>
        <p>Example values : 7.0 , 8.0 , 4.0 , 2.0 , 6.0 , Total unique elements : 10
Column Name : conoce_juan_espadas , Data type -- category , -- Example
values : S , No , Total unique elements : 2
Column Name : valoracion_juan_espadas_1_10 , Data type -- category ,
-</p>
        <p>Example values : 1, 6, 3, NS , 7, Total unique elements : 12
Column Name : conoce_manuel_gavira , Data type -- category , -- Example
values : S , No , Total unique elements : 2
Column Name : valoracion_manuel_gavira_1_10 , Data type -- float64 ,
-</p>
        <p>Example values : 2.0 , 4.0 , 1.0 , 5.0 , 3.0 , Total unique elements : 10
Column Name : conoce_inmaculada_nieto , Data type -- category , -- Example
values : S , No , Total unique elements : 2
Column Name : valoracion_inmaculada_nieto_1_10 , Data type -- float64 ,
-</p>
        <p>Example values : 2.0 , 5.0 , 9.0 , 6.0 , 8.0 , Total unique elements : 10
Column Name : conoce_jose_ignacio_garcia , Data type -- category , -- Example
values : S , No , Total unique elements : 2</p>
      </sec>
      <sec id="sec-9-2">
        <title>Listing 2: Schema for ES_04_CEA_Barometro_Andaluz_Septiembre_2023.</title>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>B. Code Generation Prompts</title>
      <sec id="sec-10-1">
        <title>B.1. Pandas Code Generation without Error Handling</title>
        <sec id="sec-10-1-1">
          <title>Natural Language to Python Code with Pandas</title>
          <p>Generate a python code to answer this question: {question} that strictly follows the
instructions below:</p>
        </sec>
        <sec id="sec-10-1-2">
          <title>The code should return a print statement with the answer to the question.</title>
          <p>The code should leave the answer be and not print anything other than the variable that holds
the answer.</p>
          <p>Please write a single Python code block that answers the following question and prints the
result in one line at the end.</p>
          <p>If the question doesn’t specifically ask for it, don’t use unique() or drop_duplicates() functions.</p>
        </sec>
        <sec id="sec-10-1-3">
          <title>If it is a Yes or No question, the answer should be a boolean. Do not include any explanations, comments, or additional code blocks. Do not print intermediate steps just the answer. Do not interact with the user.</title>
          <p>Never display any sort of dataframes or tables.</p>
          <p>Your output can never take more than a single line after printing and it can never be any sort of
objects such as pandas or numpy objects, series etc.</p>
          <p>Your output must be one of the following:</p>
        </sec>
        <sec id="sec-10-1-4">
          <title>Boolean: True/False</title>
          <p>
            Category/String: A value
Number: A numerical value
List[category/string]: [’cat’, ’dog’]
List[number]: [
            <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
            ]
So the outputs have to be native python
          </p>
        </sec>
        <sec id="sec-10-1-5">
          <title>Given the dataset schema {schema}</title>
          <p>The following python code made for pandas for the parquet file {dataset_name}.parquet reads
the parquet file and running it returns the answer that is enough to answer the question
{question}</p>
        </sec>
      </sec>
      <sec id="sec-10-2">
        <title>B.2. Pandas Code Generation with Error Handling</title>
        <p>The following prompt replaces the part after the schema is given of the previous prompt.</p>
        <sec id="sec-10-2-1">
          <title>Natural Language to Python Code with Pandas - Error Correction</title>
        </sec>
        <sec id="sec-10-2-2">
          <title>The following codes generated an error when executed:</title>
          <p>{code_1}/{error_1},
{code_2}/{error_2},
... %</p>
        </sec>
        <sec id="sec-10-2-3">
          <title>Error: {error_msg} Solve the error and provide the corrected code</title>
          <p>The following python code made for pandas for the parquet file {dataset_name}.parquet reads the
parquet file and running it returns the answer that is enough to answer the question {question}
with the error fixed</p>
        </sec>
      </sec>
      <sec id="sec-10-3">
        <title>B.3. o3-Specific Prompt Modification</title>
        <p>For the o3 model specifically, the following additional instruction was appended to the main code
generation prompt to address its tendency to generate overly complex code:</p>
        <sec id="sec-10-3-1">
          <title>Additional Instruction for o3 Model</title>
          <p>Generate the simplest possible pandas code that correctly answers the question. Avoid
unnecessary complexity, helper functions, or overly defensive programming unless strictly required by
the question’s logic. Prefer direct pandas operations.</p>
          <p>This modification was necessary because the o3 model initially generated overly complex code, which
led to subpar performance. The simplified instruction significantly improved its execution success rate.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-11">
      <title>C. Error Analysis</title>
      <p>DeepSeek-R1 (Dev)
DeepSeek-R1 (Test)
DeepSeek-V3 (Dev)
DeepSeek-V3 (Test)
Llama-4-Maverick-17B-128E-Instruct (Dev)
Llama-4-Maverick-17B-128E-Instruct (Test)
o3 (high) (Dev)
o3 (high) (Test)
Qwen3-235B-A22B (Dev)
Qwen3-235B-A22B (Test)
1
2
3
1
2
3
1
2
3
1
2
3
Total
0
0
0</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Zelle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. J.</given-names>
            <surname>Mooney</surname>
          </string-name>
          ,
          <article-title>Learning to parse database queries using inductive logic programming</article-title>
          ,
          <source>in: Proceedings of the Thirteenth National Conference on Artificial Intelligence -</source>
          Volume
          <volume>2</volume>
          , AAAI'
          <fpage>96</fpage>
          , AAAI Press,
          <year>1996</year>
          , p.
          <fpage>1050</fpage>
          -
          <lpage>1055</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Berant</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Frostig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <article-title>Semantic parsing on Freebase from question-answer pairs</article-title>
          , in: D.
          <string-name>
            <surname>Yarowsky</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Baldwin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Korhonen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Livescu</surname>
          </string-name>
          , S. Bethard (Eds.),
          <source>Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Seattle, Washington, USA,
          <year>2013</year>
          , pp.
          <fpage>1533</fpage>
          -
          <lpage>1544</lpage>
          . URL: https:// aclanthology.org/D13-1160/.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Pasupat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <article-title>Compositional semantic parsing on semi-structured tables</article-title>
          ,
          <year>2015</year>
          . URL: https: //arxiv.org/abs/1508.00305. arXiv:
          <volume>1508</volume>
          .
          <fpage>00305</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Herzig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. K.</given-names>
            <surname>Nowak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Müller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Piccinno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Eisenschlos</surname>
          </string-name>
          , Tapas:
          <article-title>Weakly supervised table parsing via pre-training, in: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</article-title>
          , Association for Computational Linguistics,
          <year>2020</year>
          . URL: http://dx.doi.org/10.18653/v1/
          <year>2020</year>
          .acl-main.
          <volume>398</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .acl-main.
          <volume>398</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>T. B. Brown</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Mann</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ryder</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Subbiah</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Kaplan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Dhariwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Neelakantan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Shyam</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Sastry</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Askell</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Herbert-Voss</surname>
            , G. Krueger,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Henighan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Child</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ramesh</surname>
            ,
            <given-names>D. M.</given-names>
          </string-name>
          <string-name>
            <surname>Ziegler</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Winter</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Hesse</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
            , E. Sigler,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Litwin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Gray</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Chess</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Berner</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>McCandlish</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Radford</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Amodei</surname>
          </string-name>
          ,
          <article-title>Language models are few-shot learners</article-title>
          ,
          <year>2020</year>
          . URL: https://arxiv.org/abs/
          <year>2005</year>
          .14165. arXiv:
          <year>2005</year>
          .14165.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Osés-Grijalba</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Ureña-López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. Martínez</given-names>
            <surname>Cámara</surname>
          </string-name>
          , J. Camacho-Collados, SemEval
          <article-title>-2025 task 8: Question answering over tabular data</article-title>
          ,
          <source>in: Proceedings of the 19th International Workshop on Semantic Evaluation (SemEval-2025)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Vienna, Austria,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Osés-Grijalba</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Ureña-López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Cámara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Camacho-Collados</surname>
          </string-name>
          , Overview of PRESTA at IberLEF 2025:
          <article-title>Question Answering Over Tabular Data In Spanish, in: Proceedings of the Iberian Languages Evaluation Forum (IberLEF 2025), co-located with the 41st Conference of the Spanish Society for Natural Language Processing (SEPLN 2025), CEUR-WS</article-title>
          . org,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Á</surname>
          </string-name>
          .
          <string-name>
            <surname>González-Barba</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Chiruzzo</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          <string-name>
            <surname>Jiménez-Zafra</surname>
          </string-name>
          ,
          <article-title>Overview of IberLEF 2025: Natural Language Processing Challenges for Spanish and other Iberian Languages, in: Proceedings of the Iberian Languages Evaluation Forum (IberLEF 2025), co-located with the 41st Conference of the Spanish Society for Natural Language Processing (SEPLN 2025), CEUR-WS</article-title>
          . org,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>DeepSeek-AI</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
            , J. Song,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          <string-name>
            <surname>Zhu</surname>
            , S. Ma,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
          </string-name>
          , et al.,
          <string-name>
            <surname>Deepseek-</surname>
          </string-name>
          r1:
          <article-title>Incentivizing reasoning capability in llms via reinforcement learning</article-title>
          ,
          <year>2025</year>
          . URL: https://arxiv.org/abs/2501.12948. arXiv:
          <volume>2501</volume>
          .
          <fpage>12948</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>DeepSeek-AI</surname>
          </string-name>
          ,
          <article-title>Deepseek-</article-title>
          v3
          <source>technical report</source>
          ,
          <year>2024</year>
          . URL: https://arxiv.org/abs/2412.19437. arXiv:
          <volume>2412</volume>
          .
          <fpage>19437</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Team</surname>
          </string-name>
          ,
          <source>Qwen3 technical report</source>
          ,
          <year>2025</year>
          . URL: https://arxiv.org/abs/2505.09388. arXiv:
          <volume>2505</volume>
          .
          <fpage>09388</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <article-title>OpenAI, Openai o3 technical chart</article-title>
          , https://openai.com/index/introducing-o3
          <string-name>
            <surname>-</surname>
          </string-name>
          and
          <string-name>
            <surname>-</surname>
          </string-name>
          o4-mini/,
          <year>2025</year>
          . Accessed:
          <fpage>2025</fpage>
          -06-06.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>M. AI</surname>
          </string-name>
          ,
          <source>LLaMA 4 - Maverick 17B 128E Instruct</source>
          , https://huggingface.co/meta-llama/ Llama-4
          <string-name>
            <surname>-Maverick-</surname>
          </string-name>
          17B
          <string-name>
            <surname>-</surname>
          </string-name>
          128E
          <article-title>-</article-title>
          <string-name>
            <surname>Instruct</surname>
          </string-name>
          ,
          <year>2025</year>
          . Accessed:
          <fpage>2025</fpage>
          -06-06.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Site</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. H.</given-names>
            <surname>Erdemir</surname>
          </string-name>
          , G. Eryigit, ITUNLP at Semeval
          <article-title>-2025 task 8: Question-answering over tabular data: A zero-shot approach using llm-driven code generation</article-title>
          ,
          <source>in: Proceedings of the 19th International Workshop on Semantic Evaluation (SemEval-2025)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Vienna,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kaiser</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          , Attention is all you need,
          <year>2017</year>
          . URL: https://arxiv.org/abs/1706.03762. arXiv:
          <volume>1706</volume>
          .
          <fpage>03762</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>P.</given-names>
            <surname>Yin</surname>
          </string-name>
          , G. Neubig, W. tau Yih, S. Riedel,
          <article-title>Tabert: Pretraining for joint understanding of textual and tabular data</article-title>
          ,
          <year>2020</year>
          . URL: https://arxiv.org/abs/
          <year>2005</year>
          .08314. arXiv:
          <year>2005</year>
          .08314.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Fu</surname>
          </string-name>
          , S. Han,
          <string-name>
            <surname>D</surname>
          </string-name>
          . Zhang, Tuta:
          <article-title>Tree-based transformers for generally structured table pre-training</article-title>
          ,
          <source>in: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining, KDD '21</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2021</year>
          . URL: http://dx.doi.org/10.1145/3447548.3467434. doi:
          <volume>10</volume>
          .1145/3447548.3467434.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>X.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khetan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cvitkovic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Karnin</surname>
          </string-name>
          , Tabtransformer:
          <article-title>Tabular data modeling using contextual embeddings</article-title>
          ,
          <year>2020</year>
          . URL: https://arxiv.org/abs/
          <year>2012</year>
          .06678. arXiv:
          <year>2012</year>
          .06678.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ziyadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Chen</surname>
          </string-name>
          , J.-G. Lou, Tapex:
          <article-title>Table pre-training via learning a neural sql executor</article-title>
          ,
          <year>2022</year>
          . URL: https://arxiv.org/abs/2107.07653. arXiv:
          <volume>2107</volume>
          .
          <fpage>07653</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lavril</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Izacard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Martinet</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lacroix</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Rozière</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Hambro</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Azhar</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rodriguez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Joulin</surname>
          </string-name>
          , E. Grave, G. Lample,
          <article-title>Llama: Open and eficient foundation language models</article-title>
          ,
          <year>2023</year>
          . URL: https://arxiv.org/abs/2302.13971. arXiv:
          <volume>2302</volume>
          .
          <fpage>13971</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>B.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <article-title>Efective distillation of table-based reasoning ability from LLMs</article-title>
          , in: N.
          <string-name>
            <surname>Calzolari</surname>
            , M.-
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Kan</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Hoste</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Lenci</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Sakti</surname>
          </string-name>
          , N. Xue (Eds.),
          <source>Proceedings of the 2024 Joint International Conference on Computational Linguistics</source>
          ,
          <article-title>Language Resources and Evaluation (LREC-COLING 2024), ELRA</article-title>
          and
          <string-name>
            <given-names>ICCL</given-names>
            ,
            <surname>Torino</surname>
          </string-name>
          , Italia,
          <year>2024</year>
          , pp.
          <fpage>5538</fpage>
          -
          <lpage>5550</lpage>
          . URL: https://aclanthology.org/
          <year>2024</year>
          .lrec-main.
          <volume>492</volume>
          /.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Fried</surname>
          </string-name>
          ,
          <article-title>API-assisted code generation for question answering on varied table structures</article-title>
          ,
          <source>in: Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Singapore,
          <year>2023</year>
          , pp.
          <fpage>14536</fpage>
          -
          <lpage>14548</lpage>
          . URL: https://aclanthology.org/
          <year>2023</year>
          .emnlp-main.
          <volume>897</volume>
          /. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2023</year>
          .emnlp-main.
          <volume>897</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. T.</given-names>
            <surname>Luu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>SynTQA: Synergistic table-based question answering via mixture of text-to-SQL and E2E TQA</article-title>
          , in: Y.
          <string-name>
            <surname>Al-Onaizan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Bansal</surname>
            ,
            <given-names>Y.-N.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
          </string-name>
          (Eds.),
          <source>Findings of the Association for Computational Linguistics: EMNLP</source>
          <year>2024</year>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Miami, Florida, USA,
          <year>2024</year>
          , pp.
          <fpage>2352</fpage>
          -
          <lpage>2364</lpage>
          . URL: https://aclanthology.org/
          <year>2024</year>
          .findings-emnlp.
          <volume>131</volume>
          /. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2024</year>
          .findings-emnlp.
          <volume>131</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <article-title>Tableeval: A real-world benchmark for complex, multilingual, and multi-structured table question answering</article-title>
          ,
          <year>2025</year>
          . URL: https://arxiv.org/abs/2506. 03949. arXiv:
          <volume>2506</volume>
          .
          <fpage>03949</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>V.</given-names>
            <surname>Pal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Kanoulas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Yates</surname>
          </string-name>
          , M. de Rijke,
          <article-title>Table question answering for low-resourced Indic languages</article-title>
          , in: Y.
          <string-name>
            <surname>Al-Onaizan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Bansal</surname>
            ,
            <given-names>Y.-N.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Miami, Florida, USA,
          <year>2024</year>
          , pp.
          <fpage>75</fpage>
          -
          <lpage>92</lpage>
          . URL: https://aclanthology.org/
          <year>2024</year>
          .emnlp-main.5/. doi:
          <volume>10</volume>
          . 18653/v1/
          <year>2024</year>
          .emnlp-main.
          <volume>5</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>J. O.</given-names>
            <surname>Grijalba</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. A. U.</given-names>
            <surname>López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Camacho-Collados</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Cámara</surname>
          </string-name>
          ,
          <article-title>Towards quality benchmarking in question answering over tabular data in spanish</article-title>
          ,
          <source>Proces. del Leng. Natural</source>
          <volume>73</volume>
          (
          <year>2024</year>
          )
          <fpage>283</fpage>
          -
          <lpage>296</lpage>
          . URL: http://journal.sepln.org/sepln/ojs/ojs/index.php/pln/article/view/6617.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>