Pith. sign in

REVIEW 6 cited by

Automatic Detection of Generated Text is Easiest when Humans are Fooled

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 1911.00650 v2 pith:R77CAC2Q submitted 2019-11-02 cs.CL

Automatic Detection of Generated Text is Easiest when Humans are Fooled

classification cs.CL
keywords automatichumanstexthumanmakedecodingdetectionsystems
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Recent advancements in neural language modelling make it possible to rapidly generate vast amounts of human-sounding text. The capabilities of humans and automatic discriminators to detect machine-generated text have been a large source of research interest, but humans and machines rely on different cues to make their decisions. Here, we perform careful benchmarking and analysis of three popular sampling-based decoding strategies---top-$k$, nucleus sampling, and untruncated random sampling---and show that improvements in decoding methods have primarily optimized for fooling humans. This comes at the expense of introducing statistical abnormalities that make detection easy for automatic systems. We also show that though both human and automatic detector performance improve with longer excerpt length, even multi-sentence excerpts can fool expert human raters over 30% of the time. Our findings reveal the importance of using both human and automatic detectors to assess the humanness of text generation systems.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

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

  1. Language Models are Few-Shot Learners

    cs.CL 2020-05 accept novelty 8.0

    GPT-3 shows that scaling an autoregressive language model to 175 billion parameters enables strong few-shot performance across diverse NLP tasks via in-context prompting without fine-tuning.

  2. Can AI-Generated Text be Reliably Detected?

    cs.CL 2023-03 unverdicted novelty 6.0

    Recursive paraphrasing attacks substantially lower detection rates for multiple AI text detectors with only minor quality loss, while a theoretical analysis ties best-case AUROC to total variation distance between hum...

  3. An Exploratory Study on LLM-Generated Code and Comments in Code Repositories

    cs.SE 2026-07 unverdicted novelty 5.0

    Detector proxy analysis of real repositories finds LLM-like code decreasing over time and common in tests, with more in company repos, substantial clones, stable but often ungrammatical comments, and few linked bugs.

  4. Detecting LLM-Assisted Academic Dishonesty using Keystroke Dynamics

    cs.HC 2025-11 unverdicted novelty 5.0

    Keystroke dynamics models outperform text-only detectors for spotting LLM-assisted academic dishonesty in practical scenarios, though performance drops under adversarial conditions.

  5. Findings of the Counter Turing Test: AI-Generated Text Detection

    cs.CL 2026-05 unverdicted novelty 2.0

    Shared task findings show F1=1.0000 for binary AI text detection and 0.9531 for model attribution using fine-tuned DeBERTa and BART transformers with ensembles.

  6. Findings of the Counter Turing Test: AI-Generated Text Detection

    cs.CL 2026-05 unverdicted novelty 2.0

    Shared task findings show near-perfect binary detection of AI-generated text but greater difficulty in attributing outputs to particular language models.