Dynamic programming search of articulatory codebooks

The authors introduce a delayed-decision method based on dynamic programming for accessing such codebooks. The idea is to retrieve a sequence of shapes for a given sequence of spectra. It is shown that dynamic programming provides smooth parameter trajectories and phonetically reasonable tract shapes, even for difficult segments of speech, for example, during low-energy transitional portions of an utterance.<
>