arXiv (All)
open access
TELLER: Dual-Path Iterative Preference Optimization for Table Entity Linking
Entity linking in tables matches short and ambiguous cell mentions to their corresponding knowledge-base entities. Existing approaches typically rely on data preprocessing pipelines that retain either compact or extensive table content as contextual evidence, and then formulate entity linking as a l
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Beyond Correctness: Evaluating Semantic Knowledge in Cross-Table Transfer#1119171
- Schema-Anchored Latent Reasoning for Semantic Parsing-Based Knowledge Base Question Answering#1034218
- SKIP: a Self-knowledge-guided Step-wise Preference Learning Framework for Concise Reasoning#1123424
- Causal-Counterfactual RAG: The Integration of Causal-Counterfactual Reasoning into RAG#925810
- CORE-T: COherent REtrieval of Tables for Text-to-SQL#248638
Record · ID 1129347
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive