Presentation 2000/1/21
A Study on Network Structure of Lexical Tree Search
Jun Ogata, Yasuo Ariki,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose an efficient network structure of lexical tree search, and evaluate the proposed method. At first, we describe some problems about processing time and memory requirments in lexical tree search, and then we discuss on the method to solve these problems. We propose a new type network structure where the word with the best partial score in frame is only linked to the back-off connection. The experimental results showed that this method can reduce about half of the processing time without increasing any errors.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) LVCSR / Lexical tree search / back-off bigram / word graph
Paper # SP99-142
Date of Issue

Conference Information
Committee SP
Conference Date 2000/1/21(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Speech (SP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Study on Network Structure of Lexical Tree Search
Sub Title (in English)
Keyword(1) LVCSR
Keyword(2) Lexical tree search
Keyword(3) back-off bigram
Keyword(4) word graph
1st Author's Name Jun Ogata
1st Author's Affiliation Faculty of Science and Technology, Ryukoku University()
2nd Author's Name Yasuo Ariki
2nd Author's Affiliation Faculty of Science and Technology, Ryukoku University
Date 2000/1/21
Paper # SP99-142
Volume (vol) vol.99
Number (no) 577
Page pp.pp.-
#Pages 6
Date of Issue