提出一种逐词构建依存树的算法，模拟人类语言处理机制。
A Fundamental Algorithm for Dependency Parsing (With Corrections)
- 逐词处理，即时连接每个词到已知结构
- 最坏时间复杂度为O(n³)，但真实语言中仅在小n时出现
- 适合研究人类语言认知与轻量级解析任务
本文提出一种用于将自然语言句子解析为依存树的基本算法。与短语结构（成分）解析器不同，该算法以单个词为单位进行操作，在词可被连接时立即将其附着，这与人类大脑中解析器所具备的特性相符。尽管其最坏情况下的时间复杂度为O(n³)，但在人类语言中，这种最坏情况仅出现在较小的n值时。
原文摘要 · Abstract (English)
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$.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。