A Fundamental Algorithm for Dependency Parsing (With Corrections)
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915571452346368 |
|---|---|
| author | Covington, Michael A. |
| author_facet | Covington, Michael A. |
| contents | 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$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_19996 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Fundamental Algorithm for Dependency Parsing (With Corrections) Covington, Michael A. Computation and Language 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$. |
| title | A Fundamental Algorithm for Dependency Parsing (With Corrections) |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2510.19996 |