메뉴 건너뛰기




Volumn , Issue , 2008, Pages 3159-3166

Induction of treebank-aligned lexical resources

Author keywords

[No Author keywords available]

Indexed keywords

LINGUISTICS; SYNTACTICS;

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

References (19)
  • 1
    • 24044475437 scopus 로고    scopus 로고
    • Inside-outside estimation of a lexicalized pcfg for German
    • F. Beil, G. Carroll, D. Prescher, S. Riezler, and M. Rooth. 1999. Inside-outside estimation of a lexicalized pcfg for german. In ACL 37.
    • (1999) ACL , pp. 37
    • Beil, F.1    Carroll, G.2    Prescher, D.3    Riezler, S.4    Rooth, M.5
  • 2
    • 85037530432 scopus 로고
    • Automatic acquisition of subcategorization frames from untagged text
    • M. Brent. 1991. Automatic acquisition of subcategorization frames from untagged text. In ACL 29.
    • (1991) ACL , pp. 29
    • Brent, M.1
  • 5
    • 85139594775 scopus 로고    scopus 로고
    • Building deep dependency structures using a wide-coverage ccg parser
    • Stephen Clark, Julia Hockenmaier, and Mark Steedman. 2002. Building deep dependency structures using a wide-coverage ccg parser. In ACL40, pages 00-00.
    • (2002) ACL40
    • Clark, S.1    Hockenmaier, J.2    Steedman, M.3
  • 6
    • 84905704443 scopus 로고    scopus 로고
    • A subcategorisation lexicon for German verbs induced from a lexicalised pcfg
    • Sabine Schulte im Walde. 2002. A subcategorisation lexicon for german verbs induced from a lexicalised pcfg. In LREC 2002.
    • (2002) LREC 2002
    • Schulte Im Walde, S.1
  • 7
    • 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
  • 8
    • 85146417759 scopus 로고    scopus 로고
    • Accurate unlexicalized parsing
    • Sapporo, Japan
    • Dan Klein and Christopher Manning. 2003. Accurate unlexicalized parsing. In ACL 41, Sapporo, Japan.
    • (2003) ACL , pp. 41
    • Klein, D.1    Manning, C.2
  • 10
    • 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
  • 11
    • 0000264471 scopus 로고
    • Automatic acquisition of a large subcategorization dictionary from corpora
    • C. Manning. 1993. Automatic acquisition of a large subcategorization dictionary from corpora. In ACL 31.
    • (1993) ACL , pp. 31
    • Manning, C.1
  • 12
    • 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
  • 13
    • 33646385856 scopus 로고    scopus 로고
    • Large-scale induction and evaluation of lexical resources from the penn-II and penn-III treebanks
    • R. O'Donovan, M. Burke, A. Cahill, J. van Genabith, and A. Way. 2005. Large-scale induction and evaluation of lexical resources from the penn-ii and penn-iii treebanks. Computational Linguistics, 31:329-365.
    • (2005) Computational Linguistics , vol.31 , pp. 329-365
    • O'Donovan, R.1    Burke, M.2    Cahill, A.3    Van Genabith, J.4    Way, A.5
  • 14
    • 85037529132 scopus 로고    scopus 로고
    • Yappffun: Java implemention of shared forest algorithms
    • Cornell University
    • Lior Privman. 2003. Yappffun: Java implemention of shared forest algorithms. Computational Linguistics Lab, Cornell University.
    • (2003) Computational Linguistics Lab
    • Privman, L.1
  • 17
    • 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 COLING 2004.
    • (2004) COLING 2004
    • Schmid, H.1


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