메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1359-1376

Semantics-based machine translation with hyperedge replacement grammars

Author keywords

[No Author keywords available]

Indexed keywords

ALIGNMENT ALGORITHMS; CONTEXT-FREE GRAPH GRAMMARS; HYPEREDGE REPLACEMENT; RULE EXTRACTION ALGORITHMS; SEMANTIC ANNOTATIONS; STATISTICAL MACHINE TRANSLATION; SYNCHRONOUS GRAMMARS; SYNTACTIC ANNOTATION;

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

References (51)
  • 1
    • 0003845417 scopus 로고
    • The present status of automatic translation of languages
    • Alt, F. L. editor, Academic Press, New York
    • Bar-Hillel, Y. (1960). The present status of automatic translation of languages. In Alt, F. L., editor, Advances in Computers. Academic Press, New York.
    • (1960) Advances in Computers
    • Bar-Hillel, Y.1
  • 2
    • 0002981945 scopus 로고    scopus 로고
    • A partial k-arboretum of graphs with bounded treewidth
    • Bodlaender, H. L. (1998). A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci., 209(1-2):1-45.
    • (1998) Theor. Comput. Sci. , vol.209 , Issue.1-2 , pp. 1-45
    • Bodlaender, H.L.1
  • 6
    • 34347360650 scopus 로고    scopus 로고
    • Hierarchical phrase-based translation
    • Chiang, D. (2007). Hierarchical phrase-based translation. Computational Linguistics, 33(2):201-228.
    • (2007) Computational Linguistics , vol.33 , Issue.2 , pp. 201-228
    • Chiang, D.1
  • 15
    • 49549088204 scopus 로고    scopus 로고
    • Learning non-isomorphic tree mappings for machine translation
    • Association for Computational Linguistics
    • Eisner, J. (2003). Learning non-isomorphic tree mappings for machine translation. In Proceedings of the 41st Annual Meeting on Association for Computational Linguistics-Volume 2, pages 205-208. Association for Computational Linguistics.
    • (2003) Proceedings of the 41st Annual Meeting on Association for Computational Linguistics , vol.2 , pp. 205-208
    • Eisner, J.1
  • 19
    • 80053417021 scopus 로고    scopus 로고
    • Automatically learning source-side reordering rules for large scale machine translation
    • Association for Computational Linguistics
    • Genzel, D. (2010). Automatically learning source-side reordering rules for large scale machine translation. In Proceedings of the 23rd International Conference on Computational Linguistics, pages 376-384. Association for Computational Linguistics.
    • (2010) Proceedings of the 23rd International Conference on Computational Linguistics , pp. 376-384
    • Genzel, D.1
  • 21
    • 33746264524 scopus 로고    scopus 로고
    • Training tree transducers
    • Graehl, J. and Knight, K. (2004). Training tree transducers. In HLT-NAACL, pages 105-112.
    • (2004) HLT-NAACL , pp. 105-112
    • Graehl, J.1    Knight, K.2
  • 23
    • 84982842007 scopus 로고    scopus 로고
    • KenLM: Faster and smaller language model queries
    • Edinburgh, UK. Association for Computational Linguistics
    • Heafield, K. (2011). KenLM: Faster and smaller language model queries. In Proceedings of the Sixth Workshop on Statistical Machine Translation, Edinburgh, UK. Association for Computational Linguistics.
    • (2011) Proceedings of the Sixth Workshop on Statistical Machine Translation
    • Heafield, K.1
  • 25
    • 84878195985 scopus 로고    scopus 로고
    • Semantic parsing with bayesian tree transducers
    • Jones, B., Johnson, M., and Goldwater, S. (2012). Semantic parsing with bayesian tree transducers. In ACL 2012.
    • (2012) ACL 2012
    • Jones, B.1    Johnson, M.2    Goldwater, S.3
  • 26
    • 70350564730 scopus 로고    scopus 로고
    • Applications of weighted automata in natural language processing
    • Springer
    • Knight, K. and May, J. (2009). Applications of weighted automata in natural language processing. In Handbook of Weighted Automata. Springer.
    • (2009) Handbook of Weighted Automata
    • Knight, K.1    May, J.2
  • 31
    • 78649300745 scopus 로고    scopus 로고
    • Is it harder to parse Chinese, or the chinese treebank?
    • Levy, R. and Manning, C. D. (2003). Is it harder to parse Chinese, or the Chinese Treebank? In Proceedings of ACL 2003, pages 439-446.
    • (2003) Proceedings of ACL 2003 , pp. 439-446
    • Levy, R.1    Manning, C.D.2
  • 33
    • 80053277685 scopus 로고    scopus 로고
    • A probabilistic forest-to-string model for language generation from typed lambda calculus expressions
    • Association for Computational Linguistics
    • Lu, W. and Ng, H. T. (2011). A probabilistic forest-to-string model for language generation from typed lambda calculus expressions. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 1611-1622. Association for Computational Linguistics.
    • (2011) Proceedings of the Conference on Empirical Methods in Natural Language Processing , pp. 1611-1622
    • Lu, W.1    Ng, H.T.2
  • 34
    • 84990605886 scopus 로고
    • Unification-based semantic interpretation
    • Moore, R. C. (1989). Unification-based semantic interpretation. In Proceedings of ACL 1989, pages 33-41.
    • (1989) Proceedings of ACL 1989 , pp. 33-41
    • Moore, R.C.1
  • 37
    • 0042879653 scopus 로고    scopus 로고
    • A systematic comparison of various statistical alignment models
    • Och, F. J. and Ney, H. (2003). A systematic comparison of various statistical alignment models. Computational Linguistics, 29(1):19-51.
    • (2003) Computational Linguistics , vol.29 , Issue.1 , pp. 19-51
    • Och, F.J.1    Ney, H.2
  • 39
    • 33645983416 scopus 로고    scopus 로고
    • The proposition bank: An annotated corpus of semantic roles
    • Palmer, M., Gildea, D., and Kingsbury, P. (2005). The proposition bank: An annotated corpus of semantic roles. Computational Linguistics, 31(1):71-106.
    • (2005) Computational Linguistics , vol.31 , Issue.1 , pp. 71-106
    • Palmer, M.1    Gildea, D.2    Kingsbury, P.3
  • 42
    • 78650695543 scopus 로고    scopus 로고
    • String-to-dependency statistical machine translation
    • Shen, L., Xu, J., and Weischedel, R. (2010). String-to-dependency statistical machine translation. Computational Linguistics, 36(4):649-671.
    • (2010) Computational Linguistics , vol.36 , Issue.4 , pp. 649-671
    • Shen, L.1    Xu, J.2    Weischedel, R.3
  • 43
    • 49549090944 scopus 로고    scopus 로고
    • Synchronous grammars as tree transducers
    • Shieber, S. M. (2004). Synchronous grammars as tree transducers. In Proceedings of TAG+7, pages 88-95.
    • (2004) Proceedings of TAG+7 , pp. 88-95
    • Shieber, S.M.1
  • 46
    • 85025645249 scopus 로고    scopus 로고
    • Syntax augmented machine translation via chart parsing
    • New York City: Association for Computational Linguistics
    • Venugopal, A. and Zollmann, A. (2006). Syntax augmented machine translation via chart parsing. In Proceedings on the Workshop on Statistical Machine Translation. New York City: Association for Computational Linguistics, pages 138-141.
    • (2006) Proceedings on the Workshop on Statistical Machine Translation , pp. 138-141
    • Venugopal, A.1    Zollmann, A.2
  • 47
    • 0011898389 scopus 로고
    • Translation
    • MIT Press, Cambridge, MA
    • Weaver, W. (1955). Translation. In Machine translation of languages, volume 14, pages 15-23. MIT Press, Cambridge, MA.
    • (1955) Machine Translation of Languages , vol.14 , pp. 15-23
    • Weaver, W.1


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