BTPK-based interpretable method for NER tasks based on Talmudic Public Announcement Logic
원문 초록
As one of the basic tasks in natural language processing (NLP), named entity recognition (NER) is an important basic tool for downstream tasks of NLP, such as information extraction, syntactic analysis, machine translation and so on. The internal operation logic of current name entity recognition model is black-box to the user, so the user has no basis to determine which name entity makes more sense. Therefore, a user-friendly explainable recognition process would be very useful for many people. In this paper, we propose a novel interpretable method, BTPK (Binary Talmudic Public Announcement Logic model), to help users understand the internal recognition logic of the name entity recognition tasks based on Talmudic Public Announcement Logic. BTPK model can also capture the semantic information in the input sentences, that is, the context dependency of the sentence. We observed the public announcement of BTPK presents the inner decision logic of BRNNs, and the explanations obtained from a BTPK model show us how BRNNs essentially handle NER tasks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Selecting and Merging: Towards Adaptable and Scalable Named Entity Recognition with Large Language Models
Label-Guided In-Context Learning for Named Entity Recognition
Flippi: End To End GenAI Assistant for E-Commerce
CAPO: Reinforcing Consistent Reasoning in Medical Decision-Making
Better Semi-supervised Learning for Multi-domain ASR Through Incremental Retraining and Data Filtering
Efficient Data Selection for Domain Adaptation of ASR Using Pseudo-Labels and Multi-Stage Filtering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.