메뉴 건너뛰기




Volumn , Issue , 2009, Pages 236-244

Preference grammars: Softening syntactic constraints to improve statistical machine translation

Author keywords

[No Author keywords available]

Indexed keywords

LABELING PROCEDURES; LANGUAGE MODEL; LOGLINEAR MODEL; MATCHING CONSTRAINTS; STATISTICAL MACHINE TRANSLATION; TRANSLATION QUALITY;

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

References (19)
  • 4
  • 15
    • 0036341851 scopus 로고    scopus 로고
    • Computational complexity of probabilistic disambiguation
    • Khalil Sima'an. 2002. Computational complexity of probabilistic disambiguation. Grammars, 5(2):125-151.
    • (2002) Grammars , vol.5 , Issue.2 , pp. 125-151
    • Sima'an, K.1


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