paper-with-me

홈 › Papers

Improving Semantic Matching through Dependency-Enhanced Pre-trained Model with Adaptive Fusion

2022-10-16 · Jian Song, Di Liang, Rumei Li, Yuntao Li, Sirui Wang, Minlong Peng, Wei Wu, Yongxin Yu

Transformer-based pre-trained models like BERT have achieved great progress on Semantic Sentence Matching. Meanwhile, dependency prior knowledge has also shown general benefits in multiple NLP tasks. However, how to efficiently integrate dependency prior structure into pre-trained models to better model complex semantic matching relations is still unsettled. In this paper, we propose the \textbf{D}ependency-Enhanced \textbf{A}daptive \textbf{F}usion \textbf{A}ttention (\textbf{DAFA}), which explicitly introduces dependency structure into pre-trained models and adaptively fuses it with semantic information. Specifically, \textbf{\emph{(i)}} DAFA first proposes a structure-sensitive paradigm to construct a dependency matrix for calibrating attention weights. It adopts an adaptive fusion module to integrate the obtained dependency information and the original semantic signals. Moreover, DAFA reconstructs the attention calculation flow and provides better interpretability. By applying it on BERT, our method achieves state-of-the-art or competitive performance on 10 public datasets, demonstrating the benefits of adaptively fusing dependency structure in semantic matching task.

📄 PDF Abstract BibTeX arXiv:2210.08471

Code (0)

등록된 구현이 없습니다.

Tasks

Sentence

Methods 이 논문이 사용한 방법론

Multi-Head Attention 설명 없음
Attention 설명 없음
WordPiece 설명 없음
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
Residual Connection 설명 없음
Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Adam 설명 없음

Similar Papers 제목 키워드 기반

StructCoh: Structured Contrastive Learning for Context-Aware Text Semantic Matching

2025-09-02 · Chao Xue, Ziyuan Gao arxiv

Text semantic matching requires nuanced understanding of both structural relationships and fine-grained semantic distinctions. While pre-trained language models excel at capturing token-level interactions, they often ove…

Contrastive LearningDependency Parsing

Dependency Graph Parsing as Sequence Labeling

2024-10-23 · Ana Ezquerro, David Vilares, Carlos Gómez-Rodríguez

Various linearizations have been proposed to cast syntactic dependency parsing as sequence labeling. However, these approaches do not support more complex graph-based representations, such as semantic dependencies or enh…

Dependency Parsing

A graph-based analysis of semantic types and coercion in contextualized word embeddings

2026-05-22 · Long Chen, Deniz Ekin Yavas arxiv

Semantic type mismatch between a noun and its context is central to coercion phenomena. This paper introduces a graph-based method to examine how lexical and contextual type information is reflected in word embeddings. W…

The ADAPT Enhanced Dependency Parser at the IWPT 2020 Shared Task

2020-09-03 · WS 2020 7 · James Barry, Joachim Wagner, Jennifer Foster

We describe the ADAPT system for the 2020 IWPT Shared Task on parsing enhanced Universal Dependencies in 17 languages. We implement a pipeline approach using UDPipe and UDPipe-future to provide initial levels of annotati…

ProtoEM: A Prototype-Enhanced Matching Framework for Event Relation Extraction

2023-09-22 · Zhilei Hu, Zixuan Li, Daozhu Xu, Long Bai 외

Event Relation Extraction (ERE) aims to extract multiple kinds of relations among events in texts. However, existing methods singly categorize event relations as different classes, which are inadequately capturing the in…

Event Relation ExtractionGraph Neural NetworkRelationRelation Extraction