CVE-2026-129225

A deep dependency parse could crash NLTK graph traversal

NLTK project · Natural Language Toolkit · dependency-graph traversal

First documented disclosure · Review checkpoint

Summary

An externally supplied dependency graph could interrupt a worker when NLTK expanded the graph into trees or triples.

Severity and exploitation evidence

Medium · 5.3/10 · CVSS 3.1. Severity source.

Exploitation not established: The NLTK advisory describes the vulnerability and its preconditions. The reviewed sources identify no malicious use.

Exploitation evidence source

Technical severity is not a measure of observed attacks or of risk to your deployment. Attempts, demonstrations, and successful compromise retain the qualifications in the source.

How the weakness works

Tree, triple and cycle-path helpers recursed through dependency links without limiting depth.

Conditions required

An application traverses dependency graphs derived from external data.

Potential impact

A deep or cyclic graph could exhaust the call stack, disrupting the NLP worker.

Affected versions and configurations

<= 3.10.3

Fix and mitigation status

3.10.4.

Practical next steps

Upgrade to NLTK 3.10.4 or a later fixed release.

Operating lesson

Bound traversal and detect cycles before processing untrusted dependency trees.

Evidence and limits

The issue-specific patch was public by 2026-09-11. The fixed release shipped October 21. The November 15 maintainer advisory supplies the identifier and affected versions. This is a historical addition. CVE-2026-129222 describes overlapping tree and triples traversal paths. The numerical score shown here belongs to CVE-2026-129225.

Sources