id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_jhkfg5u4x5dotecqjonxyj7sbq	Mark-Jan Nederhof	Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time	2019	14	.pdf	application/pdf	9604	960	77	Calculating the Optimal Step in Shift-Reduce Dependency Parsing: allows gold trees to be non-projective. If the gold tree is non-projective and the parsing strategy only allows projective trees, then there projective parsing algorithms, however (GómezRodrı́guez et al., 2014; Gómez-Rodrı́guez and its own right, and can be used to determine the optimal projectivization of a non-projective tree. Table 1: Shift-reduce dependency parsing. The three transitions of shift-reduce dependency parsing are given in Table 1. Figure 1: Dependency structure and corresponding parse tree that encodes a computation of a shift-reduce parser. Figure 1 presents a parse tree for the grammar parse tree, for stack of height 4 and remaining input of input, and the left-most and right-most dependency relations in the top-most two stack elements. To investigate the run-time behavior of the algorithms, we trained our shift-reduce dependency the optimal step for shift-reduce dependency parsing that is applicable on non-projective training	./cache/work_jhkfg5u4x5dotecqjonxyj7sbq.pdf	./txt/work_jhkfg5u4x5dotecqjonxyj7sbq.txt