CVE-2026-129225
Description
NLTK =3.10.3: DependencyGraph traversal helpers (_tree/triples/get_cycle_path) recursed once per dependency link with no depth bound — a 2000-link chain raises an unhandled RecursionError in tree(). Verbatim dependencygraph.py 3.10.3 vs 3.10.4: RecursionError on vuln, bounded ValueError MAX_DEPTH=200 on fixed (a7468275).
CVE-CVE-2026-129225 Details
NLTK (Natural Language Toolkit) is a suite of open source Python modules, data sets, and tutorials supporting research and development in Natural Language Processing. In 3.10.3 and earlier, DependencyGraph._tree and triples recurse once per dependency edge without a depth bound, and get_cycle_path also lacks a visited-set termination guard. A deeply chained or cyclic attacker-controlled CoNLL or Malt-TAB dependency structure can raise RecursionError and abort a parse worker. This issue is fixed ...
Related PoCs for CVE-2026-129225
No other PoCs found for this CVE.