메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1182-1191

A syntactified Direct Translation Model with linear-time decoding

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; DECODING; FORESTRY; FORMAL LANGUAGES; NATURAL LANGUAGE PROCESSING SYSTEMS; TRANSLATION (LANGUAGES);

EID: 79952272599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1699648.1699664     Document Type: Conference Paper
Times cited : (11)

References (24)
  • 1
    • 0003356044 scopus 로고    scopus 로고
    • Supertagging: An approach to almost parsing
    • 1999
    • Bangalore, S. and Joshi, A. (1999). "Supertagging: An Approach to Almost Parsing", Computational Linguistics 5(2):237-265, 1999.
    • (1999) Computational Linguistics , vol.5 , Issue.2 , pp. 237-265
    • Bangalore, S.1    Joshi, A.2
  • 2
  • 14
    • 35048882514 scopus 로고    scopus 로고
    • Pharaoh: A beam search decoder for phrase-based statistical machine translation models.Machine translation: From real users to research
    • Washington, DC
    • Koehn, P. (2004a). Pharaoh: A Beam Search Decoder for phrase-based Statistical Machine Translation Models.Machine Translation: From Real Users to Research. In Proceedings of 6th Conference of the Association for Machine Translation in the Americas, AMTA 2004, pp.115-124,Washington, DC.
    • (2004) Proceedings of 6th Conference of the Association for Machine Translation in the Americas, AMTA 2004 , pp. 115-124
    • Koehn, P.1
  • 20
    • 84859913396 scopus 로고    scopus 로고
    • A new string-to-dependency machine translation algorithm with a target dependency language model
    • Columbus, OH
    • Shen, L., Xu, J., and Weischedel, R. (2008). A new string-to-dependency machine translation algorithm with a target dependency language model. In Proceedings of ACL-08: HLT, pp.577-585, Columbus, OH.
    • (2008) Proceedings of ACL-08: HLT , pp. 577-585
    • Shen, L.1    Xu, J.2    Weischedel, R.3
  • 23
    • 0041877353 scopus 로고    scopus 로고
    • Word reordering and a dynamic programming beam search algorithm for statistical machine translation
    • Tillmann, C. and Ney, H. (2003). Word reordering and a dynamic programming beam search algorithm for statistical machine translation. Computational Linguistics, 29(1):97-133.
    • (2003) Computational Linguistics , vol.29 , Issue.1 , pp. 97-133
    • Tillmann, C.1    Ney, H.2


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