-
Level Building is one method to circumvent the numerous
computations required for exhaustive search
-
Consider a i-j axis with Itakura constraints imposed
-
If there are L words in the test utterance then the reference
axis is partitioned into L "levels" into which various
isolated reference strings are "plugged"
-
Let rv denote the reference string
corresponding to word v
-
For r1 the method proceeds to find the best path
to ending points of level 1 using DP techniques
-
Grid points are evaluated for a fixed i sequentially
along the j dimension until topmost allowable point is
reached.Then i is incremented and search is continued