Zobrazeno 1 - 1
of 1
pro vyhledávání: '"T. Steinbiss"'
Publikováno v:
ICSLP
The authors introduce an efficient algorithm for the exhaustive search of N-best sentence hypotheses in a word graph. The search procedure is based on a two-pass algorithm. In the first pass, a word graph is constructed with standard time-synchronous
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18d3f6286c0eb6babbf195b158586f57
https://doi.org/10.1109/icslp.1996.607223
https://doi.org/10.1109/icslp.1996.607223
