메뉴 건너뛰기




Volumn , Issue , 2002, Pages 156-163

Generation of Word Graphs in Statistical Machine Translation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER AIDED LANGUAGE TRANSLATION; MACHINE TRANSLATION;

EID: 85146415461     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (78)

References (8)
  • 5
    • 0027189233 scopus 로고
    • Word graphs: An efficient interface between continous speech recognition and language understanding
    • pages Minneapolis, MN April
    • Martin Oerder and Hermann Ney. 1993. Word graphs: An efficient interface between continous speech recognition and language understanding. In IEEE International Conference on Acoustics;Speech and Signal Processing, volume 2, pages 119122, Minneapolis, MN, April.
    • (1993) IEEE International Conference on Acoustics;Speech and Signal Processing , vol.2 , pp. 119122
    • Oerder, Martin1    Ney, Hermann2
  • 6
    • 0030719155 scopus 로고    scopus 로고
    • A word graph algorithm for large vocabulary continuous speech recognition
    • l l (l): 4 3 7 2, January
    • Stefan Ortmanns, Hermann Ney, and Xavier Aubert. 1997. A word graph algorithm for large vocabulary continuous speech recognition. Computer;Speech and Language, l l (l): 4 3 7 2, January.
    • (1997) Computer;Speech and Language
    • Ortmanns, Stefan1    Ney, Hermann2    Aubert, Xavier3
  • 8
    • 85118302794 scopus 로고    scopus 로고
    • Word reordering and DP beam search for statistical machine translation
    • to appear in
    • Christoph Tillmann and Hermann Ney. 2002. Word reordering and DP beam search for statistical machine translation, to appear in Computational Linguistics.
    • (2002) Computational Linguistics
    • Tillmann, Christoph1    Ney, Hermann2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.