| P02-1039 | optimal decoding by using a standard | dynamic-programming parser | with beam search , which is similar |
| W02-0111 | syntactic combi - nation ; and discuss | dynamic-programming parsers | , with an aside on convenient |
| P13-2111 | graph-structured stack ( GSS ) used in the | dynamic-programming parser | of Huang and Sagae ( 2010 ) , |
| P11-1068 | transition system in order to get a | dynamic-programming parser | that simulates its computations |
| N09-1039 | implemented in an ordinary CKY-style | dynamic-programming parser | , and can therefore simply be |
