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)

17. Level Building algorithm

25. Computation
Of The
Level Building
Algorithm

26. Implementation Aspects of Level Building
Beginning range reduction – MT
Global range reduction – ε
Test pattern ending range – δEND
Reference pattern uncertainty regions – δR1 , δR2

31. Integration of a Grammar Network

33. 1 I 5
ONE 9
BOOKS 13
OLD 2
WANT 6 A 10
COAT 3
NEED 7 AN 11
COATS 4
THREE 8
BOOK 12
NEW

34. Current
Words
Predecessor
State
Uses
Level
Levels 2 I 1 3
WANT 4
NEED 5
THREE 6 A 7 AN 8
ONE
NEW
OLD 9 9*
BOOK, COAT 10
7,8,9
BOOKS, COATS 11

37. One-pass or One-state algorithm
Also known as frame-synchronous level building (FSLB) method
For each test frame the accumulated distance is calculated as:

38. One-pass or One-state algorithm

39. One-pass or One-state algorithm

40. One-pass or One-state algorithm
The problem is that no mechanism is provided for
Controlling the resulting string path.
For incorporating the level, we write:

41. Incorporating multiple
candidate strings

44. Using HMM in level building

49. Segmental k-means Training Algorithm