메뉴 건너뛰기




Volumn 29, Issue 4, 2003, Pages 589-637

Head-driven statistical models for natural language parsing

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS;

EID: 4043082208     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: 10.1162/089120103322753356     Document Type: Review
Times cited : (384)

References (58)
  • 2
    • 84937315975 scopus 로고
    • Training and scaling preference functions for disambiguation
    • Alshawi, Hiyan and David Carter. 1994. Training and scaling preference functions for disambiguation. Computational Linguistics, 20(4):635-648.
    • (1994) Computational Linguistics , vol.20 , Issue.4 , pp. 635-648
    • Alshawi, H.1    Carter, D.2
  • 8
    • 0009626003 scopus 로고    scopus 로고
    • What is the minimal set of fragments that achieves maximal parse accuracy?
    • Bod, Rens. 2001. What is the minimal set of fragments that achieves maximal parse accuracy? In Proceedings of ACL 2001.
    • (2001) Proceedings of ACL 2001
    • Bod, R.1
  • 9
    • 0015617823 scopus 로고
    • Applying probability measures to abstract languages
    • Booth, Taylor L., and Richard A. Thompson. 1973. Applying probability measures to abstract languages. IEEE Transactions on Computers, C-22(5):442-450.
    • (1973) IEEE Transactions on Computers , vol.C-22 , Issue.5 , pp. 442-450
    • Booth, T.L.1    Thompson, R.A.2
  • 14
    • 85149120248 scopus 로고    scopus 로고
    • Exploiting syntactic structure for language modeling
    • Montreal
    • Chelba, Ciprian, and Frederick Jelinek. 1998. Exploiting syntactic structure for language modeling. In Proceedings of COLING-ACL 1998, Montreal.
    • (1998) Proceedings of COLING-ACL 1998
    • Chelba, C.1    Jelinek, F.2
  • 15
    • 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 ACL 2000, Hong Kong, pages 456-463.
    • (2000) Proceedings of ACL 2000 , pp. 456-463
    • Chiang, D.1
  • 24
    • 4043070633 scopus 로고    scopus 로고
    • Three new probabilistic models for dependency parsing: An exploration
    • Eisner, Jason. 1996a. Three new probabilistic models for dependency parsing: An exploration. Proceedings of COLING-96, pages 340-345.
    • (1996) Proceedings of COLING-96 , pp. 340-345
    • Eisner, J.1
  • 25
    • 0005994969 scopus 로고    scopus 로고
    • An empirical comparison of probability models for dependency grammar
    • Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia
    • Eisner, Jason. 1996b. An empirical comparison of probability models for dependency grammar. Technical Report IRCS-96-11, Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia.
    • (1996) Technical Report , vol.IRCS-96-11
    • Eisner, J.1
  • 27
    • 85149142007 scopus 로고    scopus 로고
    • Efficient parsing for bilexical context-free grammars and head automaton grammars
    • Eisner, Jason, and Giorgio Satta. 1999. Efficient parsing for bilexical context-free grammars and head automaton grammars. In Proceedings of the 37th Annual Meeting of the ACL.
    • (1999) Proceedings of the 37th Annual Meeting of the ACL
    • Eisner, J.1    Satta, G.2
  • 36
    • 4043135866 scopus 로고    scopus 로고
    • The effect of alternative tree representations on tree bank grammars
    • Johnson, Mark. 1997. The effect of alternative tree representations on tree bank grammars. In Proceedings of NeMLAP 3.
    • (1997) Proceedings of NeMLAP 3
    • Johnson, M.1
  • 41
    • 0142192295 scopus 로고    scopus 로고
    • Conditional random fields: Probabilistic models for segmenting and labeling sequence data
    • Lafferty, John, Andrew McCallum, and Fernando Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of ICML 2001.
    • (2001) Proceedings of ICML 2001
    • Lafferty, J.1    McCallum, A.2    Pereira, F.3
  • 46
    • 34249852033 scopus 로고
    • Building a large annotated corpus of english: The penn treebank
    • Marcus, Mitchell, Beatrice Santorini and M. 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
  • 48
    • 0019012878 scopus 로고
    • Definite clause grammars for language analysis: A survey of the formalism and a comparison with augmented transition networks
    • Pereira, Fernando, and David Warren. 1980. Definite clause grammars for language analysis: A survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence, 13:231-278.
    • (1980) Artificial Intelligence , vol.13 , pp. 231-278
    • Pereira, F.1    Warren, D.2
  • 52
    • 0010032272 scopus 로고
    • Probabilistic tree-adjoining grammar as a framework for statistical natural language processing
    • Resnik, Philip. 1992. Probabilistic tree-adjoining grammar as a framework for statistical natural language processing. In Proceedings of COLING 1992, vol. 2, pages 418-424.
    • (1992) Proceedings of COLING 1992 , vol.2 , pp. 418-424
    • Resnik, P.1
  • 53
    • 0041079041 scopus 로고    scopus 로고
    • Probabilistic top-down parsing and language modeling
    • Roark, Brian. 2001. Probabilistic top-down parsing and language modeling. Computational Linguistics, 27(2):249-276.
    • (2001) Computational Linguistics , vol.27 , Issue.2 , pp. 249-276
    • Roark, B.1
  • 54
    • 0041355525 scopus 로고
    • Stochastic lexicalized tree-adjoining grammars
    • Schabes, Yves. 1992. Stochastic lexicalized tree-adjoining grammars. In Proceedings of COLING 1992, vol. 2, pages 426-432.
    • (1992) Proceedings of COLING 1992 , vol.2 , pp. 426-432
    • Schabes, Y.1
  • 57
    • 85014377643 scopus 로고
    • TINA: A natural language system for spoken language applications
    • Seneff, Stephanie. 1992. TINA: A natural language system for spoken language applications. Computational Linguistics, 18(l):61-86.
    • (1992) Computational Linguistics , vol.18 , Issue.50 , pp. 61-86
    • Seneff, S.1
  • 58
    • 0026187945 scopus 로고
    • The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression
    • Wirten, Ian and Timothy C. Bell. 1991. The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression. IEEE Transactions on Information Theory, 37(4):1085-1094.
    • (1991) IEEE Transactions on Information Theory , vol.37 , Issue.4 , pp. 1085-1094
    • Wirten, I.1    Bell, T.C.2


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