Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Graph-Based Neural Model for End-to-End Frame Semantic Parsing
نموذج عصبي مقره الرسم البياني لتحليل الإطار الدلالي نهاية إلى نهاية
365
0 0
0.0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
يعد تحليل الإطار الدلالي مهمة تحليل دلالية تعتمد على Framenet التي تلقت اهتماما كبيرا مؤخرا.تتضمن المهمة عادة ثلاث مجموعات فرعية بالتتابع: (1) التعرف المستهدف، (2) تصنيف الإطار و (3) وصف الدور الدليمي.ترتبط المهارات الفرعية الثلاثة ارتباطا وثيقا أثناء وجود دراسات سابقة طرازها بشكل فردي، مما يتجاهل اتصالاتهم المتدربين، وفي الوقت نفسه يحث مشكلة نشر الأخطاء.في هذا العمل، نقترح نموذج عصبي نهاية إلى نهائي لمعالجة المهمة بشكل مشترك.بشكل ملموس، استغلنا طريقة قائمة على الرسم البياني، فيما يتعلق بتحليل الإطار الدلالي كمشكلة بناء الرسم البياني.يتم التعامل مع جميع المسندات والأدوار كجزء رسم بياني، ويتم أخذ علاقاتهم كحواف رسم بياني.نتائج التجربة على مجموعة بيانات قياسية من الإطار الدلالي تظهر أن طريقتنا تنافسية للغاية، مما يؤدي إلى أداء أفضل من نماذج خطوط الأنابيب.
Frame semantic parsing is a semantic analysis task based on FrameNet which has received great attention recently. The task usually involves three subtasks sequentially: (1) target identification, (2) frame classification and (3) semantic role labeling. The three subtasks are closely related while previous studies model them individually, which ignores their intern connections and meanwhile induces error propagation problem. In this work, we propose an end-to-end neural model to tackle the task jointly. Concretely, we exploit a graph-based method, regarding frame semantic parsing as a graph construction problem. All predicates and roles are treated as graph nodes, and their relations are taken as graph edges. Experiment results on two benchmark datasets of frame semantic parsing show that our method is highly competitive, resulting in better performance than pipeline models.
References used
https://aclanthology.org/
rate research
Read More
In this paper, we propose a globally normalized model for context-free grammar (CFG)-based semantic parsing. Instead of predicting a probability, our model predicts a real-valued score at each step and does not suffer from the label bias problem. Exp
eriments show that our approach outperforms locally normalized models on small datasets, but it does not yield improvement on a large dataset.
Most previous studies on information status (IS) classification and bridging anaphora recognition assume that the gold mention or syntactic tree information is given (Hou et al., 2013; Roesiger et al., 2018; Hou, 2020; Yu and Poesio, 2020). In this p
aper, we propose an end-to-end neural approach for information status classification. Our approach consists of a mention extraction component and an information status assignment component. During the inference time, our system takes a raw text as the input and generates mentions together with their information status. On the ISNotes corpus (Markert et al., 2012), we show that our information status assignment component achieves new state-of-the-art results on fine-grained IS classification based on gold mentions. Furthermore, our system performs significantly better than other baselines for both mention extraction and fine-grained IS classification in the end-to-end setting. Finally, we apply our system on BASHI (Roesiger, 2018) and SciCorp (Roesiger, 2016) to recognize referential bridging anaphora. We find that our end-to-end system trained on ISNotes achieves competitive results on bridging anaphora recognition compared to the previous state-of-the-art system that relies on syntactic information and is trained on the in-domain datasets (Yu and Poesio, 2020).
The dominant paradigm for semantic parsing in recent years is to formulate parsing as a sequence-to-sequence task, generating predictions with auto-regressive sequence decoders. In this work, we explore an alternative paradigm. We formulate semantic
parsing as a dependency parsing task, applying graph-based decoding techniques developed for syntactic parsing. We compare various decoding techniques given the same pre-trained Transformer encoder on the TOP dataset, including settings where training data is limited or contains only partially-annotated examples. We find that our graph-based approach is competitive with sequence decoders on the standard setting, and offers significant improvements in data efficiency and settings where partially-annotated data is available.
AM dependency parsing is a method for neural semantic graph parsing that exploits the principle of compositionality. While AM dependency parsers have been shown to be fast and accurate across several graphbanks, they require explicit annotations of t
he compositional tree structures for training. In the past, these were obtained using complex graphbank-specific heuristics written by experts. Here we show how they can instead be trained directly on the graphs with a neural latent-variable model, drastically reducing the amount and complexity of manual heuristics. We demonstrate that our model picks up on several linguistic phenomena on its own and achieves comparable accuracy to supervised training, greatly facilitating the use of AM dependency parsing for new sembanks.
This tutorial surveys the latest technical progress of syntactic parsing and the role of syntax in end-to-end natural language processing (NLP) tasks, in which semantic role labeling (SRL) and machine translation (MT) are the representative NLP tasks
that have always been beneficial from informative syntactic clues since a long time ago, though the advance from end-to-end deep learning models shows new results. In this tutorial, we will first introduce the background and the latest progress of syntactic parsing and SRL/NMT. Then, we will summarize the key evidence about the syntactic impacts over these two concerning tasks, and explore the behind reasons from both computational and linguistic backgrounds.
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
