Search Results for author:
Found 9 papers, 3 papers with code
Dual-Channel Evidence Fusion for Fact Verification over Texts and Tables
Different from previous fact extraction and verification tasks that only consider evidence of a single format, FEVEROUS brings further challenges by extending the evidence format to both plain text and tables.
An Empirical Study of Pre-trained Language Models in Simple Knowledge Graph Question Answering
Large-scale pre-trained language models (PLMs) such as BERT have recently achieved great success and become a milestone in natural language processing (NLP).
Evaluation of ChatGPT as a Question Answering System for Answering Complex Questions
As ChatGPT covers resources such as Wikipedia and supports natural language question answering, it has garnered attention as a potential replacement for traditional knowledge based question answering (KBQA) models.
Ranked #1 on
Question Answering
on GraphQuestions
HiCLRE: A Hierarchical Contrastive Learning Framework for Distantly Supervised Relation Extraction
In this paper, we propose a hierarchical contrastive learning Framework for Distantly Supervised relation extraction (HiCLRE) to reduce noisy sentences, which integrate the global structural information and local fine-grained interaction.
DKPLM: Decomposable Knowledge-enhanced Pre-trained Language Model for Natural Language Understanding
Knowledge-Enhanced Pre-trained Language Models (KEPLMs) are pre-trained models with relation triples injecting from knowledge graphs to improve language understanding abilities.
Benchmarking off-the-shelf statistical shape modeling tools in clinical applications
Statistical shape modeling (SSM) is widely used in biology and medicine as a new generation of morphometric approaches for the quantitative analysis of anatomical shapes.
Graph Matching with Anchor Nodes: A Learning Approach
In this paper, we consider the weighted graph matching problem with partially disclosed correspondences between a number of anchor nodes.
Distributable Consistent Multi-Object Matching
In this paper we propose an optimization-based framework to multiple object matching.
Stable and Informative Spectral Signatures for Graph Matching
We also introduce the pairwise heat kernel distance as a stable second order compatibility term; we justify its plausibility by showing that in a certain limiting case it converges to the classical adjacency matrix-based second order compatibility function.
