Interpretable Chinese Metaphor Identification via LLM-Assisted MIPVU Rule Script Generation: A Comparative Protocol Study

• URL: http://arxiv.org/abs/2603.10784v1
• Date: Wed, 11 Mar 2026 13:55:34 GMT
• Title: Interpretable Chinese Metaphor Identification via LLM-Assisted MIPVU Rule Script Generation: A Comparative Protocol Study
• Abstract summary: We present an LLM-assisted pipeline that operationalises four metaphor identification protocols.<n>Each protocol is a modular chain of deterministic steps interleaved with controlled LLM calls.<n>We evaluate on seven Chinese metaphor datasets spanning token-, sentence-, and span-level annotation.
• Score: 1.482489178857542
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Metaphor identification is a foundational task in figurative language processing, yet most computational approaches operate as opaque classifiers offering no insight into why an expression is judged metaphorical. This interpretability gap is especially acute for Chinese, where rich figurative traditions, absent morphological cues, and limited annotated resources compound the challenge. We present an LLM-assisted pipeline that operationalises four metaphor identification protocols--MIP/MIPVU lexical analysis, CMDAG conceptual-mapping annotation, emotion-based detection, and simile-oriented identification--as executable, human-auditable rule scripts. Each protocol is a modular chain of deterministic steps interleaved with controlled LLM calls, producing structured rationales alongside every classification decision. We evaluate on seven Chinese metaphor datasets spanning token-, sentence-, and span-level annotation, establishing the first cross-protocol comparison for Chinese metaphor identification. Within-protocol evaluation shows Protocol A (MIP) achieves an F1 of 0.472 on token-level identification, while cross-protocol analysis reveals striking divergence: pairwise Cohen's kappa between Protocols A and D is merely 0.001, whereas Protocols B and C exhibit near-perfect agreement (kappa = 0.986). An interpretability audit shows all protocols achieve 100% deterministic reproducibility, with rationale correctness from 0.40 to 0.87 and editability from 0.80 to 1.00. Error analysis identifies conceptual-domain mismatch and register sensitivity as dominant failure modes. Our results demonstrate that protocol choice is the single largest source of variation in metaphor identification, exceeding model-level variation, and that rule-script architectures achieve competitive performance while maintaining full transparency.

Related papers

• GrOIL: Graph-Grounded Domain Ontology Induction with Constrained LLM Mediation [1.029029220360574]
  We present a seven-stage graph-grounded pipeline that converts domain documents into a complete Web Ontology Language (OWL) Terminological Box (TBox) without any unconstrained generation step.<n>Ontology growth analysis provides evidence consistent with vocabulary saturation at scale, demonstrating that the pipeline produces stable, reusable domain representations from large document corpora.
  arXiv  Detail & Related papers  (2026-08-22T23:15:47Z)
• VARM-Bench: Benchmarking Verifiable Structured Reasoning in Chinese Abusive Speech Moderation [12.885908330308046]
  VARM-Bench is a benchmark for deterministically verifying the stated basis of a moderation decision.<n>Our protocol evaluates field correctness, target alignment, output validity, complete-record agreement, and hidden record errors.<n>Results show that strong label-level performance can conceal substantial errors in complete moderation records.
  arXiv  Detail & Related papers  (2026-08-16T07:52:31Z)
• Structuring Semantic Embeddings for Principle Evaluation: A Prototype-Guided Contrastive Learning Approach [58.15427952222424]
  General-purpose text embeddings are widely deployed for such tasks, but broad semantic similarity can place semantically similar yet task-distinct examples.<n>We introduce Prototype-Guided Contrastive Learning (PGCL), a prototype-guided geometric regularization module built on top of frozen text embeddings.
  arXiv  Detail & Related papers  (2026-08-15T13:19:25Z)
• Interpretable Discriminative Text Representations via Agreement and Label Disentanglement [4.2788570168072395]
  We propose an operational criterion for interpretable discriminative text representations.<n>Each coordinate should satisfy conceptual clarity, measured by chance of agreement.<n>We instantiate this criterion in LLM-assisted Feature Discovery.
  arXiv  Detail & Related papers  (2026-05-20T04:41:44Z)
• Multi-Level Contextual Token Relation Modeling for Machine-Generated Text Detection [105.1403233464793]
  Machine-generated texts (MGTs) pose risks such as disinformation and phishing, underscoring the need for reliable detection.<n> Metric-based methods, which extract statistically distinguishable features of MGTs, are often more practical than complex model-based methods.<n>We propose a multi-level contextual token relation modeling framework for MGT detection.
  arXiv  Detail & Related papers  (2026-05-15T15:55:58Z)
• A Reproducible Multi-Architecture Baseline for Token-Level Chinese Metaphor Identification under the MIPVU Framework [2.545461559283292]
  This paper presents a reproducible multi-architecture baseline for token-level metaphor identification on the PSU Chinese Metaphor Corpus (PSU CMC)<n>We compare three model families: encoder fine-tuning with Chinese RoBERTa-wwm-ext-large; (ii) MelBERT adapted to Chinese using a newly constructed basic-meaning resource derived from the Modern Chinese Dictionary, 7th edition (MCD7)<n>Across five fixed seeds, MelBERT MIP-only achieves the strongest performance at 0.7281 +/- 0.0050 test positive F1, marginally above MelBERT Full (0.7270 +/- 0.0069) and clearly above plain RoBERTa (0.7
  arXiv  Detail & Related papers  (2026-05-08T03:07:19Z)
• PHANTOM: Polymorphic Honeytoken Adaptation with Narrative-Tailored Organisational Mimicry [0.2538209532048867]
  Honeytokens are decoy digital assets planted to detect and unauthorised attribute access.<n>We introduce PHANTOM, a framework that generates contextually convincing honeytokens by encoding organisation-specific knowledge.<n>Results are reproduced without external API calls, making the pipeline fully deployable in air-gapped environments.
  arXiv  Detail & Related papers  (2026-05-04T17:14:13Z)
• Correction and Corruption: A Two-Rate View of Error Flow in LLM Protocols [51.56484100374058]
  We propose a paired-outcome measurement interface for auditing a single protocol step on exact-match tasks.<n>For each instance, the interface records a baseline correctness bit and a post-step correctness bit.<n>These rates predict accuracy changes and define a reusable empirical interface testable across seeds, mixtures, and pipelines.
  arXiv  Detail & Related papers  (2026-04-20T13:25:40Z)
• MCP-Diag: A Deterministic, Protocol-Driven Architecture for AI-Native Network Diagnostics [0.08921166277011344]
  This paper introduces MCP-Diag, a hybrid neuro-symbolic architecture built upon the Model Context Protocol (MCP)<n>We propose a deterministic translation layer that converts rawout from canonical utilities (dig, ping, traceroute) into rigorous schemas before AI ingestion.<n>We also introduce a mandatory "Elicitation Loop" that enforces Human-in-the-Loop (HITL) authorization at the protocol level.
  arXiv  Detail & Related papers  (2026-01-30T06:49:25Z)
• Connecting the Dots: Training-Free Visual Grounding via Agentic Reasoning [63.109585527799005]
  GroundingAgent is a visual grounding framework that operates without task-specific fine-tuning.<n>It achieves an average zero-shot grounding accuracy of 65.1 % on widely-used benchmarks.<n>It also offers strong interpretability, transparently illustrating each reasoning step.
  arXiv  Detail & Related papers  (2025-11-24T03:11:08Z)
• Harmonic Token Projection (HTP): A Vocabulary-Free, Training-Free, Deterministic, and Reversible Embedding Methodology [0.0]
  The Harmonic Token Projection (HTP) is a reversible and deterministic framework for generating text embeddings without training, vocabularies, or parameters.<n>HTP achieves a Spearman correlation of rho = 0.68 in English, maintaining stable performance across ten languages.<n>This demonstrates that meaningful semantic relations can emerge from deterministic geometry, offering a transparent and efficient alternative to data-driven embeddings.
  arXiv  Detail & Related papers  (2025-11-10T20:51:18Z)
• MMSE-Calibrated Few-Shot Prompting for Alzheimer's Detection [4.176236534741941]
  We study few-shot prompting with a class-balanced protocol using nested interleave and a strict schema.<n>We evaluate two variants achieving state-of-the-art prompting results.<n>This is the first ADReSS study to anchor elicited probabilities to MMSE and to use multimodal construction to improve interpretability.
  arXiv  Detail & Related papers  (2025-09-24T09:33:46Z)
• SiLVERScore: Semantically-Aware Embeddings for Sign Language Generation Evaluation [29.960223851833785]
  We propose SiLVERScore, a semantically-aware embedding-based evaluation metric for sign language generation.<n>On PHOENIX-14T and CSL-Daily datasets, SiLVERScore achieves near-perfect discrimination between correct and random pairs.
  arXiv  Detail & Related papers  (2025-09-04T00:58:43Z)
• Pretraining Data Detection for Large Language Models: A Divergence-based Calibration Method [108.56493934296687]
  We introduce a divergence-based calibration method, inspired by the divergence-from-randomness concept, to calibrate token probabilities for pretraining data detection.<n>We have developed a Chinese-language benchmark, PatentMIA, to assess the performance of detection approaches for LLMs on Chinese text.
  arXiv  Detail & Related papers  (2024-09-23T07:55:35Z)
• CPCL: Cross-Modal Prototypical Contrastive Learning for Weakly Supervised Text-based Person Retrieval [10.133031003977834]
  Weakly supervised text-based person retrieval seeks to retrieve images of a target person using textual descriptions.<n>The primary challenge is the intra-class differences, encompassing intra-modal feature variations and cross-modal semantic gaps.<n>We propose a Cross-Modal Prototypical Contrastive Learning (CPCL) method to map visual and textual instances into a shared latent space.
  arXiv  Detail & Related papers  (2024-01-18T14:27:01Z)
• Prototype-based Aleatoric Uncertainty Quantification for Cross-modal Retrieval [139.21955930418815]
  Cross-modal Retrieval methods build similarity relations between vision and language modalities by jointly learning a common representation space. However, the predictions are often unreliable due to the Aleatoric uncertainty, which is induced by low-quality data, e.g., corrupt images, fast-paced videos, and non-detailed texts. We propose a novel Prototype-based Aleatoric Uncertainty Quantification (PAU) framework to provide trustworthy predictions by quantifying the uncertainty arisen from the inherent data ambiguity.
  arXiv  Detail & Related papers  (2023-09-29T09:41:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.