We use the non-projective k-best MST algorithm to generate k-best lists ( Hall , 2007 ) , where k = 8 for the experiments in this paper .
kbest spanning tree parsing
K Hall
based parsing algorithms with an arc-factored parameterization ( McDonald et al. , 2005 ) . We use the non-projective k-best MST algorithm to generate k-best lists ( Hall , 2007 ) , where k = 8 for the experiments in this paper . The graphbased parser features used in the experiments in this paper are defined over a word , wi at position i ; the head of this word wÏ ( i ) where Ï ( i ) provides the index of the head word ; and partof-speech tags of these words ti .
We use the non-projective k-best MST algorithm to generate k-best lists ( @@CITATION ) , where k = 8 for the experiments in this paper .