| P98-1021 | to real-time ( by a best-first | Viterbi optimization | algorithm ) . We therefore assume |
| P00-1009 | probable derivation by means of | Viterbi optimization | ( see e.g. Sima'an 1999 ) . 5 |
| W04-1213 | optimization over whole sequence ( e.g , | Viterbi optimization | ) is crucial in this type of |
| E03-1005 | or n simplest trees by means of | Viterbi optimization | . Next , we either select the |
| C00-1011 | probable derivation by means of | Viterbi optimization | ( see Sima'an 1995 , 1999 ) . |
| E03-1005 | and can be computed by standard | Viterbi optimization | , which can be seen as follows |
| E95-1015 | optimization algorithm , known as | Viterbi optimization | , which selects on the basis |
| E95-1015 | derivations of that parse . 3.2.1 | Viterbi optimization | is not feasible for finding the |
