mlsanityData to 7 Oct 2026

LLM-assisted Labeling Function Generation for Semantic Type Detection

arXiv 2408.16173 ↗First posted 28 Aug 2024cs.DB cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Detecting semantic types of columns in data lake tables is an important application. A key bottleneck in semantic type detection is the availability of human annotation due to the inherent complexity of data lakes. In this paper, we propose using programmatic weak supervision to assist in annotating the training data for semantic type detection by leveraging labeling functions. One challenge in this process is the difficulty of manually writing labeling functions due to the large volume and low quality of the data lake table datasets. To address this issue, we explore employing Large Language Models (LLMs) for labeling function generation and introduce several prompt engineering strategies for this purpose. We conduct experiments on real-world web table datasets. Based on the initial results, we perform extensive analysis and provide empirical insights and future directions for researchers in this field.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 8 of its 18 references that are in the map. First posted on arXiv 28 Aug 2024.

Builds on

8 of 18 references.

References · 8

  1. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  2. 2017Snorkel: Rapid Training Data Creation with Weak Supervisioncited by 370
  3. 2016Data Programming: Creating Large Training Sets, Quicklycited by 246
  4. 2021WRENCH: A Comprehensive Benchmark for Weak Supervisioncited by 95
  5. 2022A Survey on Programmatic Weak Supervisioncited by 66
  6. 2022Nemo: Guiding and Contextualizing Weak Supervision for Interactive Data Programmingcited by 10
  7. 2022Machop: an End-to-End Generalized Entity Matching Frameworkcited by 6
  8. 2023Can Large Language Models Design Accurate Label Functions?cited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.