Deceptive Semantic Shortcuts on Reasoning Chains: How Far Can Models Go without Hallucination? | NSF Public Access Repository

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Citation Details

Deceptive Semantic Shortcuts on Reasoning Chains: How Far Can Models Go without Hallucination?

Award ID(s):: 2105329

PAR ID:: 10531465

Author(s) / Creator(s):: Li, Bangzheng; Zhou, Ben; Wang, Fei; Fu, Xingyu; Roth, Dan; Chen, Muhao

Publisher / Repository:: Association for Computational Linguistics

Date Published:: 2024-01-01

Page Range / eLocation ID:: 7675 to 7688

Format(s):: Medium: X

Location:: Mexico City, Mexico

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript
Conference Paper:
https://doi.org/10.18653/v1/2024.naacl-long.424