메뉴 건너뛰기




Volumn , Issue , 2016, Pages 1-17

Inside-outside and forward-backward algorithms are just backprop (tutorial paper)

Author keywords

[No Author keywords available]

Indexed keywords

BACKPROPAGATION;

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

References (61)
  • 4
    • 0000421434 scopus 로고
    • On formal properties of simple phrase structure grammars
    • Reprinted in Y. Bar-Hillel. (1964). Language and Information: Selected Essays on their Theory and Application, Addison-Wesley 1964, 116-150
    • Yehoshua Bar-Hillel, M. Perles, and E. Shamir. On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung, 14:143-172, 1961. Reprinted in Y. Bar-Hillel. (1964). Language and Information: Selected Essays on their Theory and Application, Addison-Wesley 1964, 116-150.
    • (1961) Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung , vol.14 , pp. 143-172
    • Bar-Hillel, Yehoshua1    Perles, M.2    Shamir, E.3
  • 5
    • 0001862769 scopus 로고
    • An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process
    • L. E. Baum. An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process. Inequalities, 3, 1972.
    • (1972) Inequalities , vol.3
    • Baum, L. E.1
  • 8
    • 85149151287 scopus 로고
    • The structure of shared forests in ambiguous parsing
    • April
    • S. Billot and B. Lang. The structure of shared forests in ambiguous parsing. In Proceedings of ACL, pages 143-151, April 1989.
    • (1989) Proceedings of ACL , pp. 143-151
    • Billot, S.1    Lang, B.2
  • 10
    • 0005921071 scopus 로고    scopus 로고
    • Statistical properties of probabilistic context-free grammars
    • Zhiyi Chi. Statistical properties of probabilistic context-free grammars. Computational Linguistics, 25(1): 131-160, 1999.
    • (1999) Computational Linguistics , vol.25 , Issue.1 , pp. 131-160
    • Chi, Zhiyi1
  • 12
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the EM algorithm
    • discussion
    • A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. Royal Statist. Soc. Ser. B, 39(1):1-38, 1977. With discussion.
    • (1977) J. Royal Statist. Soc. Ser. B , vol.39 , Issue.1 , pp. 1-38
    • Dempster, A. P.1    Laird, N. M.2    Rubin, D. B.3
  • 13
    • 0014732304 scopus 로고
    • An efficient context-free parsing algorithm
    • J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102, 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.2 , pp. 94-102
    • Earley, J.1
  • 14
    • 4043070633 scopus 로고    scopus 로고
    • Three new probabilistic models for dependency parsing: An exploration
    • Copenhagen, August
    • Jason Eisner. Three new probabilistic models for dependency parsing: An exploration. In Proceedings of COLING, pages 340-345, Copenhagen, August 1996.
    • (1996) Proceedings of COLING , pp. 340-345
    • Eisner, Jason1
  • 15
    • 85149140805 scopus 로고    scopus 로고
    • Parameter estimation for probabilistic finite-state transducers
    • Jason Eisner. Parameter estimation for probabilistic finite-state transducers. In Proceedings of ACL, pages 1-8, 2002.
    • (2002) Proceedings of ACL , pp. 1-8
    • Eisner, Jason1
  • 16
    • 71049161956 scopus 로고    scopus 로고
    • Program transformations for optimization of parsing algorithms and other weighted logic programs
    • Jason Eisner and John Blatz. Program transformations for optimization of parsing algorithms and other weighted logic programs. In Proceedings of the 11th Conference on Formal Grammar, pages 45-85, 2007.
    • (2007) Proceedings of the 11th Conference on Formal Grammar , pp. 45-85
    • Eisner, Jason1    Blatz, John2
  • 17
    • 80053265598 scopus 로고    scopus 로고
    • Compiling comp ling: Weighted dynamic programming and the Dyna language
    • Jason Eisner, Eric Goldlust, and Noah A. Smith. Compiling comp ling: Weighted dynamic programming and the Dyna language. In Proceedings of HLT-EMNLP, pages 281-290, 2005.
    • (2005) Proceedings of HLT-EMNLP , pp. 281-290
    • Eisner, Jason1    Goldlust, Eric2    Smith, Noah A.3
  • 18
    • 80053379378 scopus 로고    scopus 로고
    • Solving the problem of cascading errors: Approximate Bayesian inference for linguistic annotation pipelines
    • Jenny Rose Finkel, Christopher D. Manning, and Andrew Y. Ng. Solving the problem of cascading errors: Approximate Bayesian inference for linguistic annotation pipelines. In Proceedings of EMNLP, pages 618-626, 2006.
    • (2006) Proceedings of EMNLP , pp. 618-626
    • Finkel, Jenny Rose1    Manning, Christopher D.2    Ng, Andrew Y.3
  • 21
    • 10244273755 scopus 로고    scopus 로고
    • Efficient algorithms for parsing the DOP model
    • Joshua Goodman. Efficient algorithms for parsing the DOP model. In Proceedings of EMNLP, 1996.
    • (1996) Proceedings of EMNLP
    • Goodman, Joshua1
  • 23
    • 0039029320 scopus 로고    scopus 로고
    • Semiring parsing
    • December
    • Joshua Goodman. Semiring parsing. Computational Linguistics, 25(4):573-605, December 1999.
    • (1999) Computational Linguistics , vol.25 , Issue.4 , pp. 573-605
    • Goodman, Joshua1
  • 33
    • 0002532056 scopus 로고
    • The estimation of stochastic context-free grammars using the inside-outside algorithm
    • K. Lari and S. Young. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 4:35-56, 1990.
    • (1990) Computer Speech and Language , vol.4 , pp. 35-56
    • Lari, K.1    Young, S.2
  • 34
    • 0026187099 scopus 로고
    • Applications of stochastic context-free grammars using the inside-outside algorithm
    • K. Lari and S. Young. Applications of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 5:237-257, 1991.
    • (1991) Computer Speech and Language , vol.5 , pp. 237-257
    • Lari, K.1    Young, S.2
  • 35
    • 0000134812 scopus 로고
    • Une procédure d'apprentissage pour réseau a seuil asymmetrique (a learning scheme for asymmetric threshold networks)
    • Paris, France
    • Yann LeCun. Une procédure d'apprentissage pour réseau a seuil asymmetrique (a learning scheme for asymmetric threshold networks). In Proceedings of Cognitiva 85, pages 599-604, Paris, France, 1985.
    • (1985) Proceedings of Cognitiva , vol.85 , pp. 599-604
    • LeCun, Yann1
  • 36
    • 80053275857 scopus 로고    scopus 로고
    • First- and second-order expectation semirings with applications to minimum-risk training on translation forests
    • Zhifei Li and Jason Eisner. First- and second-order expectation semirings with applications to minimum-risk training on translation forests. In Proceedings of EMNLP, pages 40-51, 2009.
    • (2009) Proceedings of EMNLP , pp. 40-51
    • Li, Zhifei1    Eisner, Jason2
  • 39
    • 0000116303 scopus 로고    scopus 로고
    • Minimization algorithms for sequential transducers
    • March
    • Mehryar Mohri. Minimization algorithms for sequential transducers. Theoretical Computer Science, 324:177-201, March 2000.
    • (2000) Theoretical Computer Science , vol.324 , pp. 177-201
    • Mohri, Mehryar1
  • 42
    • 85059598488 scopus 로고
    • Inside-outside reestimation from partially bracketed corpora
    • Fernando Pereira and Yves Schabes. Inside-outside reestimation from partially bracketed corpora. In Proceedings of ACL, 1992.
    • (1992) Proceedings of ACL
    • Pereira, Fernando1    Schabes, Yves2
  • 45
    • 34047192804 scopus 로고    scopus 로고
    • Semi-Markov conditional random fields for information extraction
    • Sunita Sarawagi and William W Cohen. Semi-Markov conditional random fields for information extraction. In Proceedings of NIPS, 2004.
    • (2004) Proceedings of NIPS
    • Sarawagi, Sunita1    Cohen, William W2
  • 46
    • 22944492294 scopus 로고
    • A statistical learning method for logic programs with distribution semantics
    • Taisuke Sato. A statistical learning method for logic programs with distribution semantics. In Proceedings of ICLP, pages 715-729, 1995.
    • (1995) Proceedings of ICLP , pp. 715-729
    • Sato, Taisuke1
  • 48
    • 0041355525 scopus 로고
    • Stochastic lexicalized tree-adjoining grammars
    • Yves Schabes. Stochastic lexicalized tree-adjoining grammars. In Proceedings of COLING, 1992.
    • (1992) Proceedings of COLING
    • Schabes, Yves1
  • 50
    • 80053381429 scopus 로고    scopus 로고
    • Probabilistic models of nonprojective dependency trees
    • David A. Smith and Noah A. Smith. Probabilistic models of nonprojective dependency trees. In Proceedings of EMNLP-CoNLL, pages 132-140, 2007.
    • (2007) Proceedings of EMNLP-CoNLL , pp. 132-140
    • Smith, David A.1    Smith, Noah A.2
  • 51
    • 84937297274 scopus 로고
    • An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
    • Andreas Stolcke. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):165-201, 1995.
    • (1995) Computational Linguistics , vol.21 , Issue.2 , pp. 165-201
    • Stolcke, Andreas1
  • 53
    • 0016072295 scopus 로고
    • Determination of probabilistic grammars for functionally specified probability-measure languages
    • Richard A. Thompson. Determination of probabilistic grammars for functionally specified probability-measure languages. IEEE Transactions on Computers, C-23(6):603-614, 1974.
    • (1974) IEEE Transactions on Computers , vol.C-23 , Issue.6 , pp. 603-614
    • Thompson, Richard A.1
  • 54
    • 85072845073 scopus 로고    scopus 로고
    • Speed-accuracy tradeoffs in tagging with variable-order CRFs and structured sparsity
    • Austin, TX, November
    • Tim Vieira, Ryan Cotterell, and Jason Eisner. Speed-accuracy tradeoffs in tagging with variable-order CRFs and structured sparsity. In Proceedings of EMNLP, Austin, TX, November 2016.
    • (2016) Proceedings of EMNLP
    • Vieira, Tim1    Cotterell, Ryan2    Eisner, Jason3
  • 55
    • 85027125157 scopus 로고
    • Characterizing structural descriptions produced by various grammatical formalisms
    • K. Vijay-Shankar, David J. Weir, and Aravind K. Joshi. Characterizing structural descriptions produced by various grammatical formalisms. In Proceedings of ACL, pages 104-111, 1987.
    • (1987) Proceedings of ACL , pp. 104-111
    • Vijay-Shankar, K.1    Weir, David J.2    Joshi, Aravind K.3
  • 56
  • 57
    • 0026221591 scopus 로고
    • A linear algorithm for generating random numbers with a given distribution
    • September
    • Michael D. Vose. A linear algorithm for generating random numbers with a given distribution. IEEE Transactions on Software Engineering, 17(9):972-975, September 1991.
    • (1991) IEEE Transactions on Software Engineering , vol.17 , Issue.9 , pp. 972-975
    • Vose, Michael D.1
  • 59
    • 0001202594 scopus 로고
    • A learning algorithm for continually running fully recurrent neural networks
    • Ronald J. Williams and David Zipser. A learning algorithm for continually running fully recurrent neural networks. Neural Computation, 1(2):270-280, 1989.
    • (1989) Neural Computation , vol.1 , Issue.2 , pp. 270-280
    • Williams, Ronald J.1    Zipser, David2
  • 60
    • 49949139581 scopus 로고
    • Recognition and parsing of context-free languages in time n3
    • February
    • D. H. Younger. Recognition and parsing of context-free languages in time n3. Information and Control, 10(2): 189-208, February 1967.
    • (1967) Information and Control , vol.10 , Issue.2 , pp. 189-208
    • Younger, D. H.1
  • 61
    • 0009577164 scopus 로고    scopus 로고
    • Exact alpha-beta computation in logarithmic space with application to MAP word graph construction
    • G. Zweig and M. Padmanabhan. Exact alpha-beta computation in logarithmic space with application to MAP word graph construction. In Proceedings of ICSLP, 2000.
    • (2000) Proceedings of ICSLP
    • Zweig, G.1    Padmanabhan, M.2


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