J08-4003 4 . Theorem 4 The arc-eager , stack-based algorithm is correct for the class of projective
J08-4003 learning times than the linear stack-based algorithms . However , it can also be noted
J08-4003 . Theorem 1 The arc-standard , stack-based algorithm is correct for the class of projective
J08-4003 complexity of the arc-standard , stack-based algorithm is O ( n ) , where n is the length
J08-4003 slower than the strictly projective stack-based algorithms , which can be expected from
J08-4003 on average . The arc-standard stack-based algorithm , finally , again shows much
J08-4003 kind of considerations as for the stack-based algorithms ( cf. Remark 1 ) . The only complication
J08-4003 complexity of the arc-eager , stack-based algorithm is O ( n ) , where n is the length
J08-4003 complexity of the arc-standard , stack-based algorithm is O ( n ) , where n is the length
D09-1059 al. ( 2008 ) extended previous stack-based algorithms for dependency parsing by using
J08-4003 inherent not only in the arc-eager , stack-based algorithm but also in both versions of
W06-3109 have adopted different types of stack-based algorithms to solve the global search optimization
J08-4003 the arc-standard variants of the stack-based algorithm , we find the same kind of pattern
J08-4003 complexity of the arc-eager , stack-based algorithm is O ( n ) , where n is the length
J08-4003 learning is also faster with the stack-based algorithm , which again shows that there
J08-4003 linear time complexity of the stack-based algorithms gives them an advantage with
J08-4003 on average than the arc-eager stack-based algorithm , which in turn outperforms the
J08-4003 turn outperforms the arc-standard stack-based algorithm . This is consistent with the
P00-1053 popped from the stack , or the stack-based algorithm finds a correct referent in an
J08-4003 behaves much more like the arc-eager stack-based algorithm and in fact has a slightly lower
hide detail