메뉴 건너뛰기




Volumn , Issue , 2009, Pages 259-268

Fluency, Adequacy, or HTER? Exploring Different Human Judgments with a Tunable MT Metric

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

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

References (18)
  • 3
    • 80053349051 scopus 로고    scopus 로고
    • Syntactic constraints on paraphrases extracted from parallel corpora
    • Honolulu, Hawaii, October. Association for Computational Linguistics
    • Chris Callison-Burch. 2008. Syntactic constraints on paraphrases extracted from parallel corpora. In Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing, pages 196- 205, Honolulu, Hawaii, October. Association for Computational Linguistics.
    • (2008) Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing , pp. 196-205
    • Callison-Burch, Chris1
  • 7
    • 0001116877 scopus 로고
    • Binary Codes Capable of Correcting Deletions, Insertions, and Reversals
    • V. I. Levenshtein. 1966. Binary Codes Capable of Correcting Deletions, Insertions, and Reversals. Soviet Physics Doklady, 10:707-710.
    • (1966) Soviet Physics Doklady , vol.10 , pp. 707-710
    • Levenshtein, V. I.1
  • 8
    • 0031187745 scopus 로고    scopus 로고
    • Block edit models for approximate string matching
    • July
    • Daniel Lopresti and Andrew Tomkins. 1997. Block edit models for approximate string matching. Theoretical Computer Science, 181(1):159-179, July.
    • (1997) Theoretical Computer Science , vol.181 , Issue.1 , pp. 159-179
    • Lopresti, Daniel1    Tomkins, Andrew2
  • 14
    • 84948481845 scopus 로고
    • An algorithm for suffic stripping
    • Martin F. Porter. 1980. An algorithm for suffic stripping. Program, 14(3):130-137.
    • (1980) Program , vol.14 , Issue.3 , pp. 130-137
    • Porter, Martin F.1


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