Ting Liu, Zhihan Zhou, Han Liu, Wanxiang Che, Sample, Yutai Hou, Yongkui Lai, Yijia Liu
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In this paper, we explore the slot tagging with only a few labeled support sentences (a.k.a. few-shot). Few-shot slot tagging faces a unique challenge compared to the other fewshot classification problems as it calls for modeling the dependencies between labels. But it is hard to apply previously learned label dependencies to an unseen domain, due to the discrepancy of label sets. To tackle this, we introduce a collapsed dependency transfer mechanism into the conditional random field (CRF) to transfer abstract label dependency patterns as transition scores. In the few-shot setting, the emission score of CRF can be calculated as a word's similarity to the representation of each label. To calculate such similarity, we propose a Label-enhanced Task-Adaptive Projection Network (L-TapNet) based on the stateof-the-art few-shot classification model -Tap-Net, by leveraging label name semantics in representing labels. Experimental results show that our model significantly outperforms the strongest few-shot learning baseline by 14.64 F1 scores in the one-shot setting. 1
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.05702")
get_code_for_paper("2006.05702")
have("2006.05702")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.05702.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.05702)
Connect an agent — have() is free.