5th International Conference on Spoken Language Processing

Sydney, Australia
November 30 - December 4, 1998

BTH: An Efficient Parsing Algorithm for Word-Spotting

Yasuyuki Kono, Takehide Yano, Munehiko Sasajima

Kansai Research Laboratories, Toshiba Corporation, Japan

This paper presents a new parsing algorithm, BTH, which is capable of efficiently parsing a keyword lattice that contains a large number of false alarms. The BTH parser runs without unfolding the given keyword lattice, so that it can efficiently obtain a set of word sequences acceptable to the given grammar as the parser result. The algorithm has been implemented on Windows-based PCs and is tested by applying it to the car navigation task that has a scale of practical applications. The result shows promise in implementing the function of spontaneous speech understanding from sentence utterance in next-generation car navigation systems.

Full Paper

Bibliographic reference.  Kono, Yasuyuki / Yano, Takehide / Sasajima, Munehiko (1998): "BTH: an efficient parsing algorithm for word-spotting", In ICSLP-1998, paper 0169.