Pith. sign in

REVIEW 1 cited by

Can Pre-trained Language Models Interpret Similes as Smart as Human?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.08452 v1 pith:46L3V4AN submitted 2022-03-16 cs.CL cs.AI

classification cs.CLcs.AI
keywords plmssimilesimilestaskdatasetslanguageprobinghuman
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Simile interpretation is a crucial task in natural language processing. Nowadays, pre-trained language models (PLMs) have achieved state-of-the-art performance on many tasks. However, it remains under-explored whether PLMs can interpret similes or not. In this paper, we investigate the ability of PLMs in simile interpretation by designing a novel task named Simile Property Probing, i.e., to let the PLMs infer the shared properties of similes. We construct our simile property probing datasets from both general textual corpora and human-designed questions, containing 1,633 examples covering seven main categories. Our empirical study based on the constructed datasets shows that PLMs can infer similes' shared properties while still underperforming humans. To bridge the gap with human performance, we additionally design a knowledge-enhanced training objective by incorporating the simile knowledge into PLMs via knowledge embedding methods. Our method results in a gain of 8.58% in the probing task and 1.37% in the downstream task of sentiment classification. The datasets and code are publicly available at https://github.com/Abbey4799/PLMs-Interpret-Simile.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Entropy and type-token ratio in gigaword corpora

    cs.CL 2024-11 conditional novelty 5.0 of 10

    Word entropy and type-token ratio in billion-token corpora are linked by an asymptotic formula built from Zipf and Heaps laws, confirmed across English, Spanish and Turkish texts.

Pith tools