Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLogic-level Evidence Retrieval and Graph-based Verification Network for Table-based Fact Verification
شبكة تسجيل الأدلة على مستوى المنطق وشبكة التحقق المستندة إلى الرسم البياني للتحقق من الحقائق المستندة إلى الجدول
542
0 0
0.0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
تهدف مهمة التحقق من الحقائق القائمة على الطاولة إلى التحقق مما إذا كان البيان المحدد مدعوم من الجدول شبه المنظم المحدد. يلعب المنطق الرمزي مع العمليات المنطقية دورا حاسما في هذه المهمة. الأساليب الحالية الاستفادة من البرامج التي تحتوي على معلومات منطقية غنية لتعزيز عملية التحقق. ومع ذلك، نظرا لعدم وجود إشارات خاضعة للإشراف بالكامل في عملية توليد البرنامج، يمكن استخلاص البرامج الزائفة وعملها، مما يؤدي إلى عدم قدرة النموذج على العمليات المنطقية المفيدة. لمعالجة المشكلات المذكورة أعلاه، في هذا العمل، نقوم بصياغة مهمة التحقق من الحقائق القائمة على الطاولة كإطار لاسترجاع الأدلة والتفكير، حيث اقترح شبكة التحقق من الأدلة على مستوى المنطق وشبكة التحقق القائمة على الرسم البياني (LERGV). على وجه التحديد، نقوم أولا باسترجئة الأدلة التي تشبه البرامج على مستوى المنطق من الجدول المعطى والبيان كدليل تكميلي على الطاولة. بعد ذلك، نقوم بإنشاء رسم بياني لمستوى منطقي لالتقاط العلاقات المنطقية بين الكيانات والوظائف في الأدلة المستردة، وتصميم شبكة التحقق القائمة على الرسم البياني لإجراء المنطق المستندة إلى الرسم البياني على مستوى المنطق بناء على الرسم البياني الذي تم إنشاؤه لتصنيف النهائي علاقة استقامة. النتائج التجريبية على Tabract Tabract القياسي على نطاق واسع تظهر فعالية النهج المقترح.
Table-based fact verification task aims to verify whether the given statement is supported by the given semi-structured table. Symbolic reasoning with logical operations plays a crucial role in this task. Existing methods leverage programs that contain rich logical information to enhance the verification process. However, due to the lack of fully supervised signals in the program generation process, spurious programs can be derived and employed, which leads to the inability of the model to catch helpful logical operations. To address the aforementioned problems, in this work, we formulate the table-based fact verification task as an evidence retrieval and reasoning framework, proposing the Logic-level Evidence Retrieval and Graph-based Verification network (LERGV). Specifically, we first retrieve logic-level program-like evidence from the given table and statement as supplementary evidence for the table. After that, we construct a logic-level graph to capture the logical relations between entities and functions in the retrieved evidence, and design a graph-based verification network to perform logic-level graph-based reasoning based on the constructed graph to classify the final entailment relation. Experimental results on the large-scale benchmark TABFACT show the effectiveness of the proposed approach.
References used
https://aclanthology.org/
rate research
Read More
Tables provide valuable knowledge that can be used to verify textual statements. While a number of works have considered table-based fact verification, direct alignments of tabular data with tokens in textual statements are rarely available. Moreover
, training a generalized fact verification model requires abundant labeled training data. In this paper, we propose a novel system to address these problems. Inspired by counterfactual causality, our system identifies token-level salience in the statement with probing-based salience estimation. Salience estimation allows enhanced learning of fact verification from two perspectives. From one perspective, our system conducts masked salient token prediction to enhance the model for alignment and reasoning between the table and the statement. From the other perspective, our system applies salience-aware data augmentation to generate a more diverse set of training instances by replacing non-salient terms. Experimental results on TabFact show the effective improvement by the proposed salience-aware learning techniques, leading to the new SOTA performance on the benchmark.
The next generation of conversational AI systems need to: (1) process language incrementally, token-by-token to be more responsive and enable handling of conversational phenomena such as pauses, restarts and self-corrections; (2) reason incrementally
allowing meaning to be established beyond what is said; (3) be transparent and controllable, allowing designers as well as the system itself to easily establish reasons for particular behaviour and tailor to particular user groups, or domains. In this short paper we present ongoing preliminary work combining Dynamic Syntax (DS) - an incremental, semantic grammar framework - with the Resource Description Framework (RDF). This paves the way for the creation of incremental semantic parsers that progressively output semantic RDF graphs as an utterance unfolds in real-time. We also outline how the parser can be integrated with an incremental reasoning engine through RDF. We argue that this DS-RDF hybrid satisfies the desiderata listed above, yielding semantic infrastructure that can be used to build responsive, real-time, interpretable Conversational AI that can be rapidly customised for specific user groups such as people with dementia.
Implicit discourse relation recognition (IDRR) aims to identify logical relations between two adjacent sentences in the discourse. Existing models fail to fully utilize the contextual information which plays an important role in interpreting each loc
al sentence. In this paper, we thus propose a novel graph-based Context Tracking Network (CT-Net) to model the discourse context for IDRR. The CT-Net firstly converts the discourse into the paragraph association graph (PAG), where each sentence tracks their closely related context from the intricate discourse through different types of edges. Then, the CT-Net extracts contextual representation from the PAG through a specially designed cross-grained updating mechanism, which can effectively integrate both sentence-level and token-level contextual semantics. Experiments on PDTB 2.0 show that the CT-Net gains better performance than models that roughly model the context.
Precise information of word boundary can alleviate the problem of lexical ambiguity to improve the performance of natural language processing (NLP) tasks. Thus, Chinese word segmentation (CWS) is a fundamental task in NLP. Due to the development of p
re-trained language models (PLM), pre-trained knowledge can help neural methods solve the main problems of the CWS in significant measure. Existing methods have already achieved high performance on several benchmarks (e.g., Bakeoff-2005). However, recent outstanding studies are limited by the small-scale annotated corpus. To further improve the performance of CWS methods based on fine-tuning the PLMs, we propose a novel neural framework, LBGCN, which incorporates a lexicon-based graph convolutional network into the Transformer encoder. Experimental results on five benchmarks and four cross-domain datasets show the lexicon-based graph convolutional network successfully captures the information of candidate words and helps to improve performance on the benchmarks (Bakeoff-2005 and CTB6) and the cross-domain datasets (SIGHAN-2010). Further experiments and analyses demonstrate that our proposed framework effectively models the lexicon to enhance the ability of basic neural frameworks and strengthens the robustness in the cross-domain scenario.
Recent work on aspect-level sentiment classification has employed Graph Convolutional Networks (GCN) over dependency trees to learn interactions between aspect terms and opinion words. In some cases, the corresponding opinion words for an aspect term
cannot be reached within two hops on dependency trees, which requires more GCN layers to model. However, GCNs often achieve the best performance with two layers, and deeper GCNs do not bring any additional gain. Therefore, we design a novel selective attention based GCN model. On one hand, the proposed model enables the direct interaction between aspect terms and context words via the self-attention operation without the distance limitation on dependency trees. On the other hand, a top-k selection procedure is designed to locate opinion words by selecting k context words with the highest attention scores. We conduct experiments on several commonly used benchmark datasets and the results show that our proposed SA-GCN outperforms strong baseline models.
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
