메뉴 건너뛰기




Volumn 33, Issue 4, 2007, Pages 493-552

Wide-coverage efficient statistical parsing with CCG and log-linear models

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; CONTEXT FREE GRAMMARS; DYNAMIC PROGRAMMING; FORESTRY; REGRESSION ANALYSIS; SYNTACTICS;

EID: 37249086043     PISSN: 08912017     EISSN: 15309312     Source Type: Journal    
DOI: 10.1162/coli.2007.33.4.493     Document Type: Article
Times cited : (384)

References (101)
  • 1
    • 0000431299 scopus 로고    scopus 로고
    • Stochastic attributevalue grammars
    • Abney, Steven. 1997. Stochastic attributevalue grammars. Computational Linguistics, 23(4):597-618.
    • (1997) Computational Linguistics , vol.23 , Issue.4 , pp. 597-618
    • Abney, S.1
  • 4
    • 0003356044 scopus 로고    scopus 로고
    • Supertagging: An approach to almost parsing
    • Bangalore, Srinivas and Aravind Joshi. 1999. Supertagging: An approach to almost parsing. Computational Linguistics, 25(2):237-265.
    • (1999) Computational Linguistics , vol.25 , Issue.2 , pp. 237-265
    • Bangalore, S.1    Joshi, A.2
  • 5
    • 0010898587 scopus 로고
    • A quasi-arithmetical notation for syntactic description
    • Bar-Hillel, Yehoshua. 1953. A quasi-arithmetical notation for syntactic description. Language, 29:47-58.
    • (1953) Language , vol.29 , pp. 47-58
    • Bar-Hillel, Y.1
  • 7
    • 84873538549 scopus 로고    scopus 로고
    • Wide-coverage semantic representations from a CCG parser
    • Geneva, Switzerland
    • Bos, Johan, Stephen Clark, Mark Steedman, James R. Curran, and Julia Hockenmaier. 2004. Wide-coverage semantic representations from a CCG parser. In Proceedings of COLING-04, pages 1240-1246, Geneva, Switzerland.
    • (2004) Proceedings of COLING-04 , pp. 1240-1246
    • Bos, J.1    Clark, S.2    Steedman, M.3    Curran, J.R.4    Hockenmaier, J.5
  • 8
    • 37249077589 scopus 로고    scopus 로고
    • An introduction to tag sequence grammars and the RASP system parser
    • Technical Report UCAM-CL-TR-662, University of Cambridge Computer Laboratory
    • Briscoe, Ted. 2006. An introduction to tag sequence grammars and the RASP system parser. Technical Report UCAM-CL-TR-662, University of Cambridge Computer Laboratory.
    • (2006)
    • Briscoe, T.1
  • 9
    • 84948645636 scopus 로고    scopus 로고
    • Robust accurate statistical annotation of general text
    • Las Palmas, Gran Canaria
    • Briscoe, Ted and John Carroll. 2002. Robust accurate statistical annotation of general text. In Proceedings of the 3rd LREC Conference, pages 1499-1504, Las Palmas, Gran Canaria.
    • (2002) Proceedings of the 3rd LREC Conference , pp. 1499-1504
    • Briscoe, T.1    Carroll, J.2
  • 12
    • 85023023095 scopus 로고    scopus 로고
    • Cascaded grammatical relation assignment
    • University of Maryland, College Park, MD
    • Buchholz, Sabine, Jorn Veenstra, and Walter Daelemans. 1999. Cascaded grammatical relation assignment. In Proceedings of EMNLP/VLC-99, pages 239-246, University of Maryland, College Park, MD.
    • (1999) Proceedings of EMNLP/VLC-99 , pp. 239-246
    • Buchholz, S.1    Veenstra, J.2    Daelemans, W.3
  • 13
    • 37249012482 scopus 로고    scopus 로고
    • Burke, Michael, Aoife Cahill, Ruth O'Donovan, Josef van Genabith, and Andy Way. 2004. Large-scale induction and evaluation of lexical resources from the Penn-II Treebank. In Proceedings of the 42nd Meeting of the ACL, pages 367-374, Barcelona, Spain.
    • Burke, Michael, Aoife Cahill, Ruth O'Donovan, Josef van Genabith, and Andy Way. 2004. Large-scale induction and evaluation of lexical resources from the Penn-II Treebank. In Proceedings of the 42nd Meeting of the ACL, pages 367-374, Barcelona, Spain.
  • 14
    • 37249087504 scopus 로고    scopus 로고
    • Cahill, Aoife, Michael Burke, Ruth O'Donovan, Josef van Genabith, and Andy Way. 2004. Long-distance dependency resolution in automatically acquired wide-coverage PCFG-based LFG approximations. In Proceedings of the 42nd Meeting of the ACL, pages 320-327, Barcelona, Spain.
    • Cahill, Aoife, Michael Burke, Ruth O'Donovan, Josef van Genabith, and Andy Way. 2004. Long-distance dependency resolution in automatically acquired wide-coverage PCFG-based LFG approximations. In Proceedings of the 42nd Meeting of the ACL, pages 320-327, Barcelona, Spain.
  • 19
    • 26444606302 scopus 로고    scopus 로고
    • Automated extraction of TAGS from the Penn Treebank
    • Trento, Italy
    • Chen, John and K. Vijay-Shanker. 2000. Automated extraction of TAGS from the Penn Treebank. In Proceedings of IWPT 2000, Trento, Italy.
    • (2000) Proceedings of IWPT 2000
    • Chen, J.1    Vijay-Shanker, K.2
  • 20
    • 0004014502 scopus 로고    scopus 로고
    • A Gaussian prior for smoothing maximum entropy models
    • Technical Report CMU-CS-99-108, Carnegie Mellon University, Pittsburgh, PA
    • Chen, Stanley and Ronald Rosenfeld. 1999. A Gaussian prior for smoothing maximum entropy models. Technical Report CMU-CS-99-108, Carnegie Mellon University, Pittsburgh, PA.
    • (1999)
    • Chen, S.1    Rosenfeld, R.2
  • 21
    • 84907334477 scopus 로고    scopus 로고
    • Statistical parsing with an automatically-extracted Tree Adjoining Grammar
    • Hong Kong
    • Chiang, David. 2000. Statistical parsing with an automatically-extracted Tree Adjoining Grammar. In Proceedings of the 38th Meeting of the ACL, pages 456-463, Hong Kong.
    • (2000) Proceedings of the 38th Meeting of the ACL , pp. 456-463
    • Chiang, D.1
  • 22
    • 37249039116 scopus 로고    scopus 로고
    • Mildly context sensitive grammars for estimating maximum entropy models
    • Vienna, Austria
    • Chiang, David. 2003. Mildly context sensitive grammars for estimating maximum entropy models. In Proceedings of the 8th Conference on Formal Grammar, Vienna, Austria.
    • (2003) Proceedings of the 8th Conference on Formal Grammar
    • Chiang, D.1
  • 23
    • 33746385477 scopus 로고    scopus 로고
    • A supertagger for Combinatory Categorial Grammar
    • Venice, Italy
    • Clark, Stephen. 2002. A supertagger for Combinatory Categorial Grammar. In Proceedings of the TAG+ Workshop, pages 19-24, Venice, Italy.
    • (2002) Proceedings of the TAG+ Workshop , pp. 19-24
    • Clark, S.1
  • 24
    • 85146439565 scopus 로고    scopus 로고
    • Log-linear models for wide-coverage CCG parsing
    • Sapporo, Japan
    • Clark, Stephen and James R. Curran. 2003. Log-linear models for wide-coverage CCG parsing. In Proceedings of the EMNLP Conference, pages 97-104, Sapporo, Japan.
    • (2003) Proceedings of the EMNLP Conference , pp. 97-104
    • Clark, S.1    Curran, J.R.2
  • 25
    • 85119101586 scopus 로고    scopus 로고
    • The importance of supertagging for wide-coverage CCG parsing
    • Geneva, Switzerland
    • Clark, Stephen and James R. Curran. 2004a. The importance of supertagging for wide-coverage CCG parsing. In Proceedings of COLING-04, pages 282-288, Geneva, Switzerland.
    • (2004) Proceedings of COLING-04 , pp. 282-288
    • Clark, S.1    Curran, J.R.2
  • 26
    • 85149103496 scopus 로고    scopus 로고
    • Parsing the WSJ using CCG and log-linear models
    • Barcelona, Spain
    • Clark, Stephen and James R. Curran. 2004b. Parsing the WSJ using CCG and log-linear models. In Proceedings of the 42nd Meeting of the ACL, pages 104-111, Barcelona, Spain.
    • (2004) Proceedings of the 42nd Meeting of the ACL , pp. 104-111
    • Clark, S.1    Curran, J.R.2
  • 28
    • 84860542791 scopus 로고    scopus 로고
    • Formalism-independent parser evaluation with CCG and DepBank
    • Prague, Czech Republic
    • Clark, Stephen and James R. Curran. 2007. Formalism-independent parser evaluation with CCG and DepBank. In Proceedings of the 45th Meeting of the ACL, Prague, Czech Republic.
    • (2007) Proceedings of the 45th Meeting of the ACL
    • Clark, S.1    Curran, J.R.2
  • 29
    • 85139594775 scopus 로고    scopus 로고
    • Building deep dependency structures with a wide-coverage CCG parser
    • Philadelphia, PA
    • Clark, Stephen, Julia Hockenmaier, and Mark Steedman. 2002. Building deep dependency structures with a wide-coverage CCG parser. In Proceedings of the 40th Meeting of the ACL, pages 327-334, Philadelphia, PA.
    • (2002) Proceedings of the 40th Meeting of the ACL , pp. 327-334
    • Clark, S.1    Hockenmaier, J.2    Steedman, M.3
  • 30
    • 34748901333 scopus 로고    scopus 로고
    • Object-extraction and question-parsing using CCG
    • Barcelona, Spain
    • Clark, Stephen, Mark Steedman, and James R. Curran. 2004. Object-extraction and question-parsing using CCG. In Proceedings of the EMNLP Conference, pages 111-118, Barcelona, Spain.
    • (2004) Proceedings of the EMNLP Conference , pp. 111-118
    • Clark, S.1    Steedman, M.2    Curran, J.R.3
  • 31
    • 84941301490 scopus 로고    scopus 로고
    • A new statistical parser based on bigram lexical dependencies
    • Santa Cruz, CA
    • Collins, Michael. 1996. A new statistical parser based on bigram lexical dependencies. In Proceedings of the 34th Meeting of the ACL, pages 184-191, Santa Cruz, CA.
    • (1996) Proceedings of the 34th Meeting of the ACL , pp. 184-191
    • Collins, M.1
  • 32
    • 4043082208 scopus 로고    scopus 로고
    • Head-driven statistical models for natural language parsing
    • Collins, Michael. 2003. Head-driven statistical models for natural language parsing. Computational Linguistics, 29(4):589-637.
    • (2003) Computational Linguistics , vol.29 , Issue.4 , pp. 589-637
    • Collins, M.1
  • 34
    • 33646407289 scopus 로고    scopus 로고
    • Discriminative reranking for natural language parsing
    • Collins, Michael and Terry Koo. 2005. Discriminative reranking for natural language parsing. Computational Linguistics, 31(1):25-69.
    • (2005) Computational Linguistics , vol.31 , Issue.1 , pp. 25-69
    • Collins, M.1    Koo, T.2
  • 35
    • 85116919751 scopus 로고    scopus 로고
    • Incremental parsing with the perceptron algorithm
    • Barcelona, Spain
    • Collins, Michael and Brian Roark. 2004. Incremental parsing with the perceptron algorithm. In Proceedings of the 42nd Meeting of the ACL, pages 111-118, Barcelona, Spain.
    • (2004) Proceedings of the 42nd Meeting of the ACL , pp. 111-118
    • Collins, M.1    Roark, B.2
  • 37
    • 85054431952 scopus 로고    scopus 로고
    • Investigating GIS and smoothing for maximum entropy taggers
    • Budapest, Hungary
    • Curran, James R. and Stephen Clark. 2003. Investigating GIS and smoothing for maximum entropy taggers. In Proceedings of the 10th Meeting of the EACL, pages 91-98, Budapest, Hungary.
    • (2003) Proceedings of the 10th Meeting of the EACL , pp. 91-98
    • Curran, J.R.1    Clark, S.2
  • 39
    • 37249075030 scopus 로고
    • Amsterdam, The Netherlands
    • Curry, Haskell B. and Robert Feys. 1958. Combinatory Logic: Vol. I. Amsterdam, The Netherlands.
    • (1958) Combinatory Logic , vol.1
    • Curry, H.B.1    Feys, R.2
  • 40
    • 0001573124 scopus 로고
    • Generalized iterative scaling for log-linear models
    • Darroch, J. N. and D. Ratcliff. 1972. Generalized iterative scaling for log-linear models. The Annals of Mathematical Statistics, 43(5):1470-1480.
    • (1972) The Annals of Mathematical Statistics , vol.43 , Issue.5 , pp. 1470-1480
    • Darroch, J.N.1    Ratcliff, D.2
  • 42
    • 85149132341 scopus 로고    scopus 로고
    • Deep syntactic processing by combining shallow methods
    • Sapporo, Japan
    • Dienes, Peter and Amit Dubey. 2003. Deep syntactic processing by combining shallow methods. In Proceedings of the 41st Meeting of the ACL, pages 431-438, Sapporo, Japan.
    • (2003) Proceedings of the 41st Meeting of the ACL , pp. 431-438
    • Dienes, P.1    Dubey, A.2
  • 43
    • 85149117870 scopus 로고    scopus 로고
    • Efficient normal-form parsing for Combinatory Categorial Grammar
    • Santa Cruz, CA
    • Eisner, Jason. 1996. Efficient normal-form parsing for Combinatory Categorial Grammar. In Proceedings of the 34th Meeting of the ACL, pages 79-86, Santa Cruz, CA.
    • (1996) Proceedings of the 34th Meeting of the ACL , pp. 79-86
    • Eisner, J.1
  • 44
    • 9444286729 scopus 로고    scopus 로고
    • Dynamic programming for parsing and estimation of stochastic unification-based grammars
    • Philadelphia, PA
    • Geman, Stuart and Mark Johnson. 2002. Dynamic programming for parsing and estimation of stochastic unification-based grammars. In Proceedings of the 40th Meeting of the ACL, pages 279-286, Philadelphia, PA.
    • (2002) Proceedings of the 40th Meeting of the ACL , pp. 279-286
    • Geman, S.1    Johnson, M.2
  • 48
    • 0030243005 scopus 로고    scopus 로고
    • A high-performance, portable implementation of the MPI message passing interface standard
    • Gropp, W., E. Lusk, N. Doss, and A. Skjellum. 1996. A high-performance, portable implementation of the MPI message passing interface standard. Parallel Computing, 22(6):789-828.
    • (1996) Parallel Computing , vol.22 , Issue.6 , pp. 789-828
    • Gropp, W.1    Lusk, E.2    Doss, N.3    Skjellum, A.4
  • 50
    • 85149129947 scopus 로고    scopus 로고
    • Parsing with generative models of predicate-argument structure
    • Sapporo, Japan
    • Hockenmaier, Julia. 2003b. Parsing with generative models of predicate-argument structure. In Proceedings of the 41st Meeting of the ACL, pages 359-366, Sapporo, Japan.
    • (2003) Proceedings of the 41st Meeting of the ACL , pp. 359-366
    • Hockenmaier, J.1
  • 51
    • 84859896026 scopus 로고    scopus 로고
    • Acquiring compact lexicalized grammars from a cleaner treebank
    • Las Palmas, Spain
    • Hockenmaier, Julia and Mark Steedman. 2002a. Acquiring compact lexicalized grammars from a cleaner treebank. In Proceedings of the Third LREC Conference, pages 1974-1981, Las Palmas, Spain.
    • (2002) Proceedings of the Third LREC Conference , pp. 1974-1981
    • Hockenmaier, J.1    Steedman, M.2
  • 52
    • 85149144666 scopus 로고    scopus 로고
    • Generative models for statistical parsing with Combinatory Categorial Grammar
    • Philadelphia, PA
    • Hockenmaier, Julia and Mark Steedman. 2002b. Generative models for statistical parsing with Combinatory Categorial Grammar. In Proceedings of the 40th Meeting of the ACL, pages 335-342, Philadelphia, PA.
    • (2002) Proceedings of the 40th Meeting of the ACL , pp. 335-342
    • Hockenmaier, J.1    Steedman, M.2
  • 53
    • 0005921873 scopus 로고    scopus 로고
    • PCFG models of linguistic tree representations
    • Johnson, Mark. 1998. PCFG models of linguistic tree representations. Computational Linguistics, 24(4):613-632.
    • (1998) Computational Linguistics , vol.24 , Issue.4 , pp. 613-632
    • Johnson, M.1
  • 54
    • 85149140546 scopus 로고    scopus 로고
    • A simple pattern-matching algorithm for recovering empty nodes and their antecedents
    • Philadelphia, PA
    • Johnson, Mark. 2002. A simple pattern-matching algorithm for recovering empty nodes and their antecedents. In Proceedings of the 40th Meeting of the ACL, pages 136-143, Philadelphia, PA.
    • (2002) Proceedings of the 40th Meeting of the ACL , pp. 136-143
    • Johnson, M.1
  • 55
    • 79951862233 scopus 로고    scopus 로고
    • Estimators for stochastic 'unification-based' grammars
    • University of Maryland, College Park, MD
    • Johnson, Mark, Stuart Geman, Stephen Canon, Zhiyi Chi, and Stefan Riezler. 1999. Estimators for stochastic 'unification-based' grammars. In Proceedings of the 37th Meeting of the ACL, pages 535-541, University of Maryland, College Park, MD.
    • (1999) Proceedings of the 37th Meeting of the ACL , pp. 535-541
    • Johnson, M.1    Geman, S.2    Canon, S.3    Chi, Z.4    Riezler, S.5
  • 56
    • 0005923797 scopus 로고    scopus 로고
    • Exploiting auxiliary distributions in stochastic unification-based grammars
    • Seattle, WA
    • Johnson, Mark and Stefan Riezler. 2000. Exploiting auxiliary distributions in stochastic unification-based grammars. In Proceedings of the 1st Meeting of the NAACL, Seattle, WA.
    • (2000) Proceedings of the 1st Meeting of the NAACL
    • Johnson, M.1    Riezler, S.2
  • 58
    • 0011450901 scopus 로고
    • An efficient recognition and syntax analysis algorithm for context-free languages
    • Technical Report AFCRL-65-758, Air Force Cambridge Research Laboratory, Bedford, MA
    • Kasami, J. 1965. An efficient recognition and syntax analysis algorithm for context-free languages. Technical Report AFCRL-65-758, Air Force Cambridge Research Laboratory, Bedford, MA.
    • (1965)
    • Kasami, J.1
  • 60
    • 85090366702 scopus 로고    scopus 로고
    • Chunking with maximum entropy models
    • Lisbon, Portugal
    • Koeling, Rob. 2000. Chunking with maximum entropy models. In Proceedings of the CoNLL Workshop 2000, pages 139-141, Lisbon, Portugal.
    • (2000) Proceedings of the CoNLL Workshop 2000 , pp. 139-141
    • Koeling, R.1
  • 61
    • 0142192295 scopus 로고    scopus 로고
    • Conditional random fields: Probabilistic models for segmenting and labeling sequence data
    • Williams College, Williamstown, MA
    • Lafferty, John, Andrew McCallum, and Fernando Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of the 18th International Conference on Machine Learning, pages 282-289, Williams College, Williamstown, MA.
    • (2001) Proceedings of the 18th International Conference on Machine Learning , pp. 282-289
    • Lafferty, J.1    McCallum, A.2    Pereira, F.3
  • 62
    • 0002532056 scopus 로고
    • The estimation of stochastic context-free grammars using the inside-outside algorithm
    • Lari, K. and S. J. Young. 1990. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 4(1):35-56.
    • (1990) Computer Speech and Language , vol.4 , Issue.1 , pp. 35-56
    • Lari, K.1    Young, S.J.2
  • 64
    • 85149134023 scopus 로고    scopus 로고
    • Deep dependencies from context-free statistical parsers: Correcting the surface dependency approximation
    • Barcelona, Spain
    • Levy, Roger and Christopher Manning. 2004. Deep dependencies from context-free statistical parsers: Correcting the surface dependency approximation. In Proceedings of the 41st Meeting of the ACL, pages 328-335, Barcelona, Spain.
    • (2004) Proceedings of the 41st Meeting of the ACL , pp. 328-335
    • Levy, R.1    Manning, C.2
  • 65
    • 1042264823 scopus 로고    scopus 로고
    • A comparison of algorithms for maximum entropy parameter estimation
    • Taipei, Taiwan
    • Malouf, Robert. 2002. A comparison of algorithms for maximum entropy parameter estimation. In Proceedings of the Sixth Workshop on Natural Language Learning, pages 49-55, Taipei, Taiwan.
    • (2002) Proceedings of the Sixth Workshop on Natural Language Learning , pp. 49-55
    • Malouf, R.1
  • 67
    • 34249852033 scopus 로고
    • Building a large annotated corpus of English: The Penn Treebank
    • Marcus, Mitchell, Beatrice Santorini, and Mary Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313-330.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.1    Santorini, B.2    Marcinkiewicz, M.3
  • 72
    • 85055455978 scopus 로고    scopus 로고
    • Deep linguistic analysis for the accurate identification of predicate-argument relations
    • Geneva, Switzerland
    • Miyao, Yusuke and Jun'ichi Tsujii. 2004. Deep linguistic analysis for the accurate identification of predicate-argument relations. In Proceedings of COLING-2004, pages 1392-1397, Geneva, Switzerland.
    • (2004) Proceedings of COLING-2004 , pp. 1392-1397
    • Miyao, Y.1    Tsujii, J.2
  • 73
    • 33750369524 scopus 로고    scopus 로고
    • Probabilistic disambiguation models for wide-coverage HPSG parsing
    • University of Michigan, Ann Arbor
    • Miyao, Yusuke and Jun'ichi Tsujii. 2005. Probabilistic disambiguation models for wide-coverage HPSG parsing. In Proceedings of the 43rd meeting of the ACL, pages 83-90, University of Michigan, Ann Arbor.
    • (2005) Proceedings of the 43rd meeting of the ACL , pp. 83-90
    • Miyao, Y.1    Tsujii, J.2
  • 74
    • 0038847152 scopus 로고    scopus 로고
    • Categorial type logics
    • Johan van Benthem and Alice ter Meulen, editors, Elsevier, Amsterdam, and The MIT Press, Cambridge, MA
    • Moortgat, Michael. 1997. Categorial type logics. In Johan van Benthem and Alice ter Meulen, editors, Handbook of Logic and Language. Elsevier, Amsterdam, and The MIT Press, Cambridge, MA, pages 93-177.
    • (1997) Handbook of Logic and Language , pp. 93-177
    • Moortgat, M.1
  • 77
  • 79
    • 33645983416 scopus 로고    scopus 로고
    • The Proposition Bank: A corpus annotated with semantic roles
    • Palmer, Martha, Dan Gildea, and Paul Kingsbury. 2005. The Proposition Bank: A corpus annotated with semantic roles. Computational Linguistics, 31(1):71-105.
    • (2005) Computational Linguistics , vol.31 , Issue.1 , pp. 71-105
    • Palmer, M.1    Gildea, D.2    Kingsbury, P.3
  • 80
    • 33846526239 scopus 로고    scopus 로고
    • Using grammatical relations to compare parsers
    • Budapest, Hungary
    • Preiss, Judita. 2003. Using grammatical relations to compare parsers. In Proceedings of the 10th Meeting of the EACL, pages 291-298, Budapest, Hungary.
    • (2003) Proceedings of the 10th Meeting of the EACL , pp. 291-298
    • Preiss, J.1
  • 81
    • 37249061798 scopus 로고    scopus 로고
    • Reinforcing parser preferences through tagging
    • Prins, Robbert and Gertjan van Noord. 2003. Reinforcing parser preferences through tagging. Traitement Automatique des Langues, 44(3):121-139.
    • (2003) Traitement Automatique des Langues , vol.44 , Issue.3 , pp. 121-139
    • Prins, R.1    van Noord, G.2
  • 82
    • 85124016637 scopus 로고    scopus 로고
    • A maximum entropy part-of-speech tagger
    • Philadelphia, PA
    • Ratnaparkhi, Adwait. 1996. A maximum entropy part-of-speech tagger. In Proceedings of the EMNLP Conference, pages 133-142, Philadelphia, PA.
    • (1996) Proceedings of the EMNLP Conference , pp. 133-142
    • Ratnaparkhi, A.1
  • 84
    • 0032660854 scopus 로고    scopus 로고
    • Learning to parse natural language with maximum entropy models
    • Ratnaparkhi, Adwait. 1999. Learning to parse natural language with maximum entropy models. Machine Learning, 34(1-3):151-175.
    • (1999) Machine Learning , vol.34 , Issue.1-3 , pp. 151-175
    • Ratnaparkhi, A.1
  • 86
    • 85118146972 scopus 로고    scopus 로고
    • Parsing the Wall Street Journal using a Lexical-Functional Grammar and discriminative estimation techniques
    • Philadelphia, PA
    • Riezler, Stefan, Tracy H. King, Ronald M. Kaplan, Richard Crouch, John T. Maxwell, III, and Mark Johnson. 2002. Parsing the Wall Street Journal using a Lexical-Functional Grammar and discriminative estimation techniques. In Proceedings of the 40th Meeting of the ACL, pages 271-278, Philadelphia, PA.
    • (2002) Proceedings of the 40th Meeting of the ACL , pp. 271-278
    • Riezler, S.1    King, T.H.2    Kaplan, R.M.3    Crouch, R.4    Maxwell III, J.T.5    Johnson, M.6
  • 88
    • 37249020167 scopus 로고    scopus 로고
    • Sarkar, Anoop and Aravind Joshi. 2003. Tree-adjoining grammars and its application to statistical parsing. In Rens Bod, Remko Scha, and Khalil Sima'an, editors, Data-oriented parsing. CSLI Publications, Stanford, CA.
    • Sarkar, Anoop and Aravind Joshi. 2003. Tree-adjoining grammars and its application to statistical parsing. In Rens Bod, Remko Scha, and Khalil Sima'an, editors, Data-oriented parsing. CSLI Publications, Stanford, CA.
  • 89
    • 85043116988 scopus 로고    scopus 로고
    • Shallow parsing with conditional random fields
    • Edmonton, Canada
    • Sha, Fei and Fernando Pereira. 2003. Shallow parsing with conditional random fields. In Proceedings of the HLT/NAACL conference, pages 213-220, Edmonton, Canada.
    • (2003) Proceedings of the HLT/NAACL conference , pp. 213-220
    • Sha, F.1    Pereira, F.2
  • 92
    • 84890494404 scopus 로고    scopus 로고
    • Semi-supervised training for statistical parsing: Final report
    • WS-02, Center for Language and Speech Processing, Johns Hopkins University, Baltimore, MD
    • Steedman, Mark, Steven Baker, Stephen Clark, Jeremiah Crim, Julia Hockenmaier, Rebecca Hwa, Miles Osborne, Paul Ruhlen, and Anoop Sarkar. 2002. Semi-supervised training for statistical parsing: Final report. Technical Report CLSP WS-02, Center for Language and Speech Processing, Johns Hopkins University, Baltimore, MD.
    • (2002) Technical Report CLSP
    • Steedman, M.1    Baker, S.2    Clark, S.3    Crim, J.4    Hockenmaier, J.5    Hwa, R.6    Osborne, M.7    Ruhlen, P.8    Sarkar, A.9
  • 95
    • 37249070952 scopus 로고    scopus 로고
    • The leaf projection path view of parse trees: Exploring string kernels for HPSG parse selection
    • Barcelona, Spain
    • Toutanova, Kristina, Penka Markova, and Christopher Manning. 2004. The leaf projection path view of parse trees: Exploring string kernels for HPSG parse selection. In Proceedings of the EMNLP conference, pages 166-173, Barcelona, Spain.
    • (2004) Proceedings of the EMNLP conference , pp. 166-173
    • Toutanova, K.1    Markova, P.2    Manning, C.3
  • 99
    • 85037145772 scopus 로고    scopus 로고
    • A uniform method of grammar extraction and its applications
    • Hong Kong
    • Xia, Fei, Martha Palmer, and Aravind Joshi. 2000. A uniform method of grammar extraction and its applications. In Proceedings of the EMNLP Conference, pages 53-62, Hong Kong.
    • (2000) Proceedings of the EMNLP Conference , pp. 53-62
    • Xia, F.1    Palmer, M.2    Joshi, A.3
  • 101
    • 36348934176 scopus 로고    scopus 로고
    • Learning to map sentences to logical form: Structured classification with probabilistic categorial grammars
    • Edinburgh, UK
    • Zettlemoyer, Luke S. and Michael Collins. 2005. Learning to map sentences to logical form: Structured classification with probabilistic categorial grammars. In Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, pages 658-666, Edinburgh, UK.
    • (2005) Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence , pp. 658-666
    • Zettlemoyer, L.S.1    Collins, M.2


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