用三元组显式表达表格语义,让大模型更高效理解复杂表格。
Semantic Triplet Restoration: A Novel Protocol for Hierarchical Table Understanding in Large Language Models

- 将每格数据转为<实体路径, 属性路径, 值>三元组,显式表达层级关系
- 在4个中英文表格问答基准上性能持平或超越传统方法,输入更短
- 适合资源受限模型和长表格场景,尤其对小模型提升显著
表格问答需模型从二维布局、合并单元格和层级表头中恢复隐含语义关系。现有流程通常使用HTML或Markdown作为中间表示,但这类布局序列化引入标记开销,且要求大模型从行列跨度推断表头-单元格对齐。我们提出语义三元组还原(STR)协议,将每个单元格重写为原子事实 <项目路径, 特征路径, 值>,其中项目路径标识行级实体,特征路径指定层级属性,值包含单元格内容。同时提出轻量级查询感知路由器 TripletQL,利用STR选择适配问题的三元组渲染或过滤子集。在四个中英文表格问答基准上,STR达到或优于基于HTML的基线,同时减少输入令牌数。相对收益在小型语言模型和长表格上下文下更显著,表明显式语义表示在计算资源受限时尤为有效。代码与数据见:https://github.com/Phoenix-ni/STR.git。
原文摘要 · Abstract (English)
Table question answering requires models to recover semantic relations encoded implicitly by two-dimensional layout, merged cells, and hierarchical headers. Current pipelines typically use HTML or Markdown as intermediate table representations, but these layout-oriented serializations introduce markup overhead and require large language models to infer header-cell alignments from row and column spans. We propose Semantic Triplet Restoration (STR), a protocol that rewrites each cell as an atomic fact <item path, feature path, value>, where the item path specifies the row-wise entity, the feature path specifies the hierarchical attribute, and the value contains the cell content. We also present TripletQL, a lightweight query-aware router that uses STR to select an appropriate rendering or filtered subset of triplets for each question. Across four Chinese and English table-QA benchmarks, STR matches or improves upon HTML-based baselines while reducing input tokens. The relative benefit grows for smaller language models and longer table contexts, suggesting that explicit semantic representations are especially useful under constrained inference budgets. Code and data are available at https://github.com/Phoenix-ni/STR.git .
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。