Challenge: Existing solutions to expand table names are limited by the abbreviated column names of tables.
Approach: They propose to use abbreviated tables to expand column names . they propose to introduce four new datasets with real-world abbrevations .
Outcome: The proposed solution outperforms NameGuess in terms of accuracy and consistency over five datasets.

Similar Papers

NameGuess: Column Name Expansion for Tabular Data (2023.emnlp-main)

Copied to clipboard

Challenge: Tabular data is used for storing and organizing information in web and enterprise applications.
Approach: They propose a task to expand column names as a natural language generation problem by conditioning on table content and column header names to improve auto-regressive models.
Outcome: The proposed task improves auto-regressive models on table content and column header names to match human performance.
Realistic Training Data Generation and Rule Enhanced Decoding in LLM for NameGuess (2025.emnlp-main)

Copied to clipboard

Challenge: Abbreviated column names often harm downstream tasks, causing performance drops of 10.54, 40.50, and 3.83 percentage points.
Approach: They propose a method that integrates a subsequence abbreviation generator trained on human-annotated data and collects non-subsequent abbrevations to improve the training set.
Outcome: The proposed approach improves on the English NameGuess task and surpasses state-of-the-art LLMs.
CodeTaxo: Enhancing Taxonomy Expansion with Limited Examples via Code Language Prompts (2025.findings-acl)

Copied to clipboard

Challenge: Existing taxonomies are mainly constructed by experts or through crowd-sourcing, making the process time-consuming, labor-intensive, and restricted in coverage.
Approach: They propose a method that leverages large language models to capture taxonomic structure . existing taxonomies are mainly constructed by experts or through crowd-sourcing .
Outcome: Experiments on five real-world domains show that CodeTaxo outperforms state-of-the-art methods.
Structured abbreviation expansion in context (2021.findings-emnlp)

Copied to clipboard

Challenge: Ad hoc abbreviations are commonly found in informal communication channels that favor shorter messages.
Approach: They propose to reverse ad hoc abbreviations in context to recover normalized, expanded versions of abbrevated messages.
Outcome: The proposed method can recover normalized, expanded abbreviations from text . it is similar to spelling correction, but requires more extensive work .
Expanding Abbreviations in a Strongly Inflected Language: Are Morphosyntactic Tags Sufficient? (L18-1)

Copied to clipboard

Challenge: In this paper, the problem of recovery of morphological information lost in abbreviated forms is addressed . correct inflected form of expanded abbrevation can be deduced from context words .
Approach: They propose a deep bidirectional LSTM network with tag embedding to predict abbreviated words . they train on 10 million words from the Polish Sejm Corpus and achieve 74.2% prediction accuracy .
Outcome: The proposed model achieves 74.2% accuracy on a smaller but more general corpus of Polish words.
Abbreviation Expander - a Web-based System for Easy Reading of Technical Documents (C18-2)

Copied to clipboard

Challenge: Existing abbreviation expansion systems or tools require technical knowledge to set up . existing systems require strong assumptions and are limited in their usefulness .
Approach: They propose a web-based system that automatically expands abbreviations and acronyms in a user provided document.
Outcome: The proposed system expands abbreviations and acronyms automatically in a user provided document.
Bridging the Generalization Gap in Text-to-SQL Parsing with Schema Expansion (2022.acl-long)

Copied to clipboard

Challenge: Existing text-to-SQL parsers struggle with out-of-domain generalization problems, arguing that they lack the ability to match domain specific phrases to composite operations over columns.
Approach: They propose to use a synthetic dataset and a re-purposed train/test split to quantify out-of-domain generalization over column operations to address this problem.
Outcome: The proposed method outperforms baseline parsers on the domain generalization problem, while boosting the underlying parser’ overall performance by 13.8% relative accuracy gain (5.1% absolute).
AIGT: AI Generative Table Based on Prompt (2025.coling-main)

Copied to clipboard

Challenge: Tabular data is an essential resource for many fields, but current methods do not fully utilize the rich information available in tables.
Approach: They propose a method that utilizes metadata information to generate tabular data . they propose long-token partitioning algorithms that enable AIGT to model tables of any scale .
Outcome: The proposed approach achieves state-of-the-art on 14 out of 20 public datasets and two real industry datasets within the Alipay risk control system.
Character-level Language Models for Abbreviation and Long-form Detection (2024.lrec-main)

Copied to clipboard

Challenge: Abbreviations and long forms are textual elements that are present in scientific communication . non-recognition of abbreviation and long form can lead to a negative impact on information retrieval .
Approach: They propose to train and test language models for automatically identifying abbreviations and long forms . they use existing datasets annotated with abbrevations and their associated long forms to test them .
Outcome: The proposed model can detect abbreviations and long forms on biomedical data . the proposed model improves on a previously untested dataset with biomedically-annotated datasets .
Experiments with ad hoc ambiguous abbreviation expansion (D19-62)

Copied to clipboard

Challenge: ad hoc abbreviations are difficult to interpret for patients and nonspecialists.
Approach: They propose to use morphologically annotated medical notes to expand ad hoc abbreviations without using additional domain resources.
Outcome: The proposed methods outperform the previously proposed methods on Polish data but can be used for other languages.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations