An efficient implementation of the n-best algorithm for lexical access

Peter Nowell, Henry S. Thompson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper describes an efficient implementation of the N-Best algorithm for lexical access. An extension has been made to the original algorithm which reduces the search space by 80% whilst retaining over 99% of the top ten optimal paths produced by the standard N-Best algorithm. We have also found that pruning can reduce the search space further by a further 50% without a significant loss of optimal paths. Keywords: Lexical Access, Dynamic Programming, N-Best Algorithm, Path Re-generation, Beam-Width Pruning
Original languageEnglish
Title of host publicationSecond European Conference on Speech Communication and Technology, EUROSPEECH 1991, Genova, Italy, September 24-26, 1991
Pages4
Number of pages667
Publication statusPublished - 1991

Fingerprint

Dive into the research topics of 'An efficient implementation of the n-best algorithm for lexical access'. Together they form a unique fingerprint.

Cite this