pith. sign in

By allowing the transitions to skip overknodes, we obtain the trees of Attardi degreek+1, orAD k+1

which adds transitions that create arcs that “skip” over nodes on the stack (in contrast to arc-standard, which only links adjacent nodes, hence allowing no crossing arcs), while keepingO(n) complexity · 2011

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.CL 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Formal Constraints on Dependency Syntax

cs.CL · 2026-04-06 · unverdicted · novelty 3.0

Various formal constraints on dependency trees are explored as a middle ground between projectivity and fully unrestricted structures to better model real language.

citing papers explorer

Showing 1 of 1 citing paper.

  • Formal Constraints on Dependency Syntax cs.CL · 2026-04-06 · unverdicted · none · ref 14

    Various formal constraints on dependency trees are explored as a middle ground between projectivity and fully unrestricted structures to better model real language.