Chien, Lee-FengLee-FengChienLIN-SHAN LEEChen, Keh-JiannKeh-JiannChen2009-02-272018-07-062009-02-272018-07-06199101676393http://ntur.lib.ntu.edu.tw//handle/246246/142082https://www.scopus.com/inward/record.uri?eid=2-s2.0-0026170093&doi=10.1016%2f0167-6393%2891%2990036-S&partnerID=40&md5=0a5a25e23c23a42fcd4344491d654f6cThis paper proposes an augmented chart data structure with an efficient word lattice parsing scheme in speech recognition. The augmented chart and the associated parsing algorithm can represent and very efficiently parse, without changing the fundamental principles of chart parsing, a lattice of lexically highly ambiguous word hypotheses in speech recognition. Every word lattice can be mapped to the augmented chart, with the ordering and link between the word hypotheses being well preserved in the augmented chart. A jump edge is defined in order to link edges representing word hypotheses physically separate, but connectable from a practical point of view. Preliminary experimental results show that with augmented chart parsing, all the possible constituents of the input word lattice can be constructed and no constituent needs to be built more than once. This significantly reduces computational complexity, especially when serious lexical ambiguity exists in the input word lattice as in the case of many speech recognition problems. This augmented chart parsing is thus very a useful and efficient approach to language processing problems in speech recognition. © 1991.application/pdf1162989 bytesapplication/pdfen-USchart parsing; speech recognition; Word lattice parsingComputer Programming - Algorithms; Augmented Chart Data Structure; Chart Parsing; Efficient Word Lattice Parsing; Jump Edge; Language Processing; Parsing Algorithm; Speechjournal article10.1016/0167-6393(91)90036-S2-s2.0-0026170093http://ntur.lib.ntu.edu.tw/bitstream/246246/142082/1/03.pdf