메뉴 건너뛰기




Volumn , Issue , 2006, Pages 128-137

Induction of probabilistic synchronous tree-insertion grammars for machine translation

Author keywords

[No Author keywords available]

Indexed keywords

ELEMENTARY STRUCTURE; FINITE-STATE; MACHINE TRANSLATIONS; TEST DATA; TRANSLATION MODELS; TRANSLATION QUALITY;

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

References (87)
  • 1
    • 85044611587 scopus 로고
    • The mathematics of statistical machine translation: Parameter estimation
    • P.F. Brown, S.A. Della Pietra, V.J. Della Pietra, and R.L. Mercer. 1993. The mathematics of statistical machine translation: Parameter estimation. Computational Linguistics, 19(2):263-311.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 263-311
    • Brown, P.F.1    Pietra, S.A.D.2    Pietra, V.J.D.3    Mercer, R.L.4
  • 2
    • 85044611587 scopus 로고
    • The mathematics of statistical machine translation: Parameter estimation
    • P.F. Brown, S.A. Della Pietra, V.J. Della Pietra, and R.L. Mercer. 1993. The mathematics of statistical machine translation: Parameter estimation. Computational Linguistics, 19(2):263-311.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 263-311
    • Brown, P.F.1    Pietra, S.A.D.2    Pietra, V.J.D.3    Mercer, R.L.4
  • 4
    • 84859893686 scopus 로고    scopus 로고
    • A hierarchical phrase-based model for statistical machine translation
    • David Chiang. 2005. A hierarchical phrase-based model for statistical machine translation. In ACL 2005, pages 263-270.
    • (2005) ACL 2005 , pp. 263-270
    • Chiang, D.1
  • 5
    • 0040044720 scopus 로고    scopus 로고
    • Discriminative reranking for natural language parsing
    • Morgan Kaufmann, San Francisco, CA
    • Michael Collins. 2000. Discriminative reranking for natural language parsing. In Proc. 17th International Conf. on Machine Learning, pages 175-182. Morgan Kaufmann, San Francisco, CA.
    • (2000) Proc. 17th International Conf. on Machine Learning , pp. 175-182
    • Collins, M.1
  • 7
    • 85149142007 scopus 로고    scopus 로고
    • Efficient parsing for bilexical context-free grammars and headautomaton grammars
    • Jason Eisner and Giorgio Satta. 1999. Efficient parsing for bilexical context-free grammars and headautomaton grammars. In Proceedings of the ACL.
    • (1999) Proceedings of the ACL
    • Eisner, J.1    Satta, G.2
  • 8
    • 0039029320 scopus 로고    scopus 로고
    • Semiring parsing
    • Joshua Goodman. 1999. Semiring parsing. Computational Linguistics, 25(4):573-605.
    • (1999) Computational Linguistics , vol.25 , Issue.4 , pp. 573-605
    • Goodman, J.1
  • 10
    • 48749119387 scopus 로고    scopus 로고
    • Robust sub-sentential alignment of phrase-structure trees
    • Geneva Switzerland
    • Declan Groves, Mary Hearne, and AndyWay. 2004. Robust sub-sentential alignment of phrase-structure trees. In COLING '04, Geneva Switzerland.
    • (2004) COLING '04
    • Groves, D.1    Hearne, M.2    Way, A.3
  • 15
    • 44949230930 scopus 로고    scopus 로고
    • Europarl: A parallel corpus for machine translation
    • Phuket, Thailand. International Association for Machine Translation
    • Philipp Koehn. 2005. Europarl: A parallel corpus for machine translation. In MT Summit X, Phuket, Thailand. International Association for Machine Translation.
    • (2005) MT Summit X
    • Koehn, P.1
  • 16
    • 0026187099 scopus 로고
    • Applications of stochastic context-free grammars using the Inside-Outside algorithm
    • DOI 10.1016/0885-2308(91)90009-F
    • K. Lari and S.J. Young. 1991. Applications of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 5:237-257. (Pubitemid 21680503)
    • (1991) Computer Speech and Language , vol.5 , Issue.3 , pp. 237-257
    • Lari, K.1    Young, S.J.2
  • 22
    • 0042879653 scopus 로고    scopus 로고
    • A systematic comparison of various statistical alignment models
    • DOI 10.1162/089120103321337421
    • Franz Och and Hermann Ney. 2003. A systematic comparison of various statistical alignment models. Computational Linguistics, 29:19-51. (Pubitemid 37049767)
    • (2003) Computational Linguistics , vol.29 , Issue.1 , pp. 19-51
    • Och, F.J.1    Ney, H.2
  • 25
    • 79953821659 scopus 로고
    • Tree insertion grammar: A cubic time, parsable formalism that lexicalizes context-free grammars without changing the trees produced
    • Yves Schabes and Richard C. Waters. 1995. Tree insertion grammar: A cubic time, parsable formalism that lexicalizes context-free grammars without changing the trees produced. Computational Linguistics, 21(3):479-512.
    • (1995) Computational Linguistics , vol.21 , Issue.3 , pp. 479-512
    • Schabes, Y.1    Waters, R.C.2
  • 28
    • 85044611587 scopus 로고
    • The mathematics of statistical machine translation: Parameter estimation
    • P.F. Brown, S.A. Della Pietra, V.J. Della Pietra, and R.L. Mercer. 1993. The mathematics of statistical machine translation: Parameter estimation. Computational Linguistics, 19(2):263-311.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 263-311
    • Brown, P.F.1    Pietra, S.A.D.2    Pietra, V.J.D.3    Mercer, R.L.4
  • 30
    • 84859893686 scopus 로고    scopus 로고
    • A hierarchical phrase-based model for statistical machine translation
    • David Chiang. 2005. A hierarchical phrase-based model for statistical machine translation. In ACL 2005, pages 263-270.
    • (2005) ACL 2005 , pp. 263-270
    • Chiang, D.1
  • 31
    • 0040044720 scopus 로고    scopus 로고
    • Discriminative reranking for natural language parsing
    • Morgan Kaufmann, San Francisco, CA
    • Michael Collins. 2000. Discriminative reranking for natural language parsing. In Proc. 17th International Conf. on Machine Learning, pages 175-182. Morgan Kaufmann, San Francisco, CA.
    • (2000) Proc. 17th International Conf. on Machine Learning , pp. 175-182
    • Collins, M.1
  • 33
    • 85149142007 scopus 로고    scopus 로고
    • Efficient parsing for bilexical context-free grammars and headautomaton grammars
    • Jason Eisner and Giorgio Satta. 1999. Efficient parsing for bilexical context-free grammars and headautomaton grammars. In Proceedings of the ACL.
    • (1999) Proceedings of the ACL
    • Eisner, J.1    Satta, G.2
  • 34
    • 0039029320 scopus 로고    scopus 로고
    • Semiring parsing
    • Joshua Goodman. 1999. Semiring parsing. Computational Linguistics, 25(4):573-605.
    • (1999) Computational Linguistics , vol.25 , Issue.4 , pp. 573-605
    • Goodman, J.1
  • 36
    • 48749119387 scopus 로고    scopus 로고
    • Robust sub-sentential alignment of phrase-structure trees
    • Geneva Switzerland
    • Declan Groves, Mary Hearne, and AndyWay. 2004. Robust sub-sentential alignment of phrase-structure trees. In COLING '04, Geneva Switzerland.
    • (2004) COLING '04
    • Groves, D.1    Hearne, M.2    Way, A.3
  • 41
    • 44949230930 scopus 로고    scopus 로고
    • Europarl: A parallel corpus for machine translation
    • Phuket, Thailand, International Association for Machine Translation
    • Philipp Koehn. 2005. Europarl: A parallel corpus for machine translation. In MT Summit X, Phuket, Thailand. International Association for Machine Translation.
    • (2005) MT Summit X
    • Koehn, P.1
  • 42
    • 0026187099 scopus 로고
    • Applications of stochastic context-free grammars using the Inside-Outside algorithm
    • DOI 10.1016/0885-2308(91)90009-F
    • K. Lari and S.J. Young. 1991. Applications of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 5:237-257. (Pubitemid 21680503)
    • (1991) Computer Speech and Language , vol.5 , Issue.3 , pp. 237-257
    • Lari, K.1    Young, S.J.2
  • 48
    • 0042879653 scopus 로고    scopus 로고
    • A systematic comparison of various statistical alignment models
    • DOI 10.1162/089120103321337421
    • Franz Och and Hermann Ney. 2003. A systematic comparison of various statistical alignment models. Computational Linguistics, 29:19-51. (Pubitemid 37049767)
    • (2003) Computational Linguistics , vol.29 , Issue.1 , pp. 19-51
    • Och, F.J.1    Ney, H.2
  • 51
    • 79953821659 scopus 로고
    • Tree insertion grammar: A cubic time, parsable formalism that lexicalizes context-free grammars without changing the trees produced
    • Yves Schabes and Richard C. Waters. 1995. Tree insertion grammar: A cubic time, parsable formalism that lexicalizes context-free grammars without changing the trees produced. Computational Linguistics, 21(3):479-512.
    • (1995) Computational Linguistics , vol.21 , Issue.3 , pp. 479-512
    • Schabes, Y.1    Waters, R.C.2
  • 55
    • 0028548980 scopus 로고
    • Restricting the weak-generative capacity of synchronous tree-adjoining grammars
    • Stuart M. Shieber. 1994. Restricting the weak-generative capacity of synchronous tree-adjoining grammars. Computational Intelligence, 10(4):371-385.
    • (1994) Computational Intelligence , vol.10 , Issue.4 , pp. 371-385
    • Shieber, S.M.1
  • 58
    • 0028548980 scopus 로고
    • Restricting the weak-generative capacity of synchronous tree-adjoining grammars
    • Stuart M. Shieber. 1994. Restricting the weak-generative capacity of synchronous tree-adjoining grammars. Computational Intelligence, 10(4):371-385.
    • (1994) Computational Intelligence , vol.10 , Issue.4 , pp. 371-385
    • Shieber, S.M.1
  • 61
    • 84859893686 scopus 로고    scopus 로고
    • A hierarchical phrase-based model for statistical machine translation
    • David Chiang. 2005. A hierarchical phrase-based model for statistical machine translation. In ACL 2005, pages 263-270.
    • (2005) ACL 2005 , pp. 263-270
    • Chiang, D.1
  • 62
    • 0040044720 scopus 로고    scopus 로고
    • Discriminative reranking for natural language parsing
    • Morgan Kaufmann, San Francisco, CA
    • Michael Collins. 2000. Discriminative reranking for natural language parsing. In Proc. 17th International Conf. on Machine Learning, pages 175-182. Morgan Kaufmann, San Francisco, CA.
    • (2000) Proc. 17th International Conf. on Machine Learning , pp. 175-182
    • Collins, M.1
  • 64
    • 85149142007 scopus 로고    scopus 로고
    • Efficient parsing for bilexical context-free grammars and headautomaton grammars
    • Jason Eisner and Giorgio Satta. 1999. Efficient parsing for bilexical context-free grammars and headautomaton grammars. In Proceedings of the ACL.
    • (1999) Proceedings of the ACL
    • Eisner, J.1    Satta, G.2
  • 65
    • 0039029320 scopus 로고    scopus 로고
    • Semiring parsing
    • Joshua Goodman. 1999. Semiring parsing. Computational Linguistics, 25(4):573-605.
    • (1999) Computational Linguistics , vol.25 , Issue.4 , pp. 573-605
    • Goodman, J.1
  • 67
    • 48749119387 scopus 로고    scopus 로고
    • Robust sub-sentential alignment of phrase-structure trees
    • Geneva Switzerland
    • Declan Groves, Mary Hearne, and AndyWay. 2004. Robust sub-sentential alignment of phrase-structure trees. In COLING '04, Geneva Switzerland.
    • (2004) COLING '04
    • Groves, D.1    Hearne, M.2    Way, A.3
  • 73
    • 0026187099 scopus 로고
    • Applications of stochastic context-free grammars using the Inside-Outside algorithm
    • DOI 10.1016/0885-2308(91)90009-F
    • K. Lari and S.J. Young. 1991. Applications of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 5:237-257. (Pubitemid 21680503)
    • (1991) Computer Speech and Language , vol.5 , Issue.3 , pp. 237-257
    • Lari, K.1    Young, S.J.2
  • 79
    • 0042879653 scopus 로고    scopus 로고
    • A systematic comparison of various statistical alignment models
    • DOI 10.1162/089120103321337421
    • Franz Och and Hermann Ney. 2003. A systematic comparison of various statistical alignment models. Computational Linguistics, 29:19-51. (Pubitemid 37049767)
    • (2003) Computational Linguistics , vol.29 , Issue.1 , pp. 19-51
    • Och, F.J.1    Ney, H.2
  • 82
    • 79953821659 scopus 로고
    • Tree insertion grammar: A cubic time, parsable formalism that lexicalizes context-free grammars without changing the trees produced
    • Yves Schabes and Richard C. Waters. 1995. Tree insertion grammar: A cubic time, parsable formalism that lexicalizes context-free grammars without changing the trees produced. Computational Linguistics, 21(3):479-512.
    • (1995) Computational Linguistics , vol.21 , Issue.3 , pp. 479-512
    • Schabes, Y.1    Waters, R.C.2
  • 86
    • 0028548980 scopus 로고
    • Restricting the weak-generative capacity of synchronous tree-adjoining grammars
    • Stuart M. Shieber. 1994. Restricting the weak-generative capacity of synchronous tree-adjoining grammars. Computational Intelligence, 10(4):371-385.
    • (1994) Computational Intelligence , vol.10 , Issue.4 , pp. 371-385
    • Shieber, S.M.1


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