Algorithms for Deterministic Incremental Dependency Parsing

5 List-Based Algorithms

1. What is a list-based configuration, and what is it for?
   A quadruple \((\lambda_1, \lambda_2, \beta, A)\): two lists of partially processed tokens plus the buffer and arcs. Inspired by Covington (2001), it lets the parser consider pairs of non-adjacent tokens: nodes skipped over are moved from \(\lambda_1\) to \(\lambda_2\) and restored on the next shift, which allows non-projective arcs.
   • Nivre, 2008, Algorithms for Deterministic Incremental Dependency Parsing (Computational Linguistics), §5, pp. 529–530