| W99-0703 | alignment of pairs using a standard | dynamic programming scheme | . The only constraints in the |
| J01-1003 | alignment of pairs using a standard | dynamic programming scheme | . The only constraints in the |
| J94-2001 | is easily implemented using a | dynamic programming scheme | ( Bellman 1957 ) . The Maximum |
| P98-1117 | basis of the SGML structure . A | dynamic programming scheme | is applied to all alignment levels |
| N10-1092 | parsing algorithm that is based on a | Dynamic Programming Scheme | was proposed in ( Wu , 1997 ) |
| J94-2001 | tagging . It is achieved using a | dynamic programming scheme | . • for evaluation at word |
| A00-1019 | overlapping possibilities , we used a | dynamic programming scheme | which optimized a criterion C |
| T87-1012 | nature of natural languages in a | dynamic programming scheme | that avoids , to a large extent |
| W06-3106 | algorithm in Figure 3 ) by a bottom-up | dynamic programming scheme | relying on the following recursion |
| J13-4002 | Huang and Sagae ( 2010 ) present a | dynamic programming scheme | for a feature-rich arc-standard |
| J04-4003 | computed using the following simple | dynamic programming scheme | , described , for example , by |
| J04-4003 | specified . 3.3.1 Adapting the | Dynamic Programming Scheme | . A simple adaptation of the |
| P98-1117 | proposed by BALI is based on a | dynamic programming scheme | which uses a score function derived |
