메뉴 건너뛰기




Volumn , Issue , 2009, Pages 60-68

On the complexity of alignment problems in two synchronous grammar formalisms

Author keywords

[No Author keywords available]

Indexed keywords

ALIGNMENT PROBLEMS; GRAMMAR FORMALISMS; INVERSION TRANSDUCTION GRAMMARS; MACHINE TRANSLATIONS; RANGE CONCATENATION GRAMMARS; SYNCHRONOUS GRAMMARS;

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

References (10)
  • 5
    • 80053270718 scopus 로고    scopus 로고
    • Decoding complexity in word-replacement translation models
    • Kevin Knight. 1999. Decoding complexity in word-replacement translation models. Computational Linguistics, 25(4):607-615.
    • (1999) Computational Linguistics , vol.25 , Issue.4 , pp. 607-615
    • Knight, Kevin1
  • 6
    • 0040213339 scopus 로고    scopus 로고
    • Bitext maps and alignment via pattern recognition
    • Dan Melamed. 1999. Bitext maps and alignment via pattern recognition. Computational Linguistics, 25(1):107-130.
    • (1999) Computational Linguistics , vol.25 , Issue.1 , pp. 107-130
    • Melamed, Dan1
  • 9
    • 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, 23(3):377-403.
    • (1997) Computational Linguistics , vol.23 , Issue.3 , pp. 377-403
    • Wu, Dekai1


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