In this paper, we report a speech parsing scheme with a new search method. The approach is based on the Divide and Conquer(DC) strategy. By dividing a given phonetic lattice, we construct a PD-tree to represent all the possible parsing paths generated from the lattice. Using the PD-tree, we introduce a parsing procedure called DC parsing, propose a new search method called DR search. This approach gives us the optimal or iV-best sentence candidates, and generates only a small hypothesis space, for a given phonetic lattice. Effectiveness of the approach was proved by the simulation experiments.
Bibliographic reference. Wang, Ming-Sheng / Imai, Satoshi (1995): "Speech parsing by downward request search based on the divide and conquer method", In EUROSPEECH-1995, 905-908.