将弧标准依存解析过程解释为有序树的逐步构建，揭示其内在结构。
A tree interpretation of arc standard dependency derivation
- 用移进、左弧、右弧操作逐步构造带序的词法化有序树
- 投影依存树可唯一对应连续叶序的有序树，非投影则通过伪投影处理
- 适用于神经过渡解析器，为依存分析提供树理论解释
投影依存树上的弧标准推导可被解释为词法化有序树的增量构建，且叶节点顺序连续。每个移进、左弧、右弧操作对应确定性的树更新，生成的有序树唯一决定了推导中引入的依存弧。我们证明该表示并非任意编码：单头依存树存在连续有序表示当且仅当其为投影树。该方法是推导性的而非转换式，因为有序对象由过渡序列直接定义，而非从完成的依存图变换而来。这为弧标准解析提供了树理论解释，表明投影依存推导隐式构建可恢复的成分式有序树。对于非投影输入，可通过伪投影提升与逆解码实现。小型实现研究证实映射后的推导可在现有神经过渡解析器中执行。
原文摘要 · Abstract (English)
Arc-standard derivations over projective dependency trees can be interpreted as the incremental construction of lexicalized ordered trees with contiguous yields. Each \textsc{shift}, \textsc{leftarc}, and \textsc{rightarc} transition corresponds to a deterministic tree update, and the resulting ordered tree uniquely determines the dependency arcs introduced by the derivation. We show that this representation is not an arbitrary encoding: a single-headed dependency tree admits such a contiguous ordered representation if and only if it is projective. The proposal is therefore derivational rather than conversion-based, since the ordered object is defined over the transition sequence itself rather than obtained by transforming a completed dependency graph. This gives a tree-theoretic interpretation of arc-standard parsing, in which projective dependency derivations implicitly construct recoverable constituency-style ordered trees. For non-projective inputs, the interpretation can be used through pseudo-projective lifting and inverse decoding. A small implementation study confirms that the mapped derivations are executable in an existing neural transition-based parser.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。