메뉴 건너뛰기




Volumn 4, Issue 2, 2011, Pages 1-270

Linguistic Structure Prediction

Author keywords

computational linguistics; decoding; machine learning; natural language processing; probabilistic inference; statistical modeling; structured prediction; supervised learning; unsupervised learning

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL LINGUISTICS; DECODING; FORECASTING; LEARNING ALGORITHMS; LEARNING SYSTEMS; MODELING LANGUAGES; NATURAL LANGUAGE PROCESSING SYSTEMS; SUPERVISED LEARNING; UNSUPERVISED LEARNING;

EID: 84873691280     PISSN: None     EISSN: 19474040     Source Type: Book Series    
DOI: 10.2200/S00361ED1V01Y201105HLT013     Document Type: Article
Times cited : (84)

References (352)
  • 1
    • 85055469327 scopus 로고    scopus 로고
    • Number 8 in Chapman and Hall/CRC Computer Science and Data Analysis Series. CRC Press
    • Steven Abney. Semisupervised Learning for Computational Linguistics. Number 8 in Chapman and Hall/CRC Computer Science and Data Analysis Series. CRC Press, 2007.
    • (2007) Semisupervised Learning for Computational Linguistics
    • Abney, S.1
  • 2
    • 0016355478 scopus 로고
    • A new look at the statistical model identification
    • Hirotugu Akaike. A new look at the statistical model identification. IEEETransactions on Automatic Control, 19(6), 1974. DOI: 10.1109/TAC.1974.1100705
    • (1974) IEEETransactions on Automatic Control , vol.19 , Issue.6
    • Akaike, H.1
  • 4
    • 0001144334 scopus 로고
    • An argument for divine providence, taken from the constant regularity observed in the births of both sexes
    • John Arbuthnott. An argument for divine providence, taken from the constant regularity observed in the births of both sexes. Philosophical Transactions of the Royal Society of London, 27:186-190, 1710. DOI: 10.1098/rstl.1710.0011
    • (1710) Philosophical Transactions of the Royal Society of London , vol.27 , pp. 186-190
    • Arbuthnott, J.1
  • 8
    • 0002703873 scopus 로고
    • Trainable grammars for speech recognition
    • Boston, Massachusetts, USA, June
    • James K. Baker. Trainable grammars for speech recognition. In Proceedings of the Acoustical Society of America, pages 547-550, Boston, Massachusetts, USA, June 1979. DOI: 10.1121/1.2017061
    • (1979) Proceedings of the Acoustical Society of America , pp. 547-550
    • Baker, J.K.1
  • 10
    • 0003356044 scopus 로고    scopus 로고
    • Supertagging: An approach to almost parsing
    • Srinivas Bangalore and Aravind K. Joshi. Supertagging: An approach to almost parsing. Computational Linguistics, 25(2):237-265, 1999.
    • (1999) Computational Linguistics , vol.25 , Issue.2 , pp. 237-265
    • Bangalore, S.1    Joshi, A.K.2
  • 14
    • 0000342467 scopus 로고
    • Statistical inference for probabilistic functions of finite state markov chains
    • L. E. Baum and T. Petrie. Statistical inference for probabilistic functions of finite state Markov chains. Annals of Mathematical Statistics, 37:1554-1563, 1966. DOI: 10.1214/aoms/1177699147
    • (1966) Annals of Mathematical Statistics , vol.37 , pp. 1554-1563
    • Baum, L.E.1    Petrie, T.2
  • 15
    • 0000353178 scopus 로고
    • Amaximization technique occurring in the statistical analysis of probabilistic functions of markov chains
    • L. E. Baum, T. Petrie, G. Soules, and N. Weiss. Amaximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Annals of Mathematical Statistics, 41:164-171, 1970. DOI: 10.1214/aoms/1177697196
    • (1970) Annals of Mathematical Statistics , vol.41 , pp. 164-171
    • Baum, L.E.1    Petrie, T.2    Soules, G.3    Weiss, N.4
  • 16
    • 84898936541 scopus 로고    scopus 로고
    • The infinite hidden markov model
    • Thomas G. Dietterich, Suzanna Becker, and Zoubin Ghahramani, editors. MIT Press
    • Matthew J. Beal, Zoubin Ghahramani, and Carl Edward Rasmussen. The infinite hidden Markov model. In Thomas G. Dietterich, Suzanna Becker, and Zoubin Ghahramani, editors, Advances in Neural Information Processing Systems 14.MIT Press, 2002.
    • (2002) Advances in Neural Information Processing Systems , vol.14
    • Beal, M.J.1    Ghahramani, Z.2    Rasmussen, C.E.3
  • 29
    • 80053226382 scopus 로고    scopus 로고
    • Bayesian synchronous grammar induction
    • Daphne Koller, Dale Schuurmans, Yoshua Bengio, and Léon Bottou, editors, MIT Press
    • Phil Blunsom, Trevor Cohn, and Miles Osborne. Bayesian synchronous grammar induction. In Daphne Koller, Dale Schuurmans, Yoshua Bengio, and Léon Bottou, editors, Advances in Neural Information Processing Systems 21.MIT Press, 2009.
    • (2009) Advances in Neural Information Processing Systems , vol.21
    • Blunsom, P.1    Cohn, T.2    Osborne, M.3
  • 31
    • 33947180792 scopus 로고    scopus 로고
    • Stochastic learning
    • Olivier Bousquet and Ulrike von Luxburg, editors, in Lecture Notes in Artificial Intelligence, Springer
    • Léon Bottou. Stochastic learning. In Olivier Bousquet and Ulrike von Luxburg, editors, Advanced Lectures on Machine Learning, number 3176 in Lecture Notes in Artificial Intelligence, pages 146-168. Springer, 2004.
    • (2004) Advanced Lectures on Machine Learning , vol.3176 , pp. 146-168
    • Bottou, L.1
  • 39
    • 84987014188 scopus 로고
    • The k best spanning arborescences of a network
    • Paolo M. Camerini, Luigi Fratta, and Francesco Maffioli. The k best spanning arborescences of a network. Networks, 10(2):91-110, 1980. DOI: 10.1002/net.3230100202
    • (1980) Networks , vol.10 , Issue.2 , pp. 91-110
    • Camerini, P.M.1    Fratta, L.2    Maffioli, F.3
  • 40
    • 0010039182 scopus 로고    scopus 로고
    • New figures of merit for best-first probabilistic chart parsing
    • Sharon A. Caraballo and Eugene Charniak. New figures of merit for best-first probabilistic chart parsing. Computational Linguistics, 24(2):275-298, 1998.
    • (1998) Computational Linguistics , vol.24 , Issue.2 , pp. 275-298
    • Caraballo, S.A.1    Charniak, E.2
  • 41
    • 33644996271 scopus 로고    scopus 로고
    • Building a discourse-tagged corpus in the framework of rhetorical structure theory
    • Jan van Kuppevelt and Ronnie W. Smith, editors, Springer
    • Lynn Carlson, Daniel Marcu, and Mary Ellen Okurowski. Building a discourse-tagged corpus in the framework of rhetorical structure theory. In Jan van Kuppevelt and Ronnie W. Smith, editors, Current and New Directions in Discourse and Dialogue. Springer, 2003.
    • (2003) Current and New Directions in Discourse and Dialogue
    • Carlson, L.1    Marcu, D.2    Okurowski, M.E.3
  • 53
    • 33746536145 scopus 로고    scopus 로고
    • Adaptation of maximum entropy capitalizer: Little data can help a lot
    • Ciprian Chelba and Alex Acero. Adaptation of maximum entropy capitalizer: Little data can help a lot. Computer Speech and Language, 20(4), 2006. DOI: 10.1016/j.csl.2005.05.005
    • (2006) Computer Speech and Language , vol.20 , Issue.4
    • Chelba, C.1    Acero, A.2
  • 55
    • 0033887568 scopus 로고    scopus 로고
    • Asurvey of smoothing techniques for maximum entropy models
    • Stanley F. Chen and Roni Rosenfeld. Asurvey of smoothing techniques for maximum entropy models. IEEETransactions on Speech and Audio Processing, 8(1):37-50, 2000. DOI: 10.1109/89.817452
    • (2000) IEEETransactions on Speech and Audio Processing , vol.8 , Issue.1 , pp. 37-50
    • Chen, S.F.1    Rosenfeld, R.2
  • 56
    • 84859893686 scopus 로고    scopus 로고
    • A hierarchical phrase-based model for statistical machine translation
    • Ann Arbor, Michigan, USA, June
    • David Chiang. A hierarchical phrase-based model for statistical machine translation. In Proceedings of the 43rd Annual Meeting of the Association of Computational Linguistics, pages 263-270, Ann Arbor, Michigan, USA, June 2005. DOI: 10.3115/1219840.1219873
    • (2005) Proceedings of the 43rd Annual Meeting of the Association of Computational Linguistics , pp. 263-270
    • Chiang, D.1
  • 57
    • 34347360650 scopus 로고    scopus 로고
    • Hierarchical phrase-based translation
    • David Chiang. Hierarchical phrase-based translation. Computational Linguistics, 33(2):201-228, 2007. DOI: 10.1162/coli.2007.33.2.201
    • (2007) Computational Linguistics , vol.33 , Issue.2 , pp. 201-228
    • Chiang, D.1
  • 59
    • 80053377187 scopus 로고    scopus 로고
    • Learning with compositional semantics as structural inference for subsentential sentiment analysis
    • Honolulu, Hawaii, USA, October
    • Yejin Choi and Claire Cardie. Learning with compositional semantics as structural inference for subsentential sentiment analysis. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 793-801, Honolulu, Hawaii, USA, October 2008. DOI: 10.3115/1613715.1613816
    • (2008) Proceedings of the Conference on Empirical Methods in Natural Language Processing , pp. 793-801
    • Choi, Y.1    Cardie, C.2
  • 62
    • 0000666661 scopus 로고
    • On the shortest arborescence of a directed graph
    • Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14: 1396-1400, 1965.
    • (1965) Science Sinica , vol.14 , pp. 1396-1400
    • Chu, Y.J.1    Liu, T.H.2
  • 63
    • 80053364056 scopus 로고    scopus 로고
    • Broad-coverage sense disambiguation and information extraction with a supersense sequence tagger
    • Sydney, Australia
    • Massimiliano Ciaramita and Yasemin Altun. Broad-coverage sense disambiguation and information extraction with a supersense sequence tagger. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 594-602, Sydney, Australia, 2006. DOI: 10.3115/1610075.1610158
    • (2006) Proceedings of the Conference on Empirical Methods in Natural Language Processing , pp. 594-602
    • Ciaramita, M.1    Altun, Y.2
  • 71
    • 79551491348 scopus 로고    scopus 로고
    • Logistic normal priors for unsupervised probabilistic grammar induction
    • Daphne Koller, Dale Schuurmans, Yoshua Bengio, and Léon Bottou, editors, MIT Press
    • Shay B. Cohen, Kevin Gimpel, and Noah A. Smith. Logistic normal priors for unsupervised probabilistic grammar induction. In Daphne Koller, Dale Schuurmans, Yoshua Bengio, and Léon Bottou, editors, Advances in Neural Information Processing Systems 21, pages 321-328. MIT Press, 2009.
    • (2009) Advances in Neural Information Processing Systems , vol.21 , pp. 321-328
    • Cohen, S.B.1    Gimpel, K.2    Smith, N.A.3
  • 75
    • 0040044720 scopus 로고    scopus 로고
    • Discriminative reranking for natural language parsing
    • Stanford, California, USA, June-July
    • Michael Collins. Discriminative reranking for natural language parsing. In Proceedings of the 17th International Conference on Machine Learning, pages 175-182, Stanford, California, USA, June-July 2000. DOI: 10.1162/0891201053630273
    • (2000) Proceedings of the 17th International Conference on Machine Learning , pp. 175-182
    • Collins, M.1
  • 76
    • 85127836544 scopus 로고    scopus 로고
    • Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms
    • Philadelphia, Pennsylvania, USA, July
    • Michael Collins. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 1-8, Philadelphia, Pennsylvania, USA, July 2002. DOI: 10.3115/1118693.1118694
    • (2002) Proceedings of the Conference on Empirical Methods in Natural Language Processing , pp. 1-8
    • Collins, M.1
  • 77
    • 4043082208 scopus 로고    scopus 로고
    • Head-driven statistical models for natural language parsing
    • Michael Collins. Head-driven statistical models for natural language parsing. Computational Linguistics, 29(4):589-637, 2003. DOI: 10.1162/089120103322753356
    • (2003) Computational Linguistics , vol.29 , Issue.4 , pp. 589-637
    • Collins, M.1
  • 78
    • 85048736952 scopus 로고    scopus 로고
    • Michael Collins. The EMalgorithm, 1997. URL http://people.csail.mit.edu/mcollins/papers/wpeII.4.ps. DOI: 10.1007/978-3-642-05258-3-48
    • (1997) The EMalgorithm
    • Collins, M.1
  • 80
    • 33646057547 scopus 로고    scopus 로고
    • New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron
    • Philadelphia, Pennsylvania, USA, July
    • Michael Collins and Nigel Duffy. New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In Proceedings of 40th Annual Meeting of the Association for Computational Linguistics, pages 263-270, Philadelphia, Pennsylvania, USA, July 2002. DOI: 10.3115/1073083.1073128
    • (2002) Proceedings of 40th Annual Meeting of the Association for Computational Linguistics , pp. 263-270
    • Collins, M.1    Duffy, N.2
  • 82
    • 34249753618 scopus 로고
    • Support-vector networks
    • Corinna Cortes and Vladimir Vapnik. Support-vector networks. Machine Learning, 20:273-297, 1995. DOI: 10.1023/A:1022627411411
    • (1995) Machine Learning , vol.20 , pp. 273-297
    • Cortes, C.1    Vapnik, V.2
  • 83
    • 0010442827 scopus 로고    scopus 로고
    • On the algorithmic implementation of multiclass kernel-based vector machines
    • Koby Crammer and Yoram Singer. On the algorithmic implementation of multiclass kernel-based vector machines. Journal of Machine Learning Research, 2(5):265-292, 2001.
    • (2001) Journal of Machine Learning Research , vol.2 , Issue.5 , pp. 265-292
    • Crammer, K.1    Singer, Y.2
  • 84
    • 0141496132 scopus 로고    scopus 로고
    • Ultraconservative online algorithms for multiclass problems
    • Koby Crammer and Yoram Singer. Ultraconservative online algorithms for multiclass problems. Journal of Machine Learning Research, 3:951-991, 2003. DOI: 10.1162/jmlr.2003.3.4-5.951
    • (2003) Journal of Machine Learning Research , vol.3 , pp. 951-991
    • Crammer, K.1    Singer, Y.2
  • 89
    • 0001573124 scopus 로고
    • Generalized iterative scaling for log-linear models
    • J. N. Darroch and D. Ratcliff. Generalized iterative scaling for log-linear models. Annals of Mathematical Statistics, 43(5):1470-1480, 1972. DOI: 10.1214/aoms/1177692379
    • (1972) Annals of Mathematical Statistics , vol.43 , Issue.5 , pp. 1470-1480
    • Darroch, J.N.1    Ratcliff, D.2
  • 92
    • 25444485701 scopus 로고    scopus 로고
    • A Bayesian model for supervised clustering with the dirichlet process prior
    • September
    • Hal Daumé and Daniel Marcu. A Bayesian model for supervised clustering with the Dirichlet process prior. Journal of Machine Learning Research, 6:1551-1577, September 2005.
    • (2005) Journal of Machine Learning Research , vol.6 , pp. 1551-1577
    • Daumé, H.1    Marcu, D.2
  • 93
    • 67349244372 scopus 로고    scopus 로고
    • Search-based structured prediction
    • Hal Daumé, John Langford, and Daniel Marcu. Search-based structured prediction. Machine Learning, 75(3):297-325, 2009. DOI: 10.1007/s10994-009-5106-x
    • (2009) Machine Learning , vol.75 , Issue.3 , pp. 297-325
    • Daumé, H.1    Langford, J.2    Marcu, D.3
  • 95
    • 0000029611 scopus 로고
    • Computationally difficult parsimony problems in phylogenetic systematics
    • William H. E. Day. Computationally difficult parsimony problems in phylogenetic systematics. Journal of Theoretical Biology, 103(3):429-438,1983. DOI: 10.1016/0022-5193(83)90296-5
    • (1983) Journal of Theoretical Biology , vol.103 , Issue.3 , pp. 429-438
    • Day, W.H.E.1
  • 97
    • 37549003336 scopus 로고    scopus 로고
    • Map reduce: Simplified data processing on large clusters
    • Jeffrey Dean and Sanjay Ghemawat. Map Reduce: Simplified data processing on large clusters. Communications of the ACM, 51(1):107-114, 2008. DOI: 10.1145/1327452.1327492
    • (2008) Communications of the ACM , vol.51 , Issue.1 , pp. 107-114
    • Dean, J.1    Ghemawat, S.2
  • 104
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1: 269-271, 1959. DOI: 10.1007/BF01386390
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 110
    • 0014732304 scopus 로고
    • An efficient context-free parsing algorithm
    • Jay Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102, 1970. DOI: 10.1145/362007.362035
    • (1970) Communications of the ACM , vol.13 , Issue.2 , pp. 94-102
    • Earley, J.1
  • 112
    • 0015330635 scopus 로고
    • Theoretical improvements in algorithmic efficiency for network flow problems
    • Jack Edmonds and Richard M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2):248-264, 1972. DOI: 10.1145/321694.321699
    • (1972) Journal of the ACM , vol.19 , Issue.2 , pp. 248-264
    • Edmonds, J.1    Karp, R.M.2
  • 113
    • 0002344794 scopus 로고
    • Bootstrap methods: Another look at the jackknife
    • Bradley Efron. Bootstrap methods: another look at the jackknife. Annals of Statistics, 7:1-26, 1979. DOI: 10.1214/aos/1176344552
    • (1979) Annals of Statistics , vol.7 , pp. 1-26
    • Efron, B.1
  • 122
    • 50849110813 scopus 로고    scopus 로고
    • Dependency parsing of Turkish
    • Gülşen Eryiǧit, Joakim Nivre, and Kemal Oflazer. Dependency parsing of Turkish. Computational Linguistics, 34(3):357-389, 2008. DOI: 10.1162/coli.2008.07-017-R1-06-83
    • (2008) Computational Linguistics , vol.34 , Issue.3 , pp. 357-389
    • Eryiǧit, G.1    Nivre, J.2    Oflazer, K.3
  • 124
    • 0001120413 scopus 로고
    • A Bayesian analysis of some nonparametric problems
    • Thomas S. Ferguson. A Bayesian analysis of some nonparametric problems. Annals of Statistics, 1 (2):209-230, 1973. DOI: 10.1214/aos/1176342360
    • (1973) Annals of Statistics , vol.1 , Issue.2 , pp. 209-230
    • Ferguson, T.S.1
  • 127
    • 80053379378 scopus 로고    scopus 로고
    • Solving the problem of cascading errors: Approximate Bayesian inference for linguistic annotation pipelines
    • Sydney, Australia
    • Jenny Rose Finkel, Christopher D. Manning, and Andrew Ng. Solving the problem of cascading errors: Approximate Bayesian inference for linguistic annotation pipelines. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 618-626, Sydney, Australia, 2006. DOI: 10.3115/1610075.1610162
    • (2006) Proceedings of the Conference on Empirical Methods in Natural Language Processing , pp. 618-626
    • Finkel, J.R.1    Manning, C.D.2    Ng, A.3
  • 130
    • 56449113929 scopus 로고    scopus 로고
    • Training structural SVM swhen exact inference is intractable
    • Helsinki, Finland, July
    • Thomas Finley and Thorsten Joachims. Training structural SVM swhen exact inference is intractable. In Proceedings of the 25th International Conference on Machine Learning, pages 304-311, Helsinki, Finland, July 2008. DOI: 10.1145/1390156.1390195
    • (2008) Proceedings of the 25th International Conference on Machine Learning , pp. 304-311
    • Finley, T.1    Joachims, T.2
  • 134
    • 85050785549 scopus 로고
    • A program for aligning sentences in bilingual corpora
    • William A. Gale and Kenneth W. Church. A program for aligning sentences in bilingual corpora. Computational Linguistics, 19(1):75-102, 1993. DOI: 10.3115/981344.981367
    • (1993) Computational Linguistics , vol.19 , Issue.1 , pp. 75-102
    • Gale, W.A.1    Church, K.W.2
  • 135
    • 84859016776 scopus 로고    scopus 로고
    • Astatistical semantic parser that integrates syntax and semantics
    • Ann Arbor, Michigan, USA, June
    • Ruifang Geand Raymond Mooney. Astatistical semantic parser that integrates syntax and semantics. In Proceedings of the 9th Conference on Computational Natural Language Learning, pages 9-16, Ann Arbor, Michigan, USA, June 2005. DOI: 10.3115/1706543.1706546
    • (2005) Proceedings of the 9th Conference on Computational Natural Language Learning , pp. 9-16
    • Mooney, R.G.R.1
  • 137
    • 0040076126 scopus 로고    scopus 로고
    • Automatic labeling of semantic roles
    • Daniel Gildea and Daniel Jurafsky. Automatic labeling of semantic roles. Computational Linguistics, 24(3):245-288, 2002. DOI: 10.1162/089120102760275983
    • (2002) Computational Linguistics , vol.24 , Issue.3 , pp. 245-288
    • Gildea, D.1    Jurafsky, D.2
  • 142
    • 0001492251 scopus 로고    scopus 로고
    • Minimum bayes risk automatic speech recognition
    • Vaibhava Goel and William J. Byrne. Minimum Bayes risk automatic speech recognition. Computer Speech and Language, 14(2):115-135, 2000. DOI: 10.1006/csla.2000.0138
    • (2000) Computer Speech and Language , vol.14 , Issue.2 , pp. 115-135
    • Goel, V.1    Byrne, W.J.2
  • 143
    • 49949150022 scopus 로고
    • Language identification in the limit
    • E. Mark Gold. Language identification in the limit. Information and Control, 10(5):447-474, 1967. DOI: 10.1016/S0019-9958(67)91165-5
    • (1967) Information and Control , vol.10 , Issue.5 , pp. 447-474
    • Mark Gold, E.1
  • 145
    • 33750692845 scopus 로고    scopus 로고
    • Interpolating between types and tokens by estimating power-law generators
    • Yair Weiss, Bernhard Schölkopf, and John Platt, editors. MIT Press
    • Sharon Goldwater, Thomas L. Griffiths, and Mark Johnson. Interpolating between types and tokens by estimating power-law generators. In Yair Weiss, Bernhard Schölkopf, and John Platt, editors, Advances in Neural Information Processing Systems 18.MIT Press, 2006a.
    • (2006) Advances in Neural Information Processing Systems , vol.18
    • Goldwater, S.1    Griffiths, T.L.2    Johnson, M.3
  • 151
    • 0010000856 scopus 로고    scopus 로고
    • PhD thesis, Harvard University
    • Joshua Goodman. Parsing Inside-Out. PhD thesis, Harvard University, 1998.
    • (1998) Parsing Inside-Out
    • Goodman, J.1
  • 152
    • 0039029320 scopus 로고    scopus 로고
    • Semiring parsing
    • Joshua Goodman. Semiring parsing. Computational Linguistics, 25(3):573-605, 1999.
    • (1999) Computational Linguistics , vol.25 , Issue.3 , pp. 573-605
    • Goodman, J.1
  • 154
    • 0345399126 scopus 로고
    • The probable error of a mean
    • Published under pseudonym Student
    • William Sealy Gosset. The probable error of a mean. Biometrika, 6(1):1-25, 1908. Published under pseudonym Student. DOI: 10.1093/biomet/6.1.1
    • (1908) Biometrika , vol.6 , Issue.1 , pp. 1-25
    • Gosset, W.S.1
  • 155
    • 85162012703 scopus 로고    scopus 로고
    • Expectation maximization and posterior constraints
    • John C. Platt, Daphne Koller, Yoram Singer, and Sam Roweis, editors. MIT Press
    • João Graça, Kuzman Ganchev, and Ben Taskar. Expectation maximization and posterior constraints. In John C. Platt, Daphne Koller, Yoram Singer, and Sam Roweis, editors, Advances in Neural Information Processing Systems 20.MIT Press, 2008.
    • (2008) Advances in Neural Information Processing Systems , vol.20
    • Graça, J.1    Ganchev, K.2    Taskar, B.3
  • 156
    • 33745561205 scopus 로고    scopus 로고
    • An introduction to variable and feature selection
    • Isabelle Guyon and André Elisseeff. An introduction to variable and feature selection. Journal of Machine Learning Research, 3:1157-1182, 2003. DOI: 10.1162/153244303322753616
    • (2003) Journal of Machine Learning Research , vol.3 , pp. 1157-1182
    • Guyon, I.1    Elisseeff, A.2
  • 161
    • 84899829959 scopus 로고
    • A formal basis for the heuristic determination of minimum cost paths
    • Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEETransactions on Systems Science and Cybernetics, 4(2):100-107, 1968. DOI: 10.1109/TSSC.1968.300136
    • (1968) IEEETransactions on Systems Science and Cybernetics , vol.4 , Issue.2 , pp. 100-107
    • Hart, P.E.1    Nilsson, N.J.2    Raphael, B.3
  • 162
    • 77956890234 scopus 로고
    • Monte carlo sampling methods using markov chains and their applications
    • W. Keith Hastings. Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57(1):97-109, 1970. DOI: 10.1093/biomet/57.1.97
    • (1970) Biometrika , vol.57 , Issue.1 , pp. 97-109
    • Keith Hastings, W.1
  • 165
    • 50249144225 scopus 로고    scopus 로고
    • Technical report, University of Leipzig
    • Gregor Heinrich. Parameter estimation for text analysis. Technical report, University of Leipzig, 2008. URL http://www.arbylon.net/publications/text-est.pdf.
    • (2008) Parameter Estimation for Text Analysis
    • Heinrich, G.1
  • 167
    • 0013344078 scopus 로고    scopus 로고
    • Training products of experts by minimizing contrastive divergence
    • Geoffrey E. Hinton. Training products of experts by minimizing contrastive divergence. Neural Computation, 14(8):1771-1800, 2002. DOI: 10.1162/089976602760128018
    • (2002) Neural Computation , vol.14 , Issue.8 , pp. 1771-1800
    • Hinton, G.E.1
  • 173
    • 25844515200 scopus 로고    scopus 로고
    • Bootstrapping parsers via syntactic projection across parallel texts
    • Rebecca Hwa, Philip Resnik, Amy Weinberg, Clara Cabezas, and Okan Kolak. Bootstrapping parsers via syntactic projection across parallel texts. Journal of Natural Language Engineering, 11 (3):311-325, 2005. DOI: 10.1017/S1351324905003840
    • (2005) Journal of Natural Language Engineering , vol.11 , Issue.3 , pp. 311-325
    • Hwa, R.1    Resnik, P.2    Weinberg, A.3    Cabezas, C.4    Kolak, O.5
  • 174
    • 0014602879 scopus 로고
    • A fast sequential decoding algorithm using a stack
    • Frederick Jelinek. A fast sequential decoding algorithm using a stack. IBM Journal of Research and Development, 13:675-685, 1969. DOI: 10.1147/rd.136.0675
    • (1969) IBM Journal of Research and Development , vol.13 , pp. 675-685
    • Jelinek, F.1
  • 176
    • 33746124673 scopus 로고    scopus 로고
    • Aneffective method for high-dimensional log-density ANOVAestimation, with application to nonparametric graphical model building
    • Yongho Jeon and Yi Lin. Aneffective method for high-dimensional log-density ANOVAestimation, with application to nonparametric graphical model building. Statistica Sinica, 16(2):353-374, 2006.
    • (2006) Statistica Sinica , vol.16 , Issue.2 , pp. 353-374
    • Jeon, Y.1    Lin, Y.2
  • 177
    • 78650708119 scopus 로고    scopus 로고
    • LTH: Semantic structure extraction using nonprojective dependency trees
    • Prague, Czech Republic, June
    • Richard Johansson and Pierre Nugues. LTH: Semantic structure extraction using nonprojective dependency trees. In Proceedings of the Fourth International Workshop on Semantic Evaluations, pages 227-230, Prague, Czech Republic, June 2007. DOI: 10.3115/1621474.1621522
    • (2007) Proceedings of the Fourth International Workshop on Semantic Evaluations , pp. 227-230
    • Johansson, R.1    Nugues, P.2
  • 180
    • 0005921873 scopus 로고    scopus 로고
    • PCFG models of linguistic tree representations
    • Mark Johnson. PCFG models of linguistic tree representations. Computational Linguistics, 24(4): 613-32, 1998.
    • (1998) Computational Linguistics , vol.24 , Issue.4 , pp. 613-632
    • Johnson, M.1
  • 181
    • 67349214856 scopus 로고    scopus 로고
    • Adaptor grammars: A framework for specifying compositional nonparametric Bayesian models
    • John Platt Bernhard Schölkopf and Thomas Hofmann, editors. MIT Press
    • Mark Johnson, Thomas L. Griffiths, and Sharon Goldwater. Adaptor grammars: A framework for specifying compositional nonparametric Bayesian models. In John Platt Bernhard Schölkopf and Thomas Hofmann, editors, Advances in Neural Information Processing Systems 19.MIT Press, 2007a.
    • (2007) Advances in Neural Information Processing Systems , vol.19
    • Johnson, M.1    Griffiths, T.L.2    Goldwater, S.3
  • 184
    • 51249181779 scopus 로고
    • A new polynomial time algorithm for linear programming
    • Narendra Karmarkar. A new polynomial time algorithm for linear programming. Combinatorica, 4 (4):373-395, 1984. DOI: 10.1007/BF02579150
    • (1984) Combinatorica , vol.4 , Issue.4 , pp. 373-395
    • Karmarkar, N.1
  • 185
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • Raymond E. Miller and James W. Thatcher, editors, Plenum Press
    • Richard M. Karp. Reducibility among combinatorial problems. In Raymond E. Miller and James W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 188
  • 190
  • 191
    • 85061893834 scopus 로고    scopus 로고
    • A generative constituent-context model for improved grammar induction
    • Philadelphia, Pennsylvania, USA, July
    • Dan Klein and Christopher D. Manning. A generative constituent-context model for improved grammar induction. In Proceedings of 40th Annual Meeting of the Association for Computational Linguistics, pages 128-135, Philadelphia, Pennsylvania, USA, July 2002b. DOI: 10.3115/1073083.1073106
    • (2002) Proceedings of 40th Annual Meeting of the Association for Computational Linguistics , pp. 128-135
    • Klein, D.1    Manning, C.D.2
  • 193
    • 0001143875 scopus 로고    scopus 로고
    • Machine transliteration
    • Kevin Knight and Jonathan Graehl. Machine transliteration. Computational Linguistics, 24(4): 599-612, 1998.
    • (1998) Computational Linguistics , vol.24 , Issue.4 , pp. 599-612
    • Knight, K.1    Graehl, J.2
  • 194
    • 0036641584 scopus 로고    scopus 로고
    • Summarization beyond sentence extraction: A probabilistic approach to sentence compression
    • Kevin Knight and Daniel Marcu. Summarization beyond sentence extraction: A probabilistic approach to sentence compression. Artificial Intelligence, 139(1):91-107, 2002. DOI: 10.1016/S0004-3702(02)00222-9
    • (2002) Artificial Intelligence , vol.139 , Issue.1 , pp. 91-107
    • Knight, K.1    Marcu, D.2
  • 195
    • 0002210838 scopus 로고
    • A generalization of Dijkstra's algorithm
    • Donald E. Knuth. A generalization of Dijkstra's algorithm. Information Processing Letters, 6(1):1-5, 1977. DOI: 10.1016/0020-0190(77)90002-3
    • (1977) Information Processing Letters , vol.6 , Issue.1 , pp. 1-5
    • Knuth, D.E.1
  • 204
    • 0023844381 scopus 로고
    • The early years of logic programming
    • January
    • Robert A. Kowalski. The early years of logic programming. Communications of the ACM, 31(1): 38-43, January 1988. DOI: 10.1145/35043.35046
    • (1988) Communications of the ACM , vol.31 , Issue.1 , pp. 38-43
    • Kowalski, R.A.1
  • 206
    • 0002719797 scopus 로고
    • The hungarian method for the assignment problem
    • Harold W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistic Quarterly, 2:83-97, 1955. DOI: 10.1002/nav.3800020109
    • (1955) Naval Research Logistic Quarterly , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 209
    • 0142192295 scopus 로고    scopus 로고
    • Conditional random fields: Probabilistic models for segmenting and labeling sequence data
    • Williamstown, Massachusetts, USA, June-July
    • John D. Lafferty, Andrew McCallum, and Fernando C. N. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of the 18th International Conference on Machine Learning, pages 282-289, Williamstown, Massachusetts, USA, June-July 2001.
    • (2001) Proceedings of the 18th International Conference on Machine Learning , pp. 282-289
    • Lafferty, J.D.1    McCallum, A.2    Pereira, F.C.N.3
  • 210
    • 0032203257 scopus 로고    scopus 로고
    • Gradient-based learning applied to document recognition
    • Yan LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278-2324,1998. DOI: 10.1109/5.726791
    • (1998) Proceedings of the IEEE , vol.86 , Issue.11 , pp. 2278-2324
    • LeCun, Y.1    Bottou, L.2    Bengio, Y.3    Haffner, P.4
  • 211
    • 0002619432 scopus 로고
    • Binary codes capable of correcting spurious insertions and deletions of ones
    • V. I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1:8-17, 1965.
    • (1965) Problems of Information Transmission , vol.1 , pp. 8-17
    • Levenshtein, V.I.1
  • 212
    • 56449098139 scopus 로고    scopus 로고
    • An asymptotic analysis of generative, discriminative, and pseudolikelihood estimators
    • Helsinki, Finland, July
    • Percy Liang and Michael I. Jordan. An asymptotic analysis of generative, discriminative, and pseudolikelihood estimators. In Proceedings of the 25th International Conference on Machine Learning, pages 584-591, Helsinki, Finland, July 2008. DOI: 10.1145/1390156.1390230
    • (2008) Proceedings of the 25th International Conference on Machine Learning , pp. 584-591
    • Liang, P.1    Jordan, M.I.2
  • 219
    • 33646887390 scopus 로고
    • On the limited memory method for large scale optimization
    • Dong C. Liu and Jorge Nocedal. On the limited memory method for large scale optimization. Mathematical Programming B, 45(3):503-528, 1989. DOI: 10.1007/BF01589116
    • (1989) Mathematical Programming B , vol.45 , Issue.3 , pp. 503-528
    • Liu, D.C.1    Nocedal, J.2
  • 222
    • 1042264823 scopus 로고    scopus 로고
    • A comparison of algorithms for maximum entropy parameter estimation
    • Taipei, Taiwan, August-September
    • Robert Malouf. A comparison of algorithms for maximum entropy parameter estimation. In Proceedings of the 6th Workshop on Computational Natural Language Learning, Taipei, Taiwan, August-September 2002. DOI: 10.3115/1118853.1118871
    • (2002) Proceedings of the 6th Workshop on Computational Natural Language Learning
    • Malouf, R.1
  • 225
    • 72449180819 scopus 로고    scopus 로고
    • Generalized isotonic conditional random fields
    • Yi Mao and Guy Lebanon. Generalized isotonic conditional random fields. Machine Learning, 77: 225-248, 2009. DOI: 10.1007/s10994-009-5139-1
    • (2009) Machine Learning , vol.77 , pp. 225-248
    • Mao, Y.1    Lebanon, G.2
  • 226
    • 34249852033 scopus 로고
    • Building a large annotated corpus of english: The penn treebank
    • Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. Building a large annotated corpus of English: the Penn treebank. Computational Linguistics, 19(2):313-330, 1993.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.P.1    Santorini, B.2    Marcinkiewicz, M.A.3
  • 230
    • 0041999512 scopus 로고    scopus 로고
    • On the complexity analysis of static analyses
    • David McAllester. On the complexity analysis of static analyses. Journal of the ACM, 49(4):512-537, 2002. DOI: 10.1145/581771.581774
    • (2002) Journal of the ACM , vol.49 , Issue.4 , pp. 512-537
    • McAllester, D.1
  • 236
    • 85119623914 scopus 로고    scopus 로고
    • On the complexity of non-projective data-driven dependency parsing
    • Prague, Czech Republic, June
    • Ryan McDonald and Giorgio Satta. On the complexity of non-projective data-driven dependency parsing. In Proceedings of the Tenth International Conference on Parsing Technologies, pages 121-132, Prague, Czech Republic, June 2007. DOI: 10.3115/1621410.1621426
    • (2007) Proceedings of the Tenth International Conference on Parsing Technologies , pp. 121-132
    • McDonald, R.1    Satta, G.2
  • 240
    • 0000596361 scopus 로고
    • Note on the sampling error of the difference between correlated proportions or percentages
    • Quinn McNemar. Note on the sampling error of the difference between correlated proportions or percentages. Psychometrika, 12(2):153-157, 1947. DOI: 10.1007/BF02295996
    • (1947) Psychometrika , vol.12 , Issue.2 , pp. 153-157
    • McNemar, Q.1
  • 241
    • 0040440624 scopus 로고    scopus 로고
    • Models of translational equivalence among words
    • I. Dan Melamed. Models of translational equivalence among words. Computational Linguistics, 26 (2):221-249, 2000. DOI: 10.1162/089120100561683
    • (2000) Computational Linguistics , vol.26 , Issue.2 , pp. 221-249
    • Dan Melamed, I.1
  • 242
    • 84867119745 scopus 로고
    • Tagging english text with a probabilistic model
    • Bernardo Merialdo. Tagging English text with a probabilistic model. Computational Linguistics, 20(2):155-72, 1994.
    • (1994) Computational Linguistics , vol.20 , Issue.2 , pp. 155-172
    • Merialdo, B.1
  • 244
    • 0141425904 scopus 로고    scopus 로고
    • Semiring frameworks and algorithms for shortest-distance problems
    • Mehryar Mohri. Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics, 7(3):321-350, 2002.
    • (2002) Journal of Automata, Languages and Combinatorics , vol.7 , Issue.3 , pp. 321-350
    • Mohri, M.1
  • 245
    • 0348198473 scopus 로고    scopus 로고
    • Finite-state transducers in language and speech processing
    • Mehryar Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2):269-311, 1997.
    • (1997) Computational Linguistics , vol.23 , Issue.2 , pp. 269-311
    • Mohri, M.1
  • 246
    • 0041160562 scopus 로고
    • The proper treatment of quantification in ordinary english
    • Jaakko Hintikka, Julius Moravcsik, and Patrick Suppes, editors, Dordrecht
    • Richard Montague. The proper treatment of quantification in ordinary English. In Jaakko Hintikka, Julius Moravcsik, and Patrick Suppes, editors, Approaches to Natural Language, pages 221-242. Dordrecht, 1973.
    • (1973) Approaches to Natural Language , pp. 221-242
    • Montague, R.1
  • 248
    • 0002788893 scopus 로고    scopus 로고
    • A view of the em algorithm that justifies incremental, sparse, and other variants
    • Michael I. Jordan, editor. MIT Press
    • Radford M. Neal and Geoffrey E. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants. In Michael I. Jordan, editor, Learning in Graphical Models.MIT Press, 1998.
    • (1998) Learning in Graphical Models
    • Neal, R.M.1    Hinton, G.E.2
  • 249
    • 0042879603 scopus 로고    scopus 로고
    • Weighted deductive parsing and Knuth's algorithm
    • Mark-Jan Nederhof. Weighted deductive parsing and Knuth's algorithm. Computational Linguistics, 29(1):135-143, 2003. DOI: 10.1162/089120103321337467
    • (2003) Computational Linguistics , vol.29 , Issue.1 , pp. 135-143
    • Nederhof, M.-J.1
  • 250
    • 59549087165 scopus 로고    scopus 로고
    • On discriminative vs. Generative classifiers: A comparison of logistic regression and naïve bayes
    • Thomas G. Dietterich, Suzanna Becker, and Zoubin Ghahramani, editors, MIT Press
    • Andrew Y. Ng and Michael I. Jordan. On discriminative vs. generative classifiers: A comparison of logistic regression and naïve Bayes. In Thomas G. Dietterich, Suzanna Becker, and Zoubin Ghahramani, editors, Advances in Neural Information Processing Systems 14, pages 841-848. MIT Press, 2002.
    • (2002) Advances in Neural Information Processing Systems , vol.14 , pp. 841-848
    • Ng, A.Y.1    Jordan, M.I.2
  • 251
    • 11144345567 scopus 로고    scopus 로고
    • Identifying anaphoric and non-anaphoric noun phrases to improve coreference resolution
    • Taipei, Taiwan, August-September
    • Vincent Ng and Claire Cardie. Identifying anaphoric and non-anaphoric noun phrases to improve coreference resolution. In Proceedings of the 19th International Conference on Computational Linguistics, Taipei, Taiwan, August-September 2002. DOI: 10.3115/1072228.1072367
    • (2002) Proceedings of the 19th International Conference on Computational Linguistics
    • Ng, V.1    Cardie, C.2
  • 255
    • 33645983416 scopus 로고    scopus 로고
    • The proposition bank: An annotated corpus of semantic roles
    • Martha Palmer, Daniel Gildea, and Paul Kingsbury. The Proposition Bank: An annotated corpus of semantic roles. Computational Linguistics, 31(1):71-105, 2005. DOI: 10.1162/0891201053630264
    • (2005) Computational Linguistics , vol.31 , Issue.1 , pp. 71-105
    • Palmer, M.1    Gildea, D.2    Kingsbury, P.3
  • 256
    • 85141280473 scopus 로고    scopus 로고
    • Asentimental education: Sentiment analysis using subjectivity summarization based on minimum cuts
    • Barcelona, Spain, July
    • Bo Pang and Lillian Lee. Asentimental education: Sentiment analysis using subjectivity summarization based on minimum cuts. In Proceedings of the 42nd Meeting of the Association for Computational Linguistics, pages 271-278, Barcelona, Spain, July 2004. DOI: 10.3115/1218955.1218990
    • (2004) Proceedings of the 42nd Meeting of the Association for Computational Linguistics , pp. 271-278
    • Pang, B.1    Lee, L.2
  • 260
    • 0000325341 scopus 로고
    • On lines and planes of closest fit to systems of points in space
    • Karl Pearson. On lines and planes of closest fit to systems of points in space. Philosophical Magazine, 2(6):559-572, 1901.
    • (1901) Philosophical Magazine , vol.2 , Issue.6 , pp. 559-572
    • Pearson, K.1
  • 261
    • 50849104254 scopus 로고    scopus 로고
    • Empiricism is not a matter of faith
    • Ted Pedersen. Empiricism is not a matter of faith. Computational Linguistics, 34(3):465-470, 2008. DOI: 10.1162/coli.2008.34.3.465
    • (2008) Computational Linguistics , vol.34 , Issue.3 , pp. 465-470
    • Pedersen, T.1
  • 268
    • 84948481845 scopus 로고
    • An algorithm for suffix stripping
    • Martin F. Porter. An algorithm for suffix stripping. Program, 14(3):130-137, 1980. DOI: 10.1108/eb046814
    • (1980) Program , vol.14 , Issue.3 , pp. 130-137
    • Porter, M.F.1
  • 270
    • 84859885827 scopus 로고    scopus 로고
    • Head-driven PCFGs with latent-head statistics
    • Vancouver, British Columbia, Canada, October
    • Detlef Prescher. Head-driven PCFGs with latent-head statistics. In Proceedings of the Ninth International Workshop on Parsing Technology, pages 115-124, Vancouver, British Columbia, Canada, October 2005. DOI: 10.3115/1654494.1654506
    • (2005) Proceedings of the Ninth International Workshop on Parsing Technology , pp. 115-124
    • Prescher, D.1
  • 277
    • 79951730311 scopus 로고    scopus 로고
    • Technical Report CS-TR-4956, University of Maryland Computer Science Department
    • Philip Resnik and Eric Hardisty. Gibbs sampling for the uninitiated. Technical Report CS-TR-4956, University of Maryland Computer Science Department, 2010. URLhttp://hdl.handle.net/1903/10058.
    • (2010) Gibbs Sampling for the Uninitiated
    • Resnik, P.1    Hardisty, E.2
  • 282
    • 0018015137 scopus 로고
    • Modeling by shortest data description
    • Jorma Rissanen. Modeling by shortest data description. Automatica, 14(5):465-471, 1978. DOI: 10.1016/0005-1098(78)90005-5
    • (1978) Automatica , vol.14 , Issue.5 , pp. 465-471
    • Rissanen, J.1
  • 285
    • 0000389568 scopus 로고
    • Statistical mechanics and phase transitions in clustering
    • Kenneth Rose, Eitan Gurewitz, and Geoffrey C. Fox. Statistical mechanics and phase transitions in clustering. Physical Review Letters, 65(8):945-948, 1990. DOI: 10.1103/PhysRevLett.65.945
    • (1990) Physical Review Letters , vol.65 , Issue.8 , pp. 945-948
    • Rose, K.1    Gurewitz, E.2    Fox, G.C.3
  • 288
    • 0035059194 scopus 로고    scopus 로고
    • Whole-sentence exponential language models: A vehicle for linguistic-statistical integration
    • Roni Rosenfeld, Stanley F. Chen, and Xiaojin Zhu. Whole-sentence exponential language models: A vehicle for linguistic-statistical integration. Computer Speech and Language, 15(1):55-73, 2001. DOI: 10.1006/csla.2000.0159
    • (2001) Computer Speech and Language , vol.15 , Issue.1 , pp. 55-73
    • Rosenfeld, R.1    Chen, S.F.2    Zhu, X.3
  • 293
    • 0000120766 scopus 로고
    • Estimating the dimension of a model
    • Gideon E. Schwarz. Estimating the dimension of a model. Annals of Statistics, 6(2):461-464, 1978. DOI: 10.1214/aos/1176344136
    • (1978) Annals of Statistics , vol.6 , Issue.2 , pp. 461-464
    • Schwarz, G.E.1
  • 294
    • 33746087078 scopus 로고    scopus 로고
    • Online learning meets optimization in the dual
    • Gabor Lugosi and Hans Ulrich Simon, editors, in Lecture Notes in Artificial Intelligence, Pittsburgh, Pennsylvania, USA
    • Shai Shalev-Schwartz and Yoram Singer. Online learning meets optimization in the dual. In Gabor Lugosi and Hans Ulrich Simon, editors, Proceedings of the Nineteenth Annual Conference on Learning Theory, number 4005 in Lecture Notes in Artificial Intelligence, pages 423-427, Pittsburgh, Pennsylvania, USA, 2006.
    • (2006) Proceedings of the Nineteenth Annual Conference on Learning Theory , vol.4005 , pp. 423-427
    • Shalev-Schwartz, S.1    Singer, Y.2
  • 295
    • 0002012766 scopus 로고
    • Principles and implementation of deductive parsing
    • Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1-2):3-36, 1995. DOI: 10.1016/0743-1066(95)00035-I
    • (1995) Journal of Logic Programming , vol.24 , Issue.1-2 , pp. 3-36
    • Shieber, S.M.1    Schabes, Y.2    Pereira, F.C.N.3
  • 296
    • 0028483915 scopus 로고
    • Finding MAPs for belief networds is NP-hard
    • Solomon Eyal Shimony. Finding MAPs for belief networds is NP-hard. Artificial Intelligence, 68(2):399-410, 1994. DOI: 10.1016/0004-3702(94)90072-8
    • (1994) Artificial Intelligence , vol.68 , Issue.2 , pp. 399-410
    • Shimony, S.E.1
  • 298
    • 0040638004 scopus 로고
    • PhD thesis, University of Twente
    • Klaas Sikkel. Parsing Schemata. PhD thesis, University of Twente, 1993.
    • (1993) Parsing Schemata
    • Sikkel, K.1
  • 299
    • 0036341851 scopus 로고    scopus 로고
    • Computatoinal complexity of probabilistic disambiguation
    • Khalil Sima'an. Computatoinal complexity of probabilistic disambiguation. Grammars, 5(2):125-151, 2002. DOI: 10.1023/A:1016340700671
    • (2002) Grammars , vol.5 , Issue.2 , pp. 125-151
    • Sima'An, K.1
  • 307
    • 37249024089 scopus 로고    scopus 로고
    • Weighted and probabilistic context-free grammars are equally expressive
    • Noah A. Smith and Mark Johnson. Weighted and probabilistic context-free grammars are equally expressive. Computational Linguistics, 33(4):577-491, 2007. DOI: 10.1162/coli.2007.33.4.477
    • (2007) Computational Linguistics , vol.33 , Issue.4 , pp. 491-577
    • Smith, N.A.1    Johnson, M.2
  • 312
    • 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, A.1
  • 315
    • 33947615175 scopus 로고    scopus 로고
    • Dynamic conditional random fields: Factorized probabilistic models for labeling and segmenting sequence data
    • Charles Sutton, Andrew McCallum, and Khashayar Rohanimanesh. Dynamic conditional random fields: Factorized probabilistic models for labeling and segmenting sequence data. Journal of Machine Learning Research, 8:693-723, 2007.
    • (2007) Journal of Machine Learning Research , vol.8 , pp. 693-723
    • Sutton, C.1    McCallum, A.2    Rohanimanesh, K.3
  • 316
    • 0017465744 scopus 로고
    • Finding optimum branchings
    • Robert E. Tarjan. Finding optimum branchings. Networks, 7:25-35, 1977. DOI: 10.1002/net.3230070103
    • (1977) Networks , vol.7 , pp. 25-35
    • Tarjan, R.E.1
  • 318
    • 84898948585 scopus 로고    scopus 로고
    • Max-margin markov networks
    • Sebastian Thrun, Lawrence Saul, and Bernhard Schölkopf, editors. MIT Press
    • Ben Taskar, Carlos Guestrin, and Daphne Koller. Max-margin Markov networks. In Sebastian Thrun, Lawrence Saul, and Bernhard Schölkopf, editors, Advances in Neural Information Processing Systems 16.MIT Press, 2004b.
    • (2004) Advances in Neural Information Processing Systems , vol.16
    • Taskar, B.1    Guestrin, C.2    Koller, D.3
  • 320
    • 14344256958 scopus 로고    scopus 로고
    • Hierarchical dirichlet processes
    • Lawrence K. Saul, Yair Weiss, and Léon Bottou, editors, MIT Press
    • Yee Whye Teh, Michael Jordan, Matthew Beal, and David Blei. Hierarchical Dirichlet processes. In Lawrence K. Saul, Yair Weiss, and Léon Bottou, editors, Advances in Neural Information Processing Systems 17.MIT Press, 2005.
    • (2005) Advances in Neural Information Processing Systems , vol.17
    • Teh, Y.W.1    Jordan, M.2    Beal, M.3    Blei, D.4
  • 323
    • 85136072040 scopus 로고    scopus 로고
    • Thumbs up or thumbs down? Semantic orientation applied to unsupervised classification of reviews
    • Philadelphia, Pennsylvania, USA, July
    • Peter Turney. Thumbs up or thumbs down? semantic orientation applied to unsupervised classification of reviews. In Proceedings of 40th Annual Meeting of the Association for Computational Linguistics, pages 417-424, Philadelphia, Pennsylvania, USA, July 2002. DOI: 10.3115/1073083.1073153
    • (2002) Proceedings of 40th Annual Meeting of the Association for Computational Linguistics , pp. 417-424
    • Turney, P.1
  • 325
    • 0032029288 scopus 로고    scopus 로고
    • Deterministic annealing em algorithm
    • Naonori Ueda and Ryohei Nakano. Deterministic annealing EM algorithm. Neural Networks, 11(2):271-282, 1998. DOI: 10.1016/S0893-6080(97)00133-0
    • (1998) Neural Networks , vol.11 , Issue.2 , pp. 271-282
    • Ueda, N.1    Nakano, R.2
  • 326
    • 49249151236 scopus 로고
    • The complexity of computing the permanent
    • Leslie G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8: 189-201, 1979. DOI: 10.1016/0304-3975(79)90044-6
    • (1979) Theoretical Computer Science , vol.8 , pp. 189-201
    • Valiant, L.G.1
  • 328
    • 84935113569 scopus 로고
    • Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
    • Andrew J. Viterbi. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, 13(2):260-269, 1967. DOI: 10.1109/TIT.1967.1054010
    • (1967) IEEE Transactions on Information Theory , vol.13 , Issue.2 , pp. 260-269
    • Viterbi, A.J.1
  • 331
    • 84925623234 scopus 로고
    • Tests of statistical hypotheses concerning several parameters when the number of observations is large
    • Abraham Wald. Tests of statistical hypotheses concerning several parameters when the number of observations is large. Transactions of the American Mathematical Society, 54:426-482, 1943. DOI: 10.1090/S0002-9947-1943-0012401-3
    • (1943) Transactions of the American Mathematical Society , vol.54 , pp. 426-482
    • Wald, A.1
  • 334
    • 0011898389 scopus 로고
    • Translation
    • William N. Locke and A. Donald Booth, editors, Technology Press of the Massachusetts Institute of Technology, John Wiley and Sons, and Chapman and Hall, 1949. Collection published in
    • Warren Weaver. Translation. In William N. Locke and A. Donald Booth, editors, Machine Translation of Languages: Fourteen Essays, pages 15-23. Technology Press of the Massachusetts Institute of Technology, John Wiley and Sons, and Chapman and Hall, 1949. Collection published in 1955.
    • (1955) Machine Translation of Languages: Fourteen Essays , pp. 15-23
    • Weaver, W.1
  • 337
    • 0001884644 scopus 로고
    • Individual comparisons by ranking methods
    • Frank Wilcoxon. Individual comparisons by ranking methods. Biometrics Bulletin, 1(6):80-83, 1945. DOI: 10.2307/3001968
    • (1945) Biometrics Bulletin , vol.1 , Issue.6 , pp. 80-83
    • Wilcoxon, F.1
  • 339
    • 33646406015 scopus 로고    scopus 로고
    • Representing discourse coherence: A corpus-based study
    • Florian Wolf and Edward Gibson. Representing discourse coherence: A corpus-based study. Computational Linguistics, 31(2):249-287, 2005. DOI: 10.1162/0891201054223977
    • (2005) Computational Linguistics , vol.31 , Issue.2 , pp. 249-287
    • Wolf, F.1    Gibson, E.2
  • 341
    • 0002210265 scopus 로고
    • On the convergence properties of the em algorithm
    • C. F. Jeff Wu. On the convergence properties of the EM algorithm. Annals of Statistics, 11(1): 95-103, 1983. DOI: 10.1214/aos/1176346060
    • (1983) Annals of Statistics , vol.11 , Issue.1 , pp. 95-103
    • Jeff Wu, C.F.1
  • 342
    • 0000319590 scopus 로고    scopus 로고
    • Stochastic inversion transduction grammars and bilingual parsing of parallel corpora
    • Dekai Wu. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics, 23(3):377-404, 1997.
    • (1997) Computational Linguistics , vol.23 , Issue.3 , pp. 377-404
    • Wu, D.1
  • 344
    • 0001918097 scopus 로고
    • Word-sense disambiguation using statistical models of Roget's categories trained on large corpora
    • Nantes, France
    • David Yarowsky. Word-sense disambiguation using statistical models of Roget's categories trained on large corpora. In Proceedings of the 14th International Conference On Computational Linguistics, pages 454-460, Nantes, France, 1992. DOI: 10.3115/992133.992140
    • (1992) Proceedings of the 14th International Conference on Computational Linguistics , pp. 454-460
    • Yarowsky, D.1
  • 345
    • 0344261615 scopus 로고    scopus 로고
    • Inducing multilingual POS taggers and NP bracketers via robust projection across aligned corpora
    • Pittsburgh, Pennsylvania, USA, June
    • David Yarowsky and Grace Ngai. Inducing multilingual POS taggers and NP bracketers via robust projection across aligned corpora. In Second Meeting of the North American Chapter of the Association for Computational Linguistics, pages 200-207, Pittsburgh, Pennsylvania, USA, June 2001. DOI: 10.3115/1073336.1073362
    • (2001) Second Meeting of the North American Chapter of the Association for Computational Linguistics , pp. 200-207
    • Yarowsky, D.1    Ngai, G.2
  • 346
    • 0347606818 scopus 로고    scopus 로고
    • More accurate tests for the statistical significance of result differences
    • Saarbrücken, Germany, July-August
    • Alexander Yeh. More accurate tests for the statistical significance of result differences. In Proceedings of the 18th International Conference on Computational Linguistics, pages 947-953, Saarbrücken, Germany, July-August 2000. DOI: 10.3115/992730.992783
    • (2000) Proceedings of the 18th International Conference on Computational Linguistics , pp. 947-953
    • Yeh, A.1
  • 350
    • 36348934176 scopus 로고    scopus 로고
    • Learning to map sentences to logical form: Structured classification with probabilistic categorial grammars
    • Edinburgh, UK, July
    • Luke S. Zettlemoyer and Michael Collins. Learning to map sentences to logical form: Structured classification with probabilistic categorial grammars. In Proceedings of the 21st Conference in Uncertainty in Artificial Intelligence, pages 658-666, Edinburgh, UK, July 2005.
    • (2005) Proceedings of the 21st Conference in Uncertainty in Artificial Intelligence , pp. 658-666
    • Zettlemoyer, L.S.1    Collins, M.2


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