تصف هذه الورقة النظام المستخدم للكشف عن الفكاهة في النص.يستخدم النظام الذي طوره فريق Techssn تقنيات التصنيف الثنائية لتصنيف النص.تخضع البيانات للبيانات المعالجة المسبقة وتعطى لكولبرت (التفاعل المتأخر السياسي على بيرت)، وهو تعديل تمثيل التشفير ثنائي الاتجاه من المحولات (بيرت).يتم إعادة تدريب النموذج ويتم تعلم الأوزان في DataSet.تم تطوير هذا النظام للمهمة 7 من المسابقة، Semeval 2021.
This paper describes the system used for detecting humor in text. The system developed by the team TECHSSN uses binary classification techniques to classify the text. The data undergoes preprocessing and is given to ColBERT (Contextualized Late Interaction over BERT), a modification of Bidirectional Encoder Representations from Transformers (BERT). The model is re-trained and the weights are learned for the dataset. This system was developed for the task 7 of the competition, SemEval 2021.
References used
https://aclanthology.org/
SemEval 2021 Task 7, HaHackathon, was the first shared task to combine the previously separate domains of humor detection and offense detection. We collected 10,000 texts from Twitter and the Kaggle Short Jokes dataset, and had each annotated for hum
Humor recognition is a challenging task in natural language processing. This document presents my approaches to detect and rate humor and offense from the given text. This task includes 2 tasks: task 1 which contains 3 subtasks (1a, 1b, and 1c), and
With the emerging trends of using online platforms, peoples are increasingly interested in express their opinion through humorous texts. Identifying and rating humorous texts poses unique challenges to NLP due to subjective phenomena i.e. humor may v
This paper presents the DuluthNLP submission to Task 7 of the SemEval 2021 competition on Detecting and Rating Humor and Offense. In it, we explain the approach used to train the model together with the process of fine-tuning our model in getting the
This paper describes our contribution to SemEval-2021 Task 7: Detecting and Rating Humor and Of-fense.This task contains two sub-tasks, sub-task 1and sub-task 2. Among them, sub-task 1 containsthree sub-tasks, sub-task 1a ,sub-task 1b and sub-task 1c