| N04-4007 | hypothesis with the book text using a | Dynamic Programming search | . In order to allow for skipping |
| C94-1032 | the central part of the forward | dynamic programming search | algorithm . It starts from the |
| C04-1182 | hypothesis with the story text using a | Dynamic Programming search | . In order to allow for skipping |
| J00-1004 | transduction model , we apply a | dynamic programming search | to find the optimal derivation |
| N04-4007 | active reading location . The | Dynamic Programming search | additionally incorporates constraints |
| J00-1004 | are applied hierarchically . A | dynamic programming search | algorithm is described for finding |
| C04-1182 | active reading location . The | Dynamic Programming search | additionally incorporates constraints |
| P02-1038 | efficient handling using conventional | dynamic programming search | algorithms . In addition , it |
| N09-2047 | done locally and does not need a | dynamic programming search | . We trained a Maxent model with |
| J04-4002 | possible to develop an efficient | dynamic programming search | algorithm . Not all feature functions |
| P11-1160 | refer to alignment matrix and a | dynamic programming search | algorithm to obtain better projected |
| P10-1002 | refer to alignment matrix and a | dynamic programming search | algorithm to obtain better projected |
| H90-1037 | split and merge algorithm and the | dynamic programming search | , both using bigram probabilities |
| P13-1018 | using dynamic pro- gramming . | Dynamic programming search | . The insight we use to improve |
| J00-1004 | source and target strings . A | dynamic programming search | algorithm finds optimal ( lowest |
| P09-1058 | ) . In this paper , we apply a | dynamic programming search | ( Nagata , 1994 ) to kbest MIRA |
| N09-1027 | method embedded within the usual | dynamic programming search | . 5 Decoding Approximations As |
| P02-1038 | straightforward integration into the used | dynamic programming search | algorithm ( Och et al. , 1999 |
| C94-1032 | algorithm consists of a forward | dynamic programming search | and a backward A * search . First |
| C96-2136 | algorithm consists of a forward | dynamic programming search | and a backward A * search . The |
