Experiments on SemEval-2017 and WebPun show that PunGraph consistently improves the performance of small-scale LLMs and achieves competitive results against strong proprietary models, highlighting the benefits of integrating structured knowledge with LLMs.
Abstract
Puns are a challenging form of figurative language that exploit phonetic similarity and semantic ambiguity to convey multiple meanings. Although large language models (LLMs) demonstrate strong language understanding capabilities, they still struggle with pun reasoning due to limited phonetic modeling and uncontrolled end-to-end generation. We propose \textbf{PunGraph}, a retrieval-enhanced knowledge graph framework for pun understanding. PunGraph constructs a phonetic-semantic lexical graph using the Unisyn phonetic dictionary, IPA and G2P representations, and WordNet definitions, and retrieves candidate words or senses to constrain LLM reasoning within a structured candidate space. We further introduce \textbf{WebPun}, a new large-scale dataset containing 5,730 annotated heterographic and homographic puns. Experiments on SemEval-2017 and WebPun show that PunGraph consistently improves the performance of small-scale LLMs and achieves competitive results against strong proprietary models. Further analysis shows that retrieval-guided phonetic and semantic constraints effectively reduce common reasoning errors in pun interpretation, highlighting the benefits of integrating structured knowledge with LLMs. We release our code and dataset at https://github.com/ysu132/PunGraph.
This work presents a grapheme-aware Indic tokenizer for Tamil that preserves complete grapheme clusters through a reversible Unicode mapping strategy prior to WordPiece vocabulary learning, and achieves the strongest performance among the evaluated tokenizers on fragmentation- and sequence-efficiency-oriented intrinsic...
V. HariKrishnanK, Sudarsun Santhiappan· 0 citations
A layer-wise analysis indicates that surface-level features such as temporality and negation are captured more reliably than deeper semantic phenomena like quantification in large language models, highlighting the limited capacity of current LLMs to generate fully formal meaning representations.
Rémi De Vergnette, Maxime Amblard· International Conference on...· 0 citations
A robust WSD model that integrates a bidirectional long shortterm memory network (BiLSTM) with an attention mechanism, specifically designed for Chinese patent texts is proposed, providing reliable support for knowledge mining and intelligent text processing in technical domains.
L.-X. Gao, T. Dong, M.-H. Yang· Advanced Electromagnetics· 0 citations
A GAT-BiLSTM fusion model that integrates dependency syntactic analysis with graph attention mechanisms and bidirectional long short-term memory networks improves translation fidelity and semantic consistency while exhibiting strong robustness for structurally complex inputs.
J. Leng, X. Lin· Advanced Electromagnetics· 0 citations
It is examined how Arabic’s key linguistic features—non‑concatenative morphology, broken plurals, diacritic ambiguity, and root‑based semantics—affect enrichment outcomes and assess their effects across different enrichment techniques.
Leila Nouri, H. Aliane· ACM Transactions on Asian an...· 0 citations
Findings support the framework as a computational aid for cross-translation comparison and for identifying translation pairs that may warrant closer expert examination, rather than as a general-purpose method for automatic translation-quality assessment.
Tang He, Peng Dai, Rong Wang et al.· PLoS ONE· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comOct 22, 2026
Flint-interactive gives AI agents a language for creating interactive visualizations. Click a chart, filter data, highlight related content, and explore beyond the view the author originally chose. The post Flint-interactive: A language for creating interactive data visualizations appeared first on Microsoft Research.
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.