메뉴 건너뛰기




Volumn , Issue , 2010, Pages 1204-1213

Unsupervised induction of tree substitution grammars for dependency parsing

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY GRAMMAR; DEPENDENCY PARSING; NON-PARAMETRIC;

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

References (25)
  • 3
    • 19844383195 scopus 로고    scopus 로고
    • Unsupervised induction of stochastic context-free grammars using distributional clustering
    • Association for Computational Linguistics
    • Alexander Clark. 2001. Unsupervised induction of stochastic context-free grammars using distributional clustering. In ConLL '01: Proceedings of the 2001 workshop on Computational Natural Language Learning, pages 1-8. Association for Computational Linguistics.
    • (2001) ConLL '01: Proceedings of the 2001 Workshop on Computational Natural Language Learning , pp. 1-8
    • Clark, A.1
  • 5
    • 79551491348 scopus 로고    scopus 로고
    • Logistic normal priors for unsupervised probabilistic grammar induction
    • Daphne Koller, Dale Schuurmans, Yoshua Bengio, and Lon Bottou, editors MIT Press
    • Shay B. Cohen, Kevin Gimpel, and Noah A. Smith. 2008. Logistic normal priors for unsupervised probabilistic grammar induction. In Daphne Koller, Dale Schuurmans, Yoshua Bengio, and Lon Bottou, editors, NIPS, pages 321-328. MIT Press.
    • (2008) NIPS , pp. 321-328
    • Cohen, S.B.1    Gimpel, K.2    Smith, N.A.3
  • 10
    • 4043082208 scopus 로고    scopus 로고
    • Head-driven statistical models for natural language parsing
    • DOI 10.1162/089120103322753356
    • Michael Collins. 2003. Head-driven statistical models for natural language parsing. Computational Linguistics, 29(4):589-637. (Pubitemid 39056498)
    • (2003) Computational Linguistics , vol.29 , Issue.4 , pp. 589-637
    • Collins, M.1
  • 11
    • 0042357353 scopus 로고    scopus 로고
    • Bilexical grammars and their cubic-time parsing algorithms
    • Harry Bunt and Anton Nijholt, editors Kluwer Academic Publishers, October
    • Jason Eisner. 2000. Bilexical grammars and their cubic-time parsing algorithms. In Harry Bunt and Anton Nijholt, editors, Advances in Probabilistic and Other Parsing Technologies, pages 29-62. Kluwer Academic Publishers, October.
    • (2000) Advances in Probabilistic and Other Parsing Technologies , pp. 29-62
    • Eisner, J.1
  • 12
    • 0021518209 scopus 로고
    • Stochastic relaxation, gibbs distributions, and the bayesian restoration of images
    • Stuart Geman and Donald Geman. 1984. Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6:721-741. (Pubitemid 15453722)
    • (1984) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.PAMI-6 , Issue.6 , pp. 721-741
    • Geman, S.1    Geman, D.2
  • 13
    • 33749240868 scopus 로고    scopus 로고
    • Interpolating between types and tokens by estimating power-law generators
    • Y. Weiss, B. Schölkopf, and J. Platt, editors MIT Press, Cambridge, MA
    • Sharon Goldwater, Tom Griffiths, and Mark Johnson. 2006. Interpolating between types and tokens by estimating power-law generators. In Y. Weiss, B. Schölkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18, pages 459-466. MIT Press, Cambridge, MA.
    • (2006) Advances in Neural Information Processing Systems , vol.18 , pp. 459-466
    • Goldwater, S.1    Griffiths, T.2    Johnson, M.3
  • 15
    • 84860503337 scopus 로고    scopus 로고
    • Transforming projective bilexical dependency grammars into efficiently-parsable CFGs with unfold-fold
    • Prague, Czech Republic, June. Association for Computational Linguistics
    • Mark Johnson. 2007. Transforming projective bilexical dependency grammars into efficiently-parsable CFGs with unfold-fold. In Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, pages 168-175, Prague, Czech Republic, June. Association for Computational Linguistics.
    • (2007) Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics , pp. 168-175
    • Johnson, M.1
  • 16
    • 85061893834 scopus 로고    scopus 로고
    • A generative constituent-context model for improved grammar induction
    • Philadelphia, Pennsylvania, USA, July. Association for Computational Linguistics
    • Dan Klein and Christopher D. Manning. 2002. 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. Association for Computational Linguistics.
    • (2002) Proceedings of 40th Annual Meeting of the Association for Computational Linguistics , pp. 128-135
    • Klein, D.1    Manning, C.D.2
  • 18
    • 34249852033 scopus 로고
    • Building a large annotated corpus of english: The penn treebank
    • Mitchell P. Marcus, Mary Ann Marcinkiewicz, and Beatrice Santorini. 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.P.1    Marcinkiewicz, M.A.2    Santorini, B.3
  • 21
    • 1642370803 scopus 로고    scopus 로고
    • Slice sampling
    • Radford Neal. 2003. Slice sampling. Annals of Statistics, 31:705-767.
    • (2003) Annals of Statistics , vol.31 , pp. 705-767
    • Neal, R.1


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