# A Fundamental Algorithm for Dependency Parsing (With Corrections)

arXiv: https://arxiv.org/abs/2510.19996 · HTML: https://mlsanity.com/paper/2510.19996/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 17 references that are in the map.
- First posted on arXiv 22 Oct 2025.

## Abstract (arXiv)

This paper presents a fundamental algorithm for parsing natural language sentences into dependency trees. Unlike phrase-structure (constituency) parsers, this algorithm operates one word at a time, attaching each word as soon as it can be attached, corresponding to properties claimed for the parser in the human brain. Like phrase-structure parsing, its worst-case complexity is O(n3), but in human language, the worst case occurs only for small n.