P07-1096 2.67 % on the test data . With deterministic search , or beam with B = 1 , we obtain
D14-1107 signments . Parsing is then simply a deterministic search for the most probable category
E91-1024 non-monotonicity , functionality , and deterministic search . A DATR theory ( or network
P14-2106 MaltParser ( local model and greedy deterministic search ) ZPar applies global discriminative
J08-4003 characterize parsing algorithms with deterministic search . In data-driven dependency parsing
W04-0305 this family will result in the deterministic search making choices before the necessary
J08-4003 search , rather than strictly deterministic search , as in the work by Ratnaparkhi
W12-5618 dependency parsing can be realized as deterministic search through the transition system
W10-1411 dependency parsing can be realized as deterministic search through the transition system
J96-4004 balance between random search and deterministic search , imbuing it with both flexibility
J13-4002 assumption that these parsers use deterministic search or fixed - size beam search because
P07-1096 using fewer fea - tures . By using deterministic search , it obtains an error rate of
P11-5001 </figurecaption> <figurecaption> deterministic search problems ) &gt; Total utility
hide detail