From Chart to QA Pairs: A Context-Aware Generation Framework for Chart-Containing Documents

While Large Language Models (LLMs) and Vision Language Models (VLMs) have demonstrated impressive capabilities across various general tasks, developing domain-specific model remains an urgent need. This requires fine-tuning with high-quality data. Extraction of question-answer (QA) pairs from domain knowledge documents is a crucial prerequisite for fine-tuning, especially when these documents containing complex charts and unstructured data. This paper introduces a framework for extracting QA pairs from charts, which combines OCR and VLM to fully leverage contextual information in the documents and generate deep, contextually relevant questions. Our method first uses OCR for initial chart recognition, followed by a VLM-based “Caption-Reflection'' paradigm to reduce misrecognition. We then design a context localization module which combines local and global contexts to generate relevant QA pairs. Additionally, we construct a specialized chart knowledge base to guide the generation of QA pairs. Experimental results show significant improvement in both chart recognition performance and QA pairs generation quality: the average precision increases from 0.52 to 0.90, the average F1 Score improves from 0.64 to 0.94, the average FPR decreases from 0.55 to 0 respectively. The generated QA pairs perform well in terms of statistical relevance and contextual consistency.

Authors

Institutions

Publication Details

Published
2025-02-21
DOI
https://doi.org/10.1145/3728725.3728741
Primary Topic
Semantic Web and Ontologies
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

From Chart to QA Pairs: A Context-Aware Generation Framework for Chart-Containing Documents

Mingang Chen, Zeyu Ma, Qianwen Shen
Semantic Web and Ontologies
article

From Chart to QA Pairs: A Context-Aware Generation Framework for Chart-Containing Documents

Mingang Chen, Zeyu Ma, Qianwen Shen
article en

Abstract

While Large Language Models (LLMs) and Vision Language Models (VLMs) have demonstrated impressive capabilities across various general tasks, developing domain-specific model remains an urgent need. This requires fine-tuning with high-quality data. Extraction of question-answer (QA) pairs from domain knowledge documents is a crucial prerequisite for fine-tuning, especially when these documents containing complex charts and unstructured data. This paper introduces a framework for extracting QA pairs from charts, which combines OCR and VLM to fully leverage contextual information in the documents and generate deep, contextually relevant questions. Our method first uses OCR for initial chart recognition, followed by a VLM-based “Caption-Reflection'' paradigm to reduce misrecognition. We then design a context localization module which combines local and global contexts to generate relevant QA pairs. Additionally, we construct a specialized chart knowledge base to guide the generation of QA pairs. Experimental results show significant improvement in both chart recognition performance and QA pairs generation quality: the average precision increases from 0.52 to 0.90, the average F1 Score improves from 0.64 to 0.94, the average FPR decreases from 0.55 to 0 respectively. The generated QA pairs perform well in terms of statistical relevance and contextual consistency.

Shanghai Polytechnic University (CN), Shanghai Normal University (CN)
Science and Technology Commission of Shanghai Municipality
Openalex Percentile: Top 94%
Semantic Web and Ontologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.