Weisfeiler-Leman in the BAMBOO : Novel AMR Graph Metrics and a Benchmark for AMR Graph Similarity

被引:8
|
作者
Opitz, Juri [1 ]
Daza, Angel [2 ]
Frank, Anette [1 ]
机构
[1] Heidelberg Univ, Dept Computat Linguist, Heidelberg, Germany
[2] Vrije Univ Amsterdam, CLTL, Amsterdam, Netherlands
关键词
Alignment;
D O I
10.1162/tacl_a_00435
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Several metrics have been proposed for assessing the similarity of (abstract) meaning representations (AMRs), but little is known about how they relate to human similarity ratings. Moreover, the current metrics have complementary strengths and weaknesses: Some emphasize speed, while others make the alignment of graph structures explicit, at the price of a costly alignment step. In this work we propose new Weisfeiler-Leman AMR similarity metrics that unify the strengths of previous metrics, while mitigating their weak-nesses. Specifically, our new metrics are able to match contextualized substructures and induce n:m alignments between their nodes. Furthermore, we introduce a Benchmark for AMR Metrics based on Overt Objectives (BAMBOO), the first benchmark to support empirical assessment of graph-based MR similarity metrics. BAMBOO maximizes the interpretability of results by defining multiple overt objectives that range from sentence similarity objectives to stress tests that probe a metric's robustness against meaning-altering and meaning-preserving graph transformations. We show the benefits of BAMBOO by profiling previous metrics and our own metrics. Results indicate that our novel metrics may serve as a strong baseline for future work.
引用
收藏
页码:1425 / 1441
页数:17
相关论文
共 50 条
  • [1] Weisfeiler-Leman and Graph Spectra
    Rattan, Gaurav
    Seppelt, Tim
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 2268 - 2285
  • [2] The Weisfeiler-Leman algorithm and recognition of graph properties
    Fuhlbrueck, Frank
    Koebler, Johannes
    Ponomarenko, Ilia
    Verbitsky, Oleg
    THEORETICAL COMPUTER SCIENCE, 2021, 895 : 96 - 114
  • [3] On Weisfeiler-Leman invariance: Subgraph counts and related graph properties
    Arvind, V.
    Fuhlbrueck, Frank
    Koebler, Johannes
    Verbitsky, Oleg
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 113 : 42 - 59
  • [4] Detecting Similar Programs via The Weisfeiler-Leman Graph Kernel
    Li, Wenchao
    Saidi, Hassen
    Sanchez, Huascar
    Schaf, Martin
    Schweitzer, Pascal
    SOFTWARE REUSE: BRIDGING WITH SOCIAL-AWARENESS, 2016, 9679 : 315 - 330
  • [5] On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
    Arvind, Vikraman
    Fuhlbrueck, Frank
    Koebler, Johannes
    Verbitsky, Oleg
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2019, 2019, 11651 : 111 - 125
  • [6] Weisfeiler–Leman and Graph Spectra
    Seppelt, Tim
    Rattan, Gaurav
    arXiv, 2021,
  • [7] Graph Alignment Kernels using Weisfeiler and Leman Hierarchies
    Nikolentzos, Giannis
    Vazirgiannis, Michalis
    Proceedings of Machine Learning Research, 2023, 206 : 2019 - 2034
  • [8] Graph Alignment Kernels using Weisfeiler and Leman Hierarchies
    Nikolentzos, Giannis
    Vazirgiannis, Michalis
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 206, 2023, 206
  • [9] AMR Similarity Metrics from Principles
    Opitz, Juri
    Parcalabescu, Letitia
    Frank, Anette
    TRANSACTIONS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, 2020, 8 (08) : 522 - 538
  • [10] Evaluate AMR Graph Similarity via Self-supervised Learning
    Shou, Ziyi
    Lin, Fangzhen
    PROCEEDINGS OF THE 61ST ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2023): LONG PAPERS, VOL 1, 2023, : 16112 - 16123