This paper presents a novel top-down head-driven parsing algorithm for data-driven projective dependency analysis.

Experiments on the English Penn Treebank data and the Chinese CoNLL-06 data show that the proposed algorithm achieves comparable results with other data-driven dependency parsing algorithms .

This paper presents a novel head-driven parsing algorithm and empirically shows that it is as practical as other dependency parsing algorithms .

We compared top-down parsing algorithm with other data-driven parsing algorithms in Table l. Top-down parser achieved comparable unlabeled accuracy with others, and outperformed them on the sentence complete rate.

Transition-based parsing algorithms , such as shift-reduce algorithms (Nivre, 2004; Zhang and Clark, 2008), are widely used for dependency analysis because of the efficiency and comparatively good performance.

This work presents an 0(n2) top-down head-driven transition-based parsing algorithm which can parse complex structures that are not trivial for shift-reduce parsers.

Experimental results show that the proposed top-down parser achieves competitive results with other data-driven parsing algorithms .

Eisner and Satta (1999) showed that there is a cubic-time parsing algorithm on the formalism of the head automaton grammars, which are equivalently converted into split-head bilexical context-free grammars (SBCFGs) (McAllester, 1999; Johnson, 2007).

Although our proposed algorithm does not employ the formalism of SBCFGs, it creates left children before right children, implying that it does not have spurious ambiguities as well as parsing algorithms on the SBCFGs.

Head-comer parsing algorithm (Kay, 1989) creates dependency tree top-down, and in this our algorithm has similar spirit to it.

The algorithm was extensions of the parsing algorithm of (Eisner, 1996), which was a modified version of the CKY chart parsing algorithm .

The parsing algorithm independently parses the left and right dependents of a word and combines them later.

Because the parsing algorithm is in the bottom-up style, the nearer children are generated earlier than the farther ones of the same head.