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

Peter Nowell; Henry S. Thompson

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

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Second European Conference on Speech Communication and Technology, EUROSPEECH 1991, Genova, Italy, September 24-26, 1991
Pages	4
Number of pages	667
Publication status	Published - 1991

Access to Document

http://www.isca-speech.org/archive/eurospeech_1991/e91_0667.html

Cite this

@inproceedings{c32c5dd178b542b69515988ce836ad82,

title = "An efficient implementation of the n-best algorithm for lexical access",

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",

author = "Peter Nowell and Thompson, \{Henry S.\}",

year = "1991",

language = "English",

pages = "4",

booktitle = "Second European Conference on Speech Communication and Technology, EUROSPEECH 1991, Genova, Italy, September 24-26, 1991",

}

TY - GEN

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

AU - Nowell, Peter

AU - Thompson, Henry S.

PY - 1991

Y1 - 1991

N2 - 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

AB - 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

M3 - Conference contribution

SP - 4

BT - Second European Conference on Speech Communication and Technology, EUROSPEECH 1991, Genova, Italy, September 24-26, 1991

ER -

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

Abstract

Access to Document

Fingerprint

Cite this