| A Simple Lagrangian Relaxation Algorithm | (2) find the highest scoring derivation using dynamic programming |
| A Simple Lagrangian Relaxation Algorithm | In the first step we compute the highest scoring incoming bigram for each leaf 2). |
| The Full Algorithm | (i.e., for each 2), compute the highest scoring trigram path ending in v.) |
| The Full Algorithm | The first step involves finding the highest scoring incoming trigram path for each leaf 2). |