A Fundamental Algorithm for Dependency Parsing (With Corrections)

Michael A. Covington
10/22/2025
cs.CL

No confident code implementation found for this paper.

Abstract

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(n^3)$, but in human language, the worst case occurs only for small $n$.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Dependency Parsing with the Structuralized Prompt Template

82% match2025

We can still parse using syntactic rules

82% match2026

Textless Dependency Parsing by Labeled Sequence Prediction

80% match1 repo22024

Empirical Analysis for Unsupervised Universal Dependency Parse Tree Aggregation

79% match2024

A Systematic Comparison of Syntactic Representations of Dependency Parsing

79% match2025

Character-Level Chinese Dependency Parsing via Modeling Latent Intra-Word Structure

79% match1 repo12024

Cite this paper

@article{covington2025fundamental,
  title  = {A Fundamental Algorithm for Dependency Parsing (With Corrections)},
  author = {Michael A. Covington},
  year   = {2025},
  eprint = {2510.19996},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.19996v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.19996.svg)](https://codeofpaper.com/paper/2510.19996)

Discussion