메뉴 건너뛰기




Volumn 1, Issue , 2008, Pages 193-200

Re-estimation of lexical parameters for treebank PCFGs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

EID: 80053428142     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1599081.1599106     Document Type: Conference Paper
Times cited : (6)

References (27)
  • 2
    • 25844498898 scopus 로고    scopus 로고
    • Intricacies of collins' parser
    • Dan Bikel. 2004. Intricacies of Collins' Parser. Computational Linguistics, 30(4):479-511.
    • (2004) Computational Linguistics , vol.30 , Issue.4 , pp. 479-511
    • Bikel, D.1
  • 3
    • 85149127507 scopus 로고
    • Automatic acquisition of subcat-egorization frames from untagged text
    • M. Brent. 1991. Automatic acquisition of subcat-egorization frames from untagged text. In Proceedings of the 29th meeting of ACL.
    • (1991) Proceedings of the 29th Meeting of ACL
    • Brent, M.1
  • 7
    • 84859885240 scopus 로고    scopus 로고
    • Coarse-to-fine n-best parsing and MaxEnt discriminative reranking
    • Eugene Charniak and Mark Johnson. 2005. Coarse-to-fine n-best parsing and MaxEnt discriminative reranking. In Proceedings of 43rd meeting of ACL.
    • (2005) Proceedings of 43rd Meeting of ACL
    • Charniak, E.1    Johnson, M.2
  • 8
    • 85118152899 scopus 로고    scopus 로고
    • Three generative, lexi-calised models for statistical parsing
    • Michael Collins. 1997. Three generative, lexi-calised models for statistical parsing. In Proceedings of the 35th meeting of ACL.
    • (1997) Proceedings of the 35th Meeting of ACL
    • Collins, M.1
  • 9
    • 84874201872 scopus 로고
    • On the unsupervised induction of phrase structure grammars
    • Carl de Marcken. 1995. On the unsupervised induction of Phrase Structure grammars. In 3rd Workshop on Very Large Corpora.
    • (1995) 3rd Workshop on Very Large Corpora
    • De Marcken, C.1
  • 10
    • 0002629270 scopus 로고
    • Maximum likelihood estimation from incomplete data via the EM algorithm
    • A. P. Dempster, N. M. Laird, and D. B. Rubin. 1977. Maximum likelihood estimation from incomplete data via the EM algorithm. J. Royal Statistical Society, 39(B):1-38.
    • (1977) J. Royal Statistical Society , vol.39 , Issue.B , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 11
    • 80053428543 scopus 로고    scopus 로고
    • Induction of treebank-aligned lexical resources
    • Tejaswini Deoskar and Mats Rooth. 2008. Induction of Treebank-Aligned Lexical Resources. In Proceedings of 6th LREC.
    • (2008) Proceedings of 6th LREC
    • Deoskar, T.1    Rooth, M.2
  • 12
    • 84859944900 scopus 로고    scopus 로고
    • Corpus variation and parser performance
    • Daniel Gildea. 2001. Corpus Variation and Parser Performance. In Proceedings of EMNLP 2001.
    • (2001) Proceedings of EMNLP 2001
    • Gildea, D.1
  • 14
    • 85055298846 scopus 로고
    • Structural ambiguity and lexical relations
    • Donald Hindle and Mats Rooth. 1993. Structural ambiguity and lexical relations. Computational Linguistics, 18(2):103-120.
    • (1993) Computational Linguistics , vol.18 , Issue.2 , pp. 103-120
    • Hindle, D.1    Rooth, M.2
  • 15
    • 84905704443 scopus 로고    scopus 로고
    • A subcategori-sation lexicon for german verbs induced from a lexicalised PCFG
    • Sabine Schulte im Walde. 2002. A Subcategori-sation Lexicon for German Verbs induced from a Lexicalised PCFG. In Proceedings of LREC 2002.
    • (2002) Proceedings of LREC 2002
    • Walde, S.S.1
  • 16
    • 0005921873 scopus 로고    scopus 로고
    • PCFG models of linguistic tree representations
    • Mark Johnson. 1998. PCFG models of linguistic tree representations. Computational Linguistics, 24(4).
    • (1998) Computational Linguistics , vol.24 , Issue.4
    • Johnson, M.1
  • 19
    • 0002532056 scopus 로고
    • The estimation of stochastic context-free grammars using the inside-outside algorithm
    • K. Lari and S. J. Young. 1990. The estimation of stochastic context-free grammars using the Inside-Outside algorithm. Computer Speech and Language, 4:35-56.
    • (1990) Computer Speech and Language , vol.4 , pp. 35-56
    • Lari, K.1    Young, S.J.2
  • 20
    • 85149128202 scopus 로고
    • Automatic acquisition of a large subcategorization dictionary from corpora
    • C. Manning. 1993. Automatic acquisition of a large subcategorization dictionary from corpora. In Proceedings of the 31st meeting of ACL.
    • (1993) Proceedings of the 31st Meeting of ACL
    • Manning, C.1
  • 21
    • 34249852033 scopus 로고
    • Building a large annotated corpus of english: The penn treebank
    • M. P. Marcus, B. Santorini, and M. A. 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.P.1    Santorini, B.2    Marcinkiewicz, M.A.3
  • 23
    • 85059598488 scopus 로고
    • Inside-outside re-estimation from partially bracketed corpora
    • Pereira and Schabes. 1992. Inside-Outside re-estimation from partially bracketed corpora. In Proceedings of the 30th meeting of ACL.
    • (1992) Proceedings of the 30th Meeting of ACL
    • Pereira1    Schabes2
  • 24
    • 80053409977 scopus 로고    scopus 로고
    • A tutorial on the expectation-maximization algorithm including maximum-likelihood estimation and EM training of probabilistic context-free grammars
    • Detlef Prescher. 2003. A Tutorial on the Expectation-Maximization Algorithm Including Maximum-Likelihood Estimation and EM Training of Probabilistic Context-Free Grammars. ESSLLI 2003.
    • (2003) ESSLLI 2003
    • Prescher, D.1
  • 26
    • 84859923106 scopus 로고    scopus 로고
    • Efficient parsing of highly ambiguous context-free grammars with bit vectors
    • Helmut Schmid. 2004. Efficient Parsing of Highly Ambiguous Context-Free Grammars with Bit Vectors. In Proceedings of the 20th COLING.
    • (2004) Proceedings of the 20th COLING
    • Schmid, H.1


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