메뉴 건너뛰기




Volumn 154, Issue 1-2, 2004, Pages 127-143

Fast and optimal decoding for machine translation

Author keywords

Decoding; Machine translation; MT; SMT; Statistical machine translation

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; DECODING; INTEGER PROGRAMMING;

EID: 1242310001     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2003.06.001     Document Type: Article
Times cited : (36)

References (14)
  • 3
    • 85044611587 scopus 로고
    • The mathematics of statistical machine translation: Parameter estimation
    • Brown P., Della Pietra S., Della Pietra V., Mercer R. The mathematics of statistical machine translation: Parameter estimation. Computat. Linguistics. 19:(2):1993;263-311.
    • (1993) Computat. Linguistics , vol.19 , Issue.2 , pp. 263-311
    • Brown, P.1    Della Pietra, S.2    Della Pietra, V.3    Mercer, R.4
  • 5
    • 84899829959 scopus 로고
    • A formal basis for the heuristic determination of minimum cost paths
    • Hart P.E., Nilsson N.J., Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. System Sci. Cybernet. 4:(2):1968;100-107.
    • (1968) IEEE Trans. System Sci. Cybernet. , vol.4 , Issue.2 , pp. 100-107
    • Hart, P.E.1    Nilsson, N.J.2    Raphael, B.3
  • 6
    • 0014602879 scopus 로고
    • A fast sequential decoding algorithm using a stack
    • Jelinek F. A fast sequential decoding algorithm using a stack. IBM Res. J. Res. Development. 13:1969;675-685.
    • (1969) IBM Res. J. Res. Development , vol.13 , pp. 675-685
    • Jelinek, F.1
  • 7
    • 80053270718 scopus 로고    scopus 로고
    • Decoding complexity in word-replacement translation models
    • Knight K. Decoding complexity in word-replacement translation models. Comput. Linguistics. 25:(4):1999;607-615.
    • (1999) Comput. Linguistics , vol.25 , Issue.4 , pp. 607-615
    • Knight, K.1
  • 8
    • 0033536221 scopus 로고    scopus 로고
    • Determining computational complexity from characteristic 'phrase transitions'
    • Monasson R., Zecchina R., Kirkpatrick S., Selman B., Troyansky L. Determining computational complexity from characteristic 'phrase transitions'. Nature. 800:(8):1999;133-137.
    • (1999) Nature , vol.800 , Issue.8 , pp. 133-137
    • Monasson, R.1    Zecchina, R.2    Kirkpatrick, S.3    Selman, B.4    Troyansky, L.5
  • 11
    • 0027001335 scopus 로고
    • A new method for solving hard satisfiability problems
    • San Jose, CA
    • Selman B., Levesque H., Mitchell D. A new method for solving hard satisfiability problems. Proceedings of AAAI-92, San Jose, CA. 1992;440-446.
    • (1992) Proceedings of AAAI-92 , pp. 440-446
    • Selman, B.1    Levesque, H.2    Mitchell, D.3
  • 12
  • 13
    • 85149142436 scopus 로고    scopus 로고
    • Decoding algorithm in statistical machine translation
    • Wang Y., Waibel A. Decoding algorithm in statistical machine translation. Proceedings of the 35th ACL. 1997;366-372.
    • (1997) Proceedings of the 35th ACL , pp. 366-372
    • Wang, Y.1    Waibel, A.2
  • 14
    • 46449111227 scopus 로고    scopus 로고
    • A polynomial-time algorithm for statistical machine translation
    • Wu D. A polynomial-time algorithm for statistical machine translation. Proceedings of the 34th ACL. 1996;152-158.
    • (1996) Proceedings of the 34th ACL , pp. 152-158
    • Wu, D.1


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