A Demonstration System for Faithful Temporal Question Answering
Zhen Jia, Xinghong Hou, Chenyang Jin
Abstract
Temporal question answering (TQA) aims to answer questions that involve temporal constraints or require temporal information. We propose Faith, a novel TQA approach that operates over heterogeneous sources and ensures explainable answers by presenting traceable and faithful evidence. In Faith, we design a new recursive answering mechanism transforming implicit temporal constraints into explicit conditions. Additionally, we visualize the system functionality to track how the answers are computed and the supporting evidence is derived. The code and video of the demonstration system are publicly available.
Create a lesson
Related papers
Cost-Aware Agentic Feature Optimization System for Fleet-Scale Ranking Models
Chang Yang, Yao Xuan, Wendan Yan et al.
Democratizing Cross-Project Knowledge for Transforming Water Governance and Climate Resilience: an Agentic AI Ecosystem
Oriol Alàs, Ian Palacín, Iván Cester et al.
From Sessions to Serving: Integrating LLM-Based Embeddings into Retrieval for Production Content Recommendation
Zhixiong Hu, Meng Li, Maggie Zhang et al.
A Task-Level Bias Taxonomy for Historical Image Retrieval
Omkar Gavali, Ratan Sebastian, Christoph Rippe et al.
LINEAGE: A Benchmark for Empirical Lineage Retrieval in AI Scientific Literature
Pangjing Wu, Xu Yuan, Wenqi Fan et al.
CACO: Coverage-Aware Coordinated Optimization for Continuous Generative Retrieval
Pan Zhang, Nan Zhuang, Yongkang Zhang et al.