The parsing algorithm used for all languages is the deterministic algorithm first proposed for unlabeled dependency parsing by Nivre ( 2003 ) and extended to labeled dependency parsing by Nivre et al. ( 2004 ) .
memorybased dependency parsing
J Nivre J Hall J Nilsson
The parsing algorithm used for all languages is the deterministic algorithm first proposed for unlabeled dependency parsing by Nivre ( 2003 ) and extended to labeled dependency parsing by Nivre et al. ( 2004 ) . The algorithm builds a labeled dependency graph in one left-to-right pass over the input , using a stack to store partially processed tokens and adding arcs using four elementary actions ( where top is the token on top of the stack and next is the next token ) :
The parsing algorithm used for all languages is the deterministic algorithm first proposed for unlabeled dependency parsing by Nivre ( 2003 ) and extended to labeled dependency parsing by @@CITATION .