id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_577ikynqqjccxpgsyirnrp7bme	Emily Pitler	A Crossing-Sensitive Third-Order Factorization for Dependency Parsing	2014	14	.pdf	application/pdf	8313	775	74	Within graph-based projective parsing, the thirdorder parser of Koo and Collins (2010) has a runtime of O(n4), just one factor of n more expensive crossing-sensitive grandparent-sibling 1-EndpointCrossing parser proposed here takes O(n4) time, Endpoint-Crossing tree with each edge ~ehm scored The parser finds the maximum scoring 1-EndpointCrossing tree according to the factorization in Section 3 with a dynamic programming procedure reminiscent of Koo and Collins (2010) (for scoring uncrossed edges with grandparent and/or sibling features) and of Pitler et al. Difficulty 1 is solved by adding crossed and uncrossed edges to the tree in distinct sub-problems Uncrossed edges are added only through trapezoid subproblems (that may or may not have a grandparent index), while crossed edges are added in nontrapezoid sub-problems. unconstrained 1-Endpoint-Crossing tree does not include any pruned edges, then whether the parser uses grandparent-sibling factored models for both projective and 1-Endpoint-Crossing parsing are in Tables	./cache/work_577ikynqqjccxpgsyirnrp7bme.pdf	./txt/work_577ikynqqjccxpgsyirnrp7bme.txt