Papers › Automatic Detection of Generated Text is Easiest when Humans are Fooled

Automatic Detection of Generated Text is Easiest when Humans are Fooled

2 Nov 2019ACL 2020 6arXiv:1911.00650archive 2025-07-28

Daphne Ippolito, Daniel Duckworth, Chris Callison-Burch, Douglas Eck

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.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1911.00650")

Code

Syntology Ran 0 of 6 code samples harvested from 2 repositories linked to this paper; 6 have no recorded run.

By repository: community (archive-listed): 6 samples from 2 repositories, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

kirubarajan/roft mentioned on GitHubMIT report
kirubarajan/trick mentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

6 samples harvested; 0 ran; 0 honoured the contract we drafted; 6 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

6unverified

Licence: 0 of the 6 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

content_filter kirubarajan/trick/generation/content_filter.py community (archive-listed) unverified MIT (permissive) · 036b76d1aab8ff74 · report
cutoff_prompt kirubarajan/roft/generation/inference_scripts/roft_ctrl_generator.py community (archive-listed) unverified MIT (permissive) · e3b1a763e169ffeb · report
cutoff_prompt kirubarajan/roft/generation/inference_scripts/roft_gpt2batch_generator.py community (archive-listed) unverified MIT (permissive) · 08315f7f8aabbadb · report
download_sampling_file kirubarajan/roft/generation/finetuning_scripts/roft_gpt2_finetuning.py community (archive-listed) unverified MIT (permissive) · 188bfe6cd3c544b2 · report
fix_quotation_marks kirubarajan/roft/generation/inference_scripts/roft_gpt2_generator.py community (archive-listed) unverified MIT (permissive) · 3d784c8b761ec9af · report
roft_prompts_json_to_dataset kirubarajan/roft/generation/finetuning_scripts/roft_gpt2_finetuning.py community (archive-listed) unverified MIT (permissive) · e4ec01aaf7c17a31 · report

Tasks

BenchmarkingLanguage ModellingSentenceText Generation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections