P11-3011 2009 ) suggest an algorithm for deterministic shift-reduce parsing in HPSG . They outline two backtracking
E09-1069 unification-based grammars , based on deterministic shift-reduce parsing . First , we presented deterministic
W09-3825 accuracies have been achieved by a deterministic shift-reduce parsing model on parsing the Chinese
E09-1069 condition . " det " means the deterministic shift-reduce parsing proposed in this paper . " backn
E09-1069 for unificationbased grammars : deterministic shift-reduce parsing and shift-reduce parsing by backtracking
E09-1069 unification . First , we explain the deterministic shift-reduce parsing algorithm , and then we explain
E09-1069 search paths . We propose ( i ) deterministic shift-reduce parsing for unification-based grammars
J07-2008 specifying a particular type of deterministic shift-reduce parsing algorithm . Here , the set of
D09-1127 Search Extension We also enhance deterministic shift-reduce parsing with beam search , similar to
E09-1069 backtracking and beam search . 4.1 Deterministic shift-reduce parsing for unification-based grammars
D10-1069 impressively , models based on deterministic shift-reduce parsing algorithms are able to rival
E09-1069 for research purposes . <title> Deterministic shift-reduce parsing for unification-based grammars
E09-1069 unification-based grammars The deterministic shift-reduce parsing algorithm for unification-based
N06-2033 experiments , as described below . The deterministic shift-reduce parsing algorithm of ( Nivre &amp; Scholz
hide detail