Hybrid graph structure learning for improving semantic dependency parsing with robust graph neural networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F26%3A39KZ5WTB" target="_blank" >RIV/00216208:11320/26:39KZ5WTB - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S0925231225011543#b66" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0925231225011543#b66</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.neucom.2025.130482" target="_blank" >10.1016/j.neucom.2025.130482</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Hybrid graph structure learning for improving semantic dependency parsing with robust graph neural networks

Popis výsledku v původním jazyce

Graph neural networks (GNN) can learn powerful representations of graphs, but their effectiveness is heavily influenced by the quality of the graph structure used. Graph structure learning (GSL) was developed to extract useful graph structures from data and learn better graph representations using GNN. GSL creates an adjacency matrix with two multilayer perceptrons and a biaffine attention network. However, it does not directly incorporate the principles of homophily, sparsity, and degree distribution, which are important in many real-life situations. Differentiable graph structure learning neural networks (DGSLN), which adhere to these basic principles, have been proven to improve GNN performance. This study proposes a GNN-based semantic dependency parsing model that incorporates the GSL adapted from the DGSLN approach to generate an initial graph. For the graph representation learning stage, we use GNN variants, GIN and GATv2, which have shown robust performance in previous research. The proposed model significantly improves previous best models, achieving an average F1 score of 93.77% on in-domain and 92.27% on out-of-domain datasets. However, our model's parsing performance is slower than prior top-performing models. The model utilizing GIN exhibits the highest level of performance and shows exceptional performance in semantic dependency parsing on English datasets. © 2025 Elsevier B.V.

Název v anglickém jazyce

Hybrid graph structure learning for improving semantic dependency parsing with robust graph neural networks

Popis výsledku anglicky

Graph neural networks (GNN) can learn powerful representations of graphs, but their effectiveness is heavily influenced by the quality of the graph structure used. Graph structure learning (GSL) was developed to extract useful graph structures from data and learn better graph representations using GNN. GSL creates an adjacency matrix with two multilayer perceptrons and a biaffine attention network. However, it does not directly incorporate the principles of homophily, sparsity, and degree distribution, which are important in many real-life situations. Differentiable graph structure learning neural networks (DGSLN), which adhere to these basic principles, have been proven to improve GNN performance. This study proposes a GNN-based semantic dependency parsing model that incorporates the GSL adapted from the DGSLN approach to generate an initial graph. For the graph representation learning stage, we use GNN variants, GIN and GATv2, which have shown robust performance in previous research. The proposed model significantly improves previous best models, achieving an average F1 score of 93.77% on in-domain and 92.27% on out-of-domain datasets. However, our model's parsing performance is slower than prior top-performing models. The model utilizing GIN exhibits the highest level of performance and shows exceptional performance in semantic dependency parsing on English datasets. © 2025 Elsevier B.V.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

—

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Neurocomputing

ISSN

0925-2312

e-ISSN

—

Svazek periodika

646

Číslo periodika v rámci svazku

2025

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

15

Strana od-do

130482

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-105006704207