메뉴 건너뛰기




Volumn , Issue , 2014, Pages 138-147

Evaluating word order recursively over permutation-forests

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS;

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

References (19)
  • 1
    • 25444441476 scopus 로고    scopus 로고
    • Simple permutations and pattern restricted permutations
    • Michael H. Albert and Mike D. Atkinson. 2005. Simple permutations and pattern restricted permutations. Discrete Mathematics, 300(1-3):1–15.
    • (2005) Discrete Mathematics , vol.300 , Issue.1-3 , pp. 1-15
    • Albert, Michael H.1    Atkinson, Mike D.2
  • 8
  • 10
    • 33845475442 scopus 로고    scopus 로고
    • Automatic Evaluation of Information Ordering: Kendall’s Tau
    • Mirella Lapata. 2006. Automatic Evaluation of Information Ordering: Kendall’s Tau. Computational Linguistics, 32(4):471–484.
    • (2006) Computational Linguistics , vol.32 , Issue.4 , pp. 471-484
    • Lapata, Mirella1
  • 14
    • 85133336275 scopus 로고    scopus 로고
    • Bleu: a method for automatic evaluation of machine translation
    • Philadelphia, PA, USA
    • Kishore Papineni, Salim Roukos, Todd Ward, and Wei-Jing Zhu. 2002. Bleu: a method for automatic evaluation of machine translation. In Proceedings of ACL’02, pages 311–318, Philadelphia, PA, USA.
    • (2002) Proceedings of ACL’02 , pp. 311-318
    • Papineni, Kishore1    Roukos, Salim2    Ward, Todd3    Zhu, Wei-Jing4
  • 17
    • 0000319590 scopus 로고    scopus 로고
    • Stochastic inversion transduction grammars and bilingual parsing of parallel corpora
    • Dekai Wu. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics, 3(23):377–403.
    • (1997) Computational Linguistics , vol.3 , Issue.23 , pp. 377-403
    • Wu, Dekai1


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