Finding Challenging Metaphors that Confuse Pretrained Language Models

Yucheng Li, Frank Guerin, Chenghua Lin
1/29/2024
cs.CL

No confident code implementation found for this paper.

Abstract

Metaphors are considered to pose challenges for a wide spectrum of NLP tasks. This gives rise to the area of computational metaphor processing. However, it remains unclear what types of metaphors challenge current state-of-the-art models. In this paper, we test various NLP models on the VUA metaphor dataset and quantify to what extent metaphors affect models' performance on various downstream tasks. Analysis reveals that VUA includes a large number of metaphors that pose little difficulty to downstream tasks. We would like to shift the attention of researchers away from these metaphors to instead focus on challenging metaphors. To identify hard metaphors, we propose an automatic pipeline that identifies metaphors that challenge a particular model. Our analysis demonstrates that our detected hard metaphors contrast significantly with VUA and reduce the accuracy of machine translation by 16\%, QA performance by 4\%, NLI by 7\%, and metaphor identification recall by over 14\% for various popular NLP systems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{li2024finding,
  title  = {Finding Challenging Metaphors that Confuse Pretrained Language Models},
  author = {Yucheng Li and Frank Guerin and Chenghua Lin},
  year   = {2024},
  eprint = {2401.16012},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.16012v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.16012.svg)](https://codeofpaper.com/paper/2401.16012)

Discussion