TitleAn Enhanced Span-based Decomposition Method for Few-Shot Sequence Labeling
AuthorsWang, Peiyi
Xu, Runxin
Liu, Tianyu
Zhou, Qingyu
Cao, Yunbo
Chang, Baobao
Sui, Zhifang
AffiliationPeking Univ, MOE, Key Lab Computat Linguist, Beijing, Peoples R China
Tencent Cloud Xiaowei, Beijing, Peoples R China
Issue Date2022
PublisherNAACL 2022: THE 2022 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES
AbstractFew-Shot Sequence Labeling (FSSL) is a canonical paradigm for the tagging models, e.g., named entity recognition and slot filling, to generalize on an emerging, resource-scarce domain. Recently, the metric-based meta-learning framework has been recognized as a promising approach for FSSL. However, most prior works assign a label to each token based on the token-level similarities, which ignores the integrality of named entities or slots. To this end, in this paper, we propose ESD, an Enhanced Span-based Decomposition method for FSSL. ESD formulates FSSL as a span-level matching problem between test query and supporting instances. Specifically, ESD decomposes the span matching problem into a series of span-level procedures, mainly including enhanced span representation, class prototype aggregation and span conflicts resolution. Extensive experiments show that ESD achieves the new state-of-the-art results on two popular FSSL benchmarks, FewNERD and SNIPS, and is proven to be more robust in the nested and noisy tagging scenarios. Our code is available at https://github.com/Wangpeiyi9979/ESD.
URIhttp://hdl.handle.net/20.500.11897/657182
ISBN978-1-955917-71-1
IndexedCPCI-SSH(ISSHP)
CPCI-S(ISTP)
Appears in Collections:计算语言学教育部重点实验室

Files in This Work
There are no files associated with this item.

Web of Science®



Checked on Last Week

百度学术™



Checked on Current Time




License: See PKU IR operational policies.