메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 865-872

An all-subtrees approach to unsupervised parsing

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FREQUENCY ESTIMATION; MAXIMUM LIKELIHOOD ESTIMATION; SYNTACTICS;

EID: 84859907622     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1220175.1220284     Document Type: Conference Paper
Times cited : (97)

References (28)
  • 2
    • 84962811751 scopus 로고    scopus 로고
    • Combining semantic and syntactic structure for language modeling
    • Beijing
    • Bod, R. 2000. Combining semantic and syntactic structure for language modeling. Proceedings ICSLP 2000, Beijing.
    • (2000) Proceedings ICSLP 2000
    • Bod, R.1
  • 3
    • 33646029849 scopus 로고    scopus 로고
    • An efficient implementation of a new DOP model
    • Budapest
    • Bod, R. 2003. An efficient implementation of a new DOP model. Proceedings EACL 2003, Budapest.
    • (2003) Proceedings EACL 2003
    • Bod, R.1
  • 4
    • 44849125094 scopus 로고    scopus 로고
    • Unsupervised parsing with U-DOP
    • New York
    • Bod, R. 2006. Unsupervised Parsing with U-DOP. Proceedings CONLL 2006, New York.
    • (2006) Proceedings CONLL 2006
    • Bod, R.1
  • 6
    • 0039623923 scopus 로고    scopus 로고
    • Estimation of probabilistic context-free grammars
    • Chi, Z. and S. Geman 1998. Estimation of Probabilistic Context-Free Grammars. Computational Linguistics 24, 299-305.
    • (1998) Computational Linguistics , vol.24 , pp. 299-305
    • Chi, Z.1    Geman, S.2
  • 7
    • 19844383195 scopus 로고    scopus 로고
    • Unsupervised induction of stochastic context-free grammars using distributional clustering
    • Clark, A. 2001. Unsupervised induction of stochastic context-free grammars using distributional clustering. Proceedings CONLL 2001.
    • (2001) Proceedings CONLL 2001
    • Clark, A.1
  • 8
    • 33646057547 scopus 로고    scopus 로고
    • New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron
    • Philadelphia
    • Collins, M. and N. Duffy 2002. New ranking algorithms for parsing and tagging: kernels over discrete structures, and the voted perceptron. Proceedings ACL 2002, Philadelphia.
    • (2002) Proceedings ACL 2002
    • Collins, M.1    Duffy, N.2
  • 10
    • 84860529013 scopus 로고    scopus 로고
    • Efficient algorithms for the DOP model
    • R. Bod, R. Scha and K. Sima'an (eds.), University of Chicago Press
    • Goodman, J. 2003. Efficient algorithms for the DOP model. In R. Bod, R. Scha and K. Sima'an (eds.). Data-Oriented Parsing, University of Chicago Press.
    • (2003) Data-Oriented Parsing
    • Goodman, J.1
  • 12
    • 0040078058 scopus 로고    scopus 로고
    • The DOP estimation method is biased and inconsistent
    • Johnson, M. 2002. The DOP estimation method is biased and inconsistent. Computational Linguistics 28, 71-76.
    • (2002) Computational Linguistics , vol.28 , pp. 71-76
    • Johnson, M.1
  • 14
    • 85061893834 scopus 로고    scopus 로고
    • A general constituent-context model for improved grammar induction
    • Philadelphia
    • Klein, D. and C. Manning 2002. A general constituent-context model for improved grammar induction. Proceedings ACL 2002, Philadelphia.
    • (2002) Proceedings ACL 2002
    • Klein, D.1    Manning, C.2
  • 15
    • 29344466697 scopus 로고    scopus 로고
    • Corpus-based induction of syntactic structure: Models of dependency and constituency
    • Barcelona
    • Klein, D. and C. Manning 2004. Corpus-based induction of syntactic structure: models of dependency and constituency. Proceedings ACL 2004, Barcelona.
    • (2004) Proceedings ACL 2004
    • Klein, D.1    Manning, C.2
  • 16
    • 19944397500 scopus 로고    scopus 로고
    • Natural language grammar induction with a generative constituentcontext model
    • Klein, D. and C. Manning 2005. Natural language grammar induction with a generative constituentcontext model. Pattern Recognition 38, 1407-1419.
    • (2005) Pattern Recognition , vol.38 , pp. 1407-1419
    • Klein, D.1    Manning, C.2
  • 17
    • 84860514925 scopus 로고
    • Expectation-maximization for data-oriented parsing
    • Yorktown Heights, NY
    • Magerman, D. 1993. Expectation-Maximization for Data-Oriented Parsing, IBM Technical Report, Yorktown Heights, NY.
    • (1993) IBM Technical Report
    • Magerman, D.1
  • 21
    • 85119471829 scopus 로고
    • Distributional part-of-speech tagging
    • Dublin
    • Schütze, H. 1995. Distributional part-of-speech tagging. Proceedings ACL 1995, Dublin.
    • (1995) Proceedings ACL 1995
    • Schütze, H.1
  • 23
    • 0010323861 scopus 로고    scopus 로고
    • Computational complexity of probabilistic disambiguation by means of tree grammars
    • Copenhagen
    • Sima'an, K. 1996. Computational complexity of probabilistic disambiguation by means of tree grammars. Proceedings COLING 1996, Copenhagen.
    • (1996) Proceedings COLING 1996
    • Sima'An, K.1
  • 25
  • 26
    • 24644449314 scopus 로고    scopus 로고
    • ABL: Alignment-based learning
    • Saarbrücken
    • van Zaanen, M. 2000. ABL: Alignment-Based Learning. Proceedings COLING 2000, Saarbrücken.
    • (2000) Proceedings COLING 2000
    • Van Zaanen, M.1
  • 28
    • 44849105166 scopus 로고    scopus 로고
    • What are the productive units of natural language grammar? A DOP approach to the automatic identification of constructions
    • New York
    • Zuidema, W. 2006. What are the productive units of natural language grammar? A DOP approach to the automatic identification of constructions. Proceedings CONLL 2006, New York.
    • (2006) Proceedings CONLL 2006
    • Zuidema, W.1


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