Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userExtend, don't rebuild: Phrasing conditional graph modification as autoregressive sequence labelling
تمديد، لا إعادة بناء: صيغة الرسم البياني الشرطي التعديل كوسسل تسلسل تلقائي
297
0 0
0.0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
أصبحت الرسوم البيانية المستمدة وتعديل الرسوم البيانية من نص اللغة الطبيعية تقنية أساس متعدد الاستخدامات لاستخراج المعلومات مع التطبيقات في العديد من المواد الفرعية، مثل بناء الرسم البياني الدلالي أو المعرفة الرسم البياني. استخدم العمل الأخير هذه التقنية لتعديل الرسوم البيانية المشهد (هو et al. 2020)، من خلال الترميز أولا الرسم البياني الأصلي ثم إنشاء واحد المعدلة بناء على هذا الترميز. في هذا العمل، نوضح أنه يمكننا زيادة الأداء بشكل كبير في هذه المشكلة من خلال صياغة ذلك كملحق رسم بياني بدلا من جيل الرسم البياني. نقترح النموذج الأول لمشكلة امتداد الرسم البياني الناتج استنادا إلى وضع العلامات التسلسل التلقائي. في مجموعات بيانات تعديل الرسم البياني المشهد، يؤدي هذا الصيانة إلى تحسينات في الدقة على أحدث من بين الفنين بين 13 نقطة مئوية 24 نقطة. علاوة على ذلك، نقدم بيانات جديدة مجموعة من المجال الطبي الطبيعي والتي لديها تقلب لغوي أكبر بكثير ورسم رسوم بيانية أكثر تعقيدا من مجموعات بيانات تعديل الرسم البياني المشهد. بالنسبة إلى مجموعة البيانات هذه، فشلت حالة الفن في التعميم، في حين أن طرازنا يمكن أن ينتج تنبؤات ذات مغزى.
Deriving and modifying graphs from natural language text has become a versatile basis technology for information extraction with applications in many subfields, such as semantic parsing or knowledge graph construction. A recent work used this technique for modifying scene graphs (He et al. 2020), by first encoding the original graph and then generating the modified one based on this encoding. In this work, we show that we can considerably increase performance on this problem by phrasing it as graph extension instead of graph generation. We propose the first model for the resulting graph extension problem based on autoregressive sequence labelling. On three scene graph modification data sets, this formulation leads to improvements in accuracy over the state-of-the-art between 13 and 24 percentage points. Furthermore, we introduce a novel data set from the biomedical domain which has much larger linguistic variability and more complex graphs than the scene graph modification data sets. For this data set, the state-of-the art fails to generalize, while our model can produce meaningful predictions.
References used
https://aclanthology.org/
rate research
Read More
Complex natural language applications such as speech translation or pivot translation traditionally rely on cascaded models. However,cascaded models are known to be prone to error propagation and model discrepancy problems. Furthermore, there is no p
ossibility of using end-to-end training data in conventional cascaded systems, meaning that the training data most suited for the task cannot be used.Previous studies suggested several approaches for integrated end-to-end training to overcome those problems, however they mostly rely on(synthetic or natural) three-way data. We propose a cascaded model based on the non-autoregressive Transformer that enables end-to-end training without the need for an explicit intermediate representation. This new architecture (i) avoids unnecessary early decisions that can cause errors which are then propagated throughout the cascaded models and (ii) utilizes the end-to-end training data directly. We conduct an evaluation on two pivot-based machine translation tasks, namely French→German and German→Czech. Our experimental results show that the proposed architecture yields an improvement of more than 2 BLEU for French→German over the cascaded baseline.
A mind-map is a diagram that represents the central concept and key ideas in a hierarchical way. Converting plain text into a mind-map will reveal its key semantic structure and be easier to understand. Given a document, the existing automatic mind-m
ap generation method extracts the relationships of every sentence pair to generate the directed semantic graph for this document. The computation complexity increases exponentially with the length of the document. Moreover, it is difficult to capture the overall semantics. To deal with the above challenges, we propose an efficient mind-map generation network that converts a document into a graph via sequence-to-graph. To guarantee a meaningful mind-map, we design a graph refinement module to adjust the relation graph in a reinforcement learning manner. Extensive experimental results demonstrate that the proposed approach is more effective and efficient than the existing methods. The inference time is reduced by thousands of times compared with the existing methods. The case studies verify that the generated mind-maps better reveal the underlying semantic structures of the document.
Sentence fusion is a conditional generation task that merges several related sentences into a coherent one, which can be deemed as a summary sentence. The importance of sentence fusion has long been recognized by communities in natural language gener
ation, especially in text summarization. It remains challenging for a state-of-the-art neural abstractive summarization model to generate a well-integrated summary sentence. In this paper, we explore the effective sentence fusion method in the context of text summarization. We propose to build an event graph from the input sentences to effectively capture and organize related events in a structured way and use the constructed event graph to guide sentence fusion. In addition to make use of the attention over the content of sentences and graph nodes, we further develop a graph flow attention mechanism to control the fusion process via the graph structure. When evaluated on sentence fusion data built from two summarization datasets, CNN/DaliyMail and Multi-News, our model shows to achieve state-of-the-art performance in terms of Rouge and other metrics like fusion rate and faithfulness.
The task of dialogue rewriting aims to reconstruct the latest dialogue utterance by copying the missing content from the dialogue context. Until now, the existing models for this task suffer from the robustness issue, i.e., performances drop dramatic
ally when testing on a different dataset. We address this robustness issue by proposing a novel sequence-tagging-based model so that the search space is significantly reduced, yet the core of this task is still well covered. As a common issue of most tagging models for text generation, the model's outputs may lack fluency. To alleviate this issue, we inject the loss signal from BLEU or GPT-2 under a REINFORCE framework. Experiments show huge improvements of our model over the current state-of-the-art systems when transferring to another dataset.
This paper describes a system proposed for the IWPT 2021 Shared Task on Parsing into Enhanced Universal Dependencies (EUD). We propose a Graph Rewriting based system for computing Enhanced Universal Dependencies, given the Basic Universal Dependencies (UD).
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
