Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLabel-Enhanced Hierarchical Contextualized Representation for Sequential Metaphor Identification
التمثيل التعليمي التسلسل الهرمي لتعزيز التسمية لتحديد استعارة متسلسل
462
0 0
0.0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
نهج تحديد استعارة الحديثة النظر أساسا في ميزات النص السياقية في غضون جملة أو إدخال ميزات لغوية خارجية إلى النموذج. لكنهم عادة ما يتجاهلون المعلومات الإضافية التي يمكن أن توفرها البيانات، مثل معلومات الاستعارة السياقية ومعلومات الخطاب الأوسع نطاقا. في هذه الورقة، نقترح نموذجا تم تزويده بتمثيل سياقي هرمي لاستخراج مزيد من المعلومات من كل من مستوى الجملة ومستوى الخطاب. على مستوى الجملة، نستفيد من معلومات الاستعارة من الكلمات التي تبادل الكلمة المستهدفة في الجملة لتعزيز قدرة المنطق على نموذجنا عبر تمثيل محسن محسن على الملصقات. عند مستوى الخطاب، يتم اعتماد شبكة الذاكرة العالمية التي تدركها لتعلم التبعية بعيدة المدى بين نفس الكلمات داخل خطاب. أخيرا، يجمع نموذجنا بين التمثيلات التي تم الحصول عليها من هذين الجزأين. تظهر نتائج التجربة على مهمتين لمجموعة بيانات VUA أن طرازنا يتفوق على كل طريقة أخرى لا تستخدم أي معرفة خارجية أيضا باستثناء ما يحتوي نموذج اللغة المدربة مسبقا عليه.
Recent metaphor identification approaches mainly consider the contextual text features within a sentence or introduce external linguistic features to the model. But they usually ignore the extra information that the data can provide, such as the contextual metaphor information and broader discourse information. In this paper, we propose a model augmented with hierarchical contextualized representation to extract more information from both sentence-level and discourse-level. At the sentence level, we leverage the metaphor information of words that except the target word in the sentence to strengthen the reasoning ability of our model via a novel label-enhanced contextualized representation. At the discourse level, the position-aware global memory network is adopted to learn long-range dependency among the same words within a discourse. Finally, our model combines the representations obtained from these two parts. The experiment results on two tasks of the VUA dataset show that our model outperforms every other state-of-the-art method that also does not use any external knowledge except what the pre-trained language model contains.
References used
https://aclanthology.org/
rate research
Read More
Recent work on entity coreference resolution (CR) follows current trends in Deep Learning applied to embeddings and relatively simple task-related features. SOTA models do not make use of hierarchical representations of discourse structure. In this w
ork, we leverage automatically constructed discourse parse trees within a neural approach and demonstrate a significant improvement on two benchmark entity coreference-resolution datasets. We explore how the impact varies depending upon the type of mention.
Existing works on information extraction (IE) have mainly solved the four main tasks separately (entity mention recognition, relation extraction, event trigger detection, and argument extraction), thus failing to benefit from inter-dependencies betwe
en tasks. This paper presents a novel deep learning model to simultaneously solve the four tasks of IE in a single model (called FourIE). Compared to few prior work on jointly performing four IE tasks, FourIE features two novel contributions to capture inter-dependencies between tasks. First, at the representation level, we introduce an interaction graph between instances of the four tasks that is used to enrich the prediction representation for one instance with those from related instances of other tasks. Second, at the label level, we propose a dependency graph for the information types in the four IE tasks that captures the connections between the types expressed in an input sentence. A new regularization mechanism is introduced to enforce the consistency between the golden and predicted type dependency graphs to improve representation learning. We show that the proposed model achieves the state-of-the-art performance for joint IE on both monolingual and multilingual learning settings with three different languages.
The use of attention mechanisms in deep learning approaches has become popular in natural language processing due to its outstanding performance. The use of these mechanisms allows one managing the importance of the elements of a sequence in accordan
ce to their context, however, this importance has been observed independently between the pairs of elements of a sequence (self-attention) and between the application domain of a sequence (contextual attention), leading to the loss of relevant information and limiting the representation of the sequences. To tackle these particular issues we propose the self-contextualized attention mechanism, which trades off the previous limitations, by considering the internal and contextual relationships between the elements of a sequence. The proposed mechanism was evaluated in four standard collections for the abusive language identification task achieving encouraging results. It outperformed the current attention mechanisms and showed a competitive performance with respect to state-of-the-art approaches.
Short text classification is a fundamental task in natural language processing. It is hard due to the lack of context information and labeled data in practice. In this paper, we propose a new method called SHINE, which is based on graph neural networ
k (GNN), for short text classification. First, we model the short text dataset as a hierarchical heterogeneous graph consisting of word-level component graphs which introduce more semantic and syntactic information. Then, we dynamically learn a short document graph that facilitates effective label propagation among similar short texts. Thus, comparing with existing GNN-based methods, SHINE can better exploit interactions between nodes of the same types and capture similarities between short texts. Extensive experiments on various benchmark short text datasets show that SHINE consistently outperforms state-of-the-art methods, especially with fewer labels.
The current state-of-the-art model HiAGM for hierarchical text classification has two limitations. First, it correlates each text sample with all labels in the dataset which contains irrelevant information. Second, it does not consider any statistica
l constraint on the label representations learned by the structure encoder, while constraints for representation learning are proved to be helpful in previous work. In this paper, we propose HTCInfoMax to address these issues by introducing information maximization which includes two modules: text-label mutual information maximization and label prior matching. The first module can model the interaction between each text sample and its ground truth labels explicitly which filters out irrelevant information. The second one encourages the structure encoder to learn better representations with desired characteristics for all labels which can better handle label imbalance in hierarchical text classification. Experimental results on two benchmark datasets demonstrate the effectiveness of the proposed HTCInfoMax.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
