Semi-supervised New Slot Discovery with Incremental Clustering (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to discover new slots rely on unsupervised slot induction or domain adaptation, and are limited in transferring prior knowledge to new slots. |
| Approach: | They propose a Semi-supervised Incremental Clustering method to discover new slots with existing linguistic annotation models and limited known slot data. |
| Outcome: | The proposed method significantly outperforms state-of-the-art models on five public datasets. |
Similar Papers
Novel Slot Detection With an Incremental Setting (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Current dialogue systems face diverse user requests and rapid change domains, making quickly adapt to scenarios with previous unseen slot types becomes a major challenge. |
| Approach: | They propose an incremental novel slot detection task which separates the dialogue system to deal with novel types as two major phrases: 1) model discovers unknown slots; 2) training model to possess the capability to handle new classes. |
| Outcome: | The proposed approach overcomes catastrophic forgetting during the process of INSD and is highly effective. |
Discovering Dialogue Slots with Weak Supervision (2021.acl-long)
Copied to clipboard
| Challenge: | Task-oriented dialogue systems typically require manual annotation of dialogue slots in training data. |
| Approach: | They propose a method that uses weak supervision to identify slot candidates and automatically identify domain-relevant slots by using clustering algorithms. |
| Outcome: | The proposed method significantly improves an end-to-end dialogue response generation model compared to using no slot annotation at all. |
Unsupervised Slot Schema Induction for Task-oriented Dialog (2022.naacl-main)
Copied to clipboard
| Challenge: | Defining task-specific schemas is the first step of building a task-oriented dialog system. |
| Approach: | They propose an unsupervised approach for slot schema induction from unlabeled dialog corpora using in-domain language models and unsupervised parsing structures. |
| Outcome: | The proposed method shows significant performance improvement on multi-domain and SGD datasets. |
Novel Slot Detection: A Benchmark for Discovering Unknown Slot Types in the Task-Oriented Dialogue System (2021.acl-long)
Copied to clipboard
| Challenge: | Existing slot filling models can only recognize pre-defined in-domain slot types from a limited slot set. |
| Approach: | They introduce a task, Novel Slot Detection, in the task-oriented dialogue system. |
| Outcome: | The proposed task is based on two public NSD datasets and proposes strong baselines . it aims to identify a sequence of tokens and extract semantic constituents from user queries . |
Explainable Slot Type Attentions to Improve Joint Intent Detection and Slot Filling (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods analyze and compute features collectively for all slot types, and have no way to explain slot filling model decisions. |
| Approach: | They propose a method that learns to generate additional slot type specific features to improve accuracy and provides explanations for slot filling decisions for the first time in a joint NLU model. |
| Outcome: | The proposed model improves on two widely used datasets and provides an explanation for slot filling decisions for the first time. |
A Progressive Model to Enable Continual Learning for Semantic Slot Filling (D19-1)
Copied to clipboard
| Challenge: | Existing approaches to slot filling training on large scale data are inefficient and require multiple trainings. |
| Approach: | They propose a slot filling model that transfers previously learned knowledge to a small size expanded component and enables it to be fast trained to learn from new data. |
| Outcome: | The proposed model outperforms existing models on two benchmark datasets by 4.24% and 3.03% on the same dataset. |
Synergistic Augmentation: Enhancing Cross-Domain Zero-Shot Slot Filling with Small Model-Assisted Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to slot filling are limited due to data scarcity and timeconsuming efforts. |
| Approach: | They propose a framework that harnesses the power of a small model to augment inferential capabilities of LLMs without additional training. |
| Outcome: | The proposed framework improves slot filling performance on a spoken language dataset and a NER dataset. |
Adaptive End-to-End Metric Learning for Zero-Shot Cross-Domain Slot Filling (2023.emnlp-main)
Copied to clipboard
| Challenge: | Recent research on slot filling has witnessed considerable improvement with considerable data and label shifts. |
| Approach: | They propose an adaptive end-to-end metric learning scheme for zero-shot slot filling that uses context-aware soft label representations and slot-level contrastive representation learning to mitigate the data and label shift problems. |
| Outcome: | The proposed approach outperforms existing methods on public benchmarks and shows that it is simple, efficient and generalizable. |
Zero-shot Slot Filling in the Age of LLMs for Dialogue Systems (2025.coling-industry)
Copied to clipboard
| Challenge: | Existing methods for zero-shot slot filling focus on text data, overlooking conversational data. |
| Approach: | They propose a method for automatic data annotation with slot induction and black-box knowledge distillation from a teacher LLM to a smaller model. |
| Outcome: | The proposed method outperforms existing models on internal datasets by 26% relative increase in F1 score. |
Learned Incremental Representations for Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | a new syntactic representation that commits to syntakic choices is proposed for humans . we use a system that uses only incremental processing of a prefix to predict the word in a sentence . |
| Approach: | They propose a syntactic representation that commits to syntakic choices incrementally . they say the system can achieve 93.72 F1 on the Penn Treebank with as few as 5 bits per word . |
| Outcome: | The proposed representation achieves 93.72 F1 on the Penn Treebank with as few as 5 bits per word . the analysis of the representations shows they have interpretable features and deferred resolution of syntactic ambiguities. |