wikillm

Paper · 2023-10-23 · cs.CL, cs.AI

A Survey on LLM-Generated Text Detection: Necessity, Methods, and Future Directions

Survey of detectors that tell LLM-generated text from human text, built from a systematic review of 83 papers up to November 2023. It sorts methods into watermarking, statistical, neural and human-assisted families, reviews datasets, benchmarks and metrics, and lists attacks and open problems. It runs no experiments; numbers are quoted from the surveyed works.

AI-generated text detectionText watermarkingBenchmark validitysurveytext-detectionwatermarkingbenchmarksevaluation

arXivPDFMarkdown10 min read

AI-compiled by claude-haiku-5-5 on 2026-11-12, not yet reviewed by a human. Every claim cites its source; check it when a detail matters.

In plain words

Language models now write text that often reads like a person wrote it, so there is growing demand for tools that flag machine-written text. This survey reviews the research on those tools. It explains why detection matters, which text collections are used to build and test detectors, and the main kinds of detector.

Some detectors hide a faint statistical signature in the text when the model writes it. These are called watermarks. Others examine finished text: how predictable each word is to a language model, how the text's word statistics look, or what a classifier trained on labelled examples says. Humans can also be trained to spot the signs, sometimes with the help of a visual tool.

The authors then list where these tools fail. They lose accuracy on text from new models or new subject areas, they are fooled by paraphrasing and deliberate edits, and the test sets in different papers are built differently, so scores are hard to compare. The survey closes with open problems for future work.

TL;DR

  • The paper is a systematic review of LLM-generated text detection, covering literature up to November 2023 §3.2.
  • It groups detectors into four families: watermarking, statistics-based, neural-based and human-assisted §5.
  • It reviews training datasets, evaluation benchmarks and metrics, and argues that current evaluation is inconsistent §4, §6, §7.5.
  • It runs no experiments of its own. Every number in this card is quoted from a surveyed work and is author-reported there.

Problem

Detecting LLM-generated text is framed as a binary decision: was this text produced by a language model or written by a human §2.1, eq. 1. The survey argues this matters for misinformation, academic integrity, copyright and the quality of data used to train future models §2.3. It reports that humans are only slightly better than chance at this task, and that commercial detectors tend to label text as human-written §1.

The survey's own argument is that detection fails in several known ways: out-of-distribution data (new domains, languages and generators), adversarial edits and paraphrasing, mixed human and machine text, and evaluation sets that are not comparable across papers §7.

Method

This is a survey, so the "method" is its taxonomy and the review protocol.

Review protocol. The authors ran a systematic literature review following Keele et al. §3.2. They searched five terms joined with OR, covering LLM-generated, machine-generated, AI-written, authorship attribution and deepfake text detection §3.2. They kept work published before November 2023, applied four inclusion criteria (any one sufficed), removed duplicates, screened manually, and retained 83 papers §3.2, tab. 3, fig. 3.

Background the survey uses. A language model samples each next token from a softmax over its output vocabulary, conditioned on the input and the tokens written so far §2.2, eq. 2. The whole output is the product of these steps §2.2, eq. 3. Decoding choice shapes the text. tab. 2 compares the common strategies: two deterministic searches and two sampling schemes, each with its trade-offs.

Taxonomy of detectors §5, fig. 4.

  1. Watermarking §5.1. The defender embeds a signal that a later test can find.

    • Data-driven (§5.1.1): backdoor-style watermarks inserted into training data, so the model learns a secret trigger. The survey notes that these protect dataset or model ownership rather than detect individual texts, and that they are costly to apply to LLM text detection.
    • Model-driven (§5.1.2): the watermark is written during generation by changing the logits or the sampling. The logits method of Kirchenbauer et al. draws a pseudo-random "green" subset of the vocabulary before each token and biases sampling toward it. Detection then runs a statistical test on the green and red token counts. Later variants change which positions receive the bias, use semantic or sentence-level signals, or vary the sampling seed. The survey calls model-driven watermarks plug-and-play, but says their robustness is still debated.
    • Post-processing (§5.1.3): the watermark is added to finished text, for example with Unicode look-alike characters or synonym substitution. This route can be used with black-box models, because the provider is not needed.
  2. Statistics-based detection §5.2. These are zero-shot methods: no training, just a score and a threshold. The threshold is said to come from statistics, but the survey does not say how it is set.

    • Linguistic statistics (§5.2.1): n-gram repetition, bigram statistics, phrase patterns and similar surface counts.
    • White-box statistics (§5.2.2) need the source model's logits. They include log-likelihood, rank and log-rank scores, entropy, and perplexity. The survey calls log-likelihood one of the most common baseline metrics §5.2.2. Perturbation methods such as DetectGPT compare the text's log-probability with that of rewritten versions. Follow-ups replace the perturbation step with cheaper sampling, or use continuation (DNA-GPT). Intrinsic-dimension detection compares the dimension of human and model text embeddings.
    • Black-box statistics (§5.2.3) need only generated text from an LLM. They compare the text with its continuation, rewrite or revision, or with a regenerated version based on an inferred question.
  3. Neural-based detection §5.3.

    • Feature classifiers (§5.3.1): linguistic features (style, complexity, semantics, sentiment, named entities) fed into a classical classifier, or model-based features such as token-level perplexity contrasts between two models, used for provenance tracing.
    • Fine-tuned pre-trained encoders (§5.3.2): RoBERTa is the default baseline and the survey reports it as strong in-domain. Variants add contrastive objectives and adversarial training. RADAR trains a paraphraser and a detector against each other with PPO. OUTFOX lets attacker and detector use each other's outputs as in-context examples, and the survey reports that it outperforms RoBERTa-based detectors against TF-IDF and DIPPER attacks.
    • LLMs as detectors (§5.3.3): prompting an LLM to judge text. The survey finds this unreliable without examples, and reports that in-context examples help (OUTFOX).
  4. Human-assisted methods §5.4. Intuitive indicators such as incoherence and factual error (§5.4.1); imperceptible features that machine detectors can see, shown with the GLTR tool (§5.4.2); training that improves human accuracy (§5.4.3); and mixed human-machine systems (§5.4.4).

Pseudocode: zero-shot log-likelihood and log-rank scores. The survey describes these scores in words §5.2.2 and gives no code. The alignment of logits and tokens is a standard causal-LM convention, not something the survey states.

Pseudocode
# Zero-shot scores for one text  [§5.2.2]
# Input:  tokens (T,) of token ids; model maps ids to logits (T, V)
# Output: mean log-likelihood, mean log-rank

def zero_shot_scores(tokens, model):
    # Logits for each position from the source model  [§5.2.2]
    logits = model(tokens[:-1])                       # (T-1, V)
    log_probs = log_softmax(logits, axis=-1)          # (T-1, V)
    # Each position predicts the next token (convention, not stated)
    observed = tokens[1:]                             # (T-1,)
    # Log-likelihood of each observed token  [§5.2.2]
    token_log_probs = pick(log_probs, observed)       # (T-1,)
    # Rank of each observed token in the vocabulary  [§5.2.2]
    ranks = rank_of(log_probs, observed)              # (T-1,), ranks >= 1
    # Average log-likelihood  [§5.2.2]
    log_likelihood = mean(token_log_probs)
    # Average of log-ranks  [§5.2.2]
    log_rank = mean(log(ranks))
    return log_likelihood, log_rank

# Decision: compare each score with a threshold set from statistics
# The threshold procedure is not stated  [§5.2]

Hyperparameters

This survey proposes no method and trains nothing, so there are no model hyperparameters. The table below lists the survey's own protocol settings.

NameValueWhereNotes
Search stringfive terms joined with OR§3.2includes "authorship attribution"
Date cut-offpublications before November 2023§3.2later work is not covered
Review protocolsystematic literature review§3.2follows Keele et al.
Inclusionany one of four criteria§3.2review, method, challenges, necessity
Included papers83§3.2after de-duplication and manual screening
Publication years2019 to 2023fig. 32023 dominates; see Pitfalls on the two series
Search enginesGoogle Scholar and otherstab. 3most retrievable documents from Google Scholar

Parameters of the detectors the survey cites (thresholds, sample sizes, learning rates) are not restated here. The survey does not state them in the text, and the cited works hold the details.

Results

Author-reported in the surveyed works, not measured by this survey. Use these only as pointers. Scores depend on the test set, the generator and the attack §7.5.

Reported detector results

Claim as reported by the surveySetupWhere
Fine-tuned RoBERTa reaches about 95% average accuracy within its domainin-domain, several studies§5.3.2
GROVER detects its own text with 92% accuracy; other detectors fall toward 70% as GROVER growsGROVER versus GPT-2 and BERT detectors§5.3.3
ChatGPT misclassifies about 50% of LLM text as human; GPT-4 labels about 95% of human text as LLMreevaluation on several LLMs§5.3.3
GHOSTBUSTER reaches average F1 99.0weak models, linear classifier§5.2.2
LLMDet reaches 98.54% accuracyper-model perplexity signatures§5.2.2
A sampling-based follow-up to DetectGPT is reported to raise accuracy by about 75% and detect 340 times fastercited work bao2023fast, named Fast-DetectGPT in §7.1§5.2.2

Reported attack results

Claim as reported by the surveySetupWhere
Homoglyph substitution drops a neural detector's recall from 97.44% to 0.26%black-box character attack§7.2
Synonym substitution cuts fine-tuned classifier, watermark and DetectGPT performance by more than 18%, about 10% and 25%context-aware synonyms§7.2
The OpenAI RoBERTa-large detector reaches AUROC 74.74% on GPT-3.5-Turbo and GPT-4 texttrained on GPT-2 text§7.1
Fine-tuning Llama-2-7B against a detector lowers RoBERTa-large AUROC from 0.84 to 0.62RL with detector score as reward§7.2

Datasets tab. 5, §4.1

The survey lists nine training corpora. The main ones:

  • HC3 covers ChatGPT and human answers in English and Chinese §4.1.1, tab. 5.
  • CHEAT covers academic abstracts, about 15k human and about 35k ChatGPT texts, with polished and blended variants §4.1.1, tab. 5.
  • HC3 Plus adds a semantic-invariance section (summarisation, translation, paraphrase) §4.1.1.
  • OpenLLMText covers about 344k samples from four LLM families §4.1.1.
  • GPT-2 Output Dataset covers GPT-2 samples at temperature 1, and with top-k 40 §4.1.1, tab. 5.
  • DeepfakeTextDetect covers text from 27 LLMs, with GPT-4 and paraphrased text added §4.1.1.

Benchmarks tab. 7, §4.2

Counts from tab. 7 are shown with the table's "~" approximations.

CorpusHuman textsLLM textsLanguagesDomains
TuringBench~8k~159kEnglishnews
MGTBench~2.4k train, ~0.6k test~14.4k train, ~3.6k testEnglishscientific, story, news
GPABenchmark~150k~450kEnglishscientific writing
Scientific-articles Benchmark~16k~13kEnglishscientific writing
MULTITuDE~4k train, ~3k test~40k train, ~26k test11 languagesscientific, news, social media
HANSENnot listed~21kEnglishspoken text
M4~35k train, ~3.5k valid, ~3.5k test~112k train, ~3.5k valid, ~3.5k test7 listedweb, scientific, news, social, QA

The survey's data-challenge section argues that these corpora are thin on attacks, multiple LLMs, languages and recent generators §4.3.1. It also says older benchmarks such as TuringBench use models that are now outdated [§4.2, §4.3.2].

Paper vs code

No official code. The abstract links the repository NLP2CT/LLM-generated-Text-Detection. Fetching its page shows a curated "awesome"-style list of papers, datasets and benchmarks, with a README and images only, and no implementation code. The repository is not cloned and no code field is recorded. Searches: the abstract link (the only project link in the paper) was checked. The paper's TeX source names no other project page. No GitHub search was run because the paper names only the paper-list repository, and the survey itself has no method to implement.

Pitfalls

  • Metric formulas contain errors. The FPR formula eq. 10 has denominator FP+TP. That expression is 1 minus precision. FPR divides by all human-written samples, FP+TN. Implement FPR = FP / (FP + TN) and check against a reference.
  • AUROC integrand looks wrong eq. 14. The formula integrates TP/(TP+FP), which is precision, against FP/(FP+TN). A standard ROC integrand uses the true positive rate, TP/(TP+FN). Treat eq. 14 as a likely typo and verify before use.
  • Promised metrics are not defined. Section 6 names paired and unpaired accuracy, but the body defines only accuracy, precision, recall, human and LLM recall, average recall, FPR, TNR, FNR, F1 and AUROC §6.
  • Text in the metric section has a typo. It says the metrics can all be described by TP, TN, FP and "FP" §6. It means FN.
  • Figure 3 series disagree. The two plotted series differ for 2020 (7 and 8). The second series sums to 83, matching the text, and the first to 82 fig. 3, §3.2.
  • Benchmark counts disagree with the text. HANSEN has about 23k AI-generated spoken texts in the text §4.2 but about 21k in tab. 7, which lists no human count. MULTITuDE has 74k machine texts in the text §4.2 but the train and test columns in tab. 7 add to about 66k, and the table has no column for a third split. M4 has more than ten languages in the text §4.2 but seven in tab. 7. Check the original paper before using a count.
  • A detectors table is not rendered. The TeX source contains a table of detector overviews, but no \input pulls it in. Do not cite it as a table of the compiled paper.
  • Search cut-off. Coverage ends with publications before November 2023 §3.2. The arXiv record has a later revision, and the survey does not say whether it extended the search. Treat later work as unreviewed.
  • Zero-shot thresholds are unspecified. The survey says thresholds come from statistics but does not give the procedure §5.2. Reported scores depend on it, so reproduce the threshold choice from the original work.
  • Watermark robustness is contested. The survey calls model-driven watermarks plug-and-play with minimal quality loss, and says robustness is still debated §5.1.2. Paraphrasing is described as effective against watermark detectors §7.2.
  • Reported scores are not comparable. The survey itself says results vary with test-set construction, sampling parameters, truncation and text processing §7.5. A number from one paper should not be ranked against another.
  • Mixed and human-edited text has no dataset. Detection of partly machine-written or human-edited text is named as a major gap §7.3, §8.4. The survey notes that no existing work formally targets the data ambiguity problem §7.3.
  • Numbering is derived from the TeX source, not a rendered PDF. Section, table, figure and equation numbers follow source order of captioned and numbered environments.

Lineage

  • Builds on: nothing in this wiki; the survey cites earlier reviews for comparison.
  • Compared against: the survey names earlier reviews of machine-generated text detection in its related-work section §3.1: Beresneva et al. (2016), Jawahar et al. (2020), Crothers et al. (2023), Tang et al. (2023) and Ghosal et al. (2023). None has a card here, so nothing from them is used.
  • Superseded by: not known from content in this wiki.

Source and license

Adapted from “A Survey on LLM-Generated Text Detection: Necessity, Methods, and Future Directions” by Junchao Wu, Shu Yang, Runzhe Zhan, Yulin Yuan, Derek F. Wong, Lidia S. Chao (arXiv:2310.14724), used under CC BY 4.0. Changes: condensed and restructured for implementation, with tables, equations and algorithms taken from the paper and its code, each cited to its source. Not affiliated with or endorsed by the authors.