Solving Arithmetic Word Problems of Entailing Deep Implicit Relations by Qualia Syntax-Semantic Model

Solving arithmetic word problems that entail deep implicit relations is still a challenging problem.However,significant progress has been made in solving Arithmetic Word Problems(AWP)over the past six decades.This paper proposes to discover deep implicit relations by qualia inference to solve Arithmetic Word Problems entailing Deep Implicit Relations(DIR-AWP),such as entailing commonsense or subject-domain knowledge involved in the problem-solving process.This paper proposes to take three steps to solve DIR-AWPs,in which the first three steps are used to conduct the qualia inference process.The first step uses the prepared set of qualia-quantity models to identify qualia scenes from the explicit relations extracted by the Syntax-Semantic(S2)method from the given problem.The second step adds missing entities and deep implicit relations in order using the identified qualia scenes and the qualia-quantity models,respectively.The third step distills the relations for solving the given problem by pruning the spare branches of the qualia dependency graph of all the acquired relations.The research contributes to the field by presenting a comprehensive approach combining explicit and implicit knowledge to enhance reasoning abilities.The experimental results on Math23K demonstrate hat the proposed algorithm is superior to the baseline algorithms in solving AWPs requiring deep implicit relations.

FIXED POINT THEOREMS FOR MAPPINGS SATISFYING IMPLICIT RELATION ON TWO COMPLETE AND COMPACT METRIC SPACES

First, the implicit relations were given. A common fixed point theorem was proved for two mappings satisfying implicit relation functions. A further fixed point theorem was proved for mappings satisfying implicit relation functions on two compact metric spaces.

Fixed Point Theorems in Intuitionistics Fuzzy Metric Spaces Using Implicit Relations

In this paper, we proved some fixed point theorems in intuitionistic fuzzy metric spaces applying the properties of weakly compatible mapping and satisfying the concept of implicit relations for t norms and t connorms.

Discriminative explicit instance selection for implicit discourse relation classification

Discourse relation classification is a fundamental task for discourse analysis,which is essential for understanding the structure and connection of texts.Implicit discourse relation classification aims to determine the relationship between adjacent sentences and is very challenging because it lacks explicit discourse connectives as linguistic cues and sufficient annotated training data.In this paper,we propose a discriminative instance selection method to construct synthetic implicit discourse relation data from easy-to-collect explicit discourse relations.An expanded instance consists of an argument pair and its sense label.We introduce the argument pair type classification task,which aims to distinguish between implicit and explicit argument pairs and select the explicit argument pairs that are most similar to natural implicit argument pairs for data expansion.We also propose a simple label-smoothing technique to assign robust sense labels for the selected argument pairs.We evaluate our method on PDTB 2.0 and PDTB 3.0.The results show that our method can consistently improve the performance of the baseline model,and achieve competitive results with the state-of-the-art models.

VQT:value cardinality and query pattern based R-schema to XML schema translation with implicit referential integrity

In this paper,we propose a new relational schema (R-schema) to XML schema translation algorithm, VQT, which analyzes the value cardinality and user query patterns and extracts the implicit referential integrities by using the cardinality property of foreign key constraints between columns and the equi-join characteristic in user queries. The VQT algorithm can apply the extracted implied referential integrity relation information to the R-schema and create an XML schema as the final result. Therefore, the VQT algorithm prevents the R-schema from being incorrectly converted into the XML schema, and it richly and powerfully represents all the information in the R-schema by creating an XML schema as the translation result on behalf of the XML DTD.

Focus-sensitive relation disambiguation for implicit discourse relation detection

We study implicit discourse relation detection,which is one of the most challenging tasks in the field of discourse analysis.We specialize in ambiguous implicit discourse relation,which is an imperceptible linguistic phenomenon and therefore difficult to identify and eliminate.In this paper,we first create a novel task named implicit discourse relation disambiguation(IDRD).Second,we propose a focus-sensitive relation disambiguation model that affirms a truly-correct relation when it is triggered by focal sentence constituents.In addition,we specifically develop a topicdriven focus identification method and a relation search system(RSS)to support the relation disambiguation.Finally,we improve current relation detection systems by using the disambiguation model.Experiments on the penn discourse treebank(PDTB)show promising improvements.

Cross-lingual implicit discourse relation recognition with co-training

A lack of labeled corpora obstructs the research progress on implicit discourse relation recognition （DRR） for Chinese, while there are some available discourse corpora in other languages, such as English. In this paper, we propose a cross-lingual implicit DRR framework that exploits an available English corpus for the Chinese DRR task. We use machine translation to generate Chinese instances from a labeled English discourse corpus. In this way, each instance has two independent views： Chinese and English views. Then we train two classifiers in Chinese and English in a co-training way, which exploits unlabeled Chinese data to implement better implicit DRR for Chinese. Experimental results demonstrate the effectiveness of our method.