3. The connected word recognition problem
Problem definition:
Given a fluently spoken sequence of words, how can we determine the optimum match in terms of a concatenation of word reference patterns?

4. To solve the connected word recognition problem, we must resolve the following problems

5. connected word recognition

6. connected word recognition

7. connected word recognition

9. connected word recognition

10. connected word recognition
The alternative algorithms:
Two-level dynamic programming approach
Level building approach
One-stage approach and subsequent generalizations

11. Two-level dynamic programming algorithm

12. Two-level dynamic programming algorithm

14. Two-level dynamic programming algorithm

16. Two-level dynamic programming algorithm
Computation cost of the two-level DP algorithm is:
The required storage of the range reduced algorithm is:
e.g., for M=300, N=40, V=10, R=5
C=1,320,000 grid points
And S=6600 locations for D(b,e)