id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_hebrzn33h5bmnl4jpzofb5owoe	Yoav Goldberg	A Tabular Method for Dynamic Oracles in Transition-Based Parsing	2014	12	.pdf	application/pdf	8506	780	79	We develop parsing oracles for two transition-based dependency parsers, including the parser configurations to optimal transitions with respect to a gold tree. Goldberg and Nivre (2013) develop dynamic oracles for several transition-based parsers. if it has the form ([0], [],A), and in a final configuration arc set A always defines a dependency tree In the second step of the algorithm we use dynamic programming techniques to simulate all computations of the arc-standard parser starting in a configuration with stack σL and with a buffer consisting space defined by these computations includes the dependency trees for w that are reachable from the input configuration c and that have minimum loss. Algorithm 1 Computation of the loss function for the arc-standard parser T [i,j](h) stores the minimum loss among dependency trees rooted at h that can be obtained by running the parser on the first i elements of stack σL and	./cache/work_hebrzn33h5bmnl4jpzofb5owoe.pdf	./txt/work_hebrzn33h5bmnl4jpzofb5owoe.txt