NLTK: Uncontrolled recursion in DependencyGraph traversal causes denial of service via deep dependency chains
Default status is the baseline for the product, each version can override it (e.g. patched versions marked unaffected).
| Vendor | Product | Default status | Versions | ||||||
|---|---|---|---|---|---|---|---|---|---|
| nltk | nltk | affected |
|
No data.
No data.
No data available yet.
No CVSS v4.0
No CVSS v3.0
No CVSS v2
This CVE is not in the KEV list.
No EPSS score available.
Key SSVC decision points have not yet been added.
| Type | Values Removed | Values Added |
|---|---|---|
| Description | 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 in version 3.10.4. | |
| Title | NLTK: Uncontrolled recursion in DependencyGraph traversal causes denial of service via deep dependency chains | |
| Weaknesses | CWE-674 | |
| References |
| |
| Metrics |
cvssV3_1
|
No data.
No data.
No data.
No data.
No data.