메뉴 건너뛰기




Volumn 2003-July, Issue , 2003, Pages

Accurate unlexicalized parsing

Author keywords

[No Author keywords available]

Indexed keywords

'CURRENT; ASYMPTOTIC COMPLEXITY; BREAK DOWN; INDEPENDENCE ASSUMPTION; LOW BOUND; PARSING ALGORITHM; PERFORMANCE; SIMPLE++; STATE OF THE ART; TREEBANKS;

EID: 85146417759     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2313)

References (20)
  • 3
    • 0010039182 scopus 로고    scopus 로고
    • New figures of merit for best-first probabilistic chart parsing
    • Sharon A. Caraballo and Eugene Charniak. 1998. New figures of merit for best-first probabilistic chart parsing. Computational Linguistics, 24:275-298.
    • (1998) Computational Linguistics , vol.24 , pp. 275-298
    • Caraballo, Sharon A.1    Charniak, Eugene2
  • 7
    • 85036148712 scopus 로고    scopus 로고
    • A maximum-entropy-inspired parser
    • Eugene Charniak. 2000. A maximum-entropy-inspired parser. In NAACL 1, pages 132-139.
    • (2000) NAACL , vol.1 , pp. 132-139
    • Charniak, Eugene1
  • 8
    • 4043065025 scopus 로고    scopus 로고
    • Immediate-head parsing for language models
    • Eugene Charniak. 2001. Immediate-head parsing for language models. In ACL 39.
    • (2001) ACL , vol.39
    • Charniak, Eugene1
  • 10
    • 84941301490 scopus 로고    scopus 로고
    • A new statistical parser based on bigram lexical dependencies
    • Michael John Collins. 1996. A new statistical parser based on bigram lexical dependencies. In ACL 34, pages 184-191.
    • (1996) ACL , vol.34 , pp. 184-191
    • Collins, Michael John1
  • 12
    • 85149142007 scopus 로고    scopus 로고
    • Efficient parsing for bilexical context-free grammars and head-automaton grammars
    • Jason Eisner and Giorgio Satta. 1999. Efficient parsing for bilexical context-free grammars and head-automaton grammars. In ACL 37, pages 457-464.
    • (1999) ACL , vol.37 , pp. 457-464
    • Eisner, Jason1    Satta, Giorgio2
  • 15
    • 85055298846 scopus 로고
    • Structural ambiguity and lexical relations
    • Donald Hindle and Mats Rooth. 1993. Structural ambiguity and lexical relations. Computational Linguistics, 19(1):103-120.
    • (1993) Computational Linguistics , vol.19 , Issue.1 , pp. 103-120
    • Hindle, Donald1    Rooth, Mats2
  • 16
    • 0005921873 scopus 로고    scopus 로고
    • PCFG models of linguistic tree representations
    • Mark Johnson. 1998. PCFG models of linguistic tree representations. Computational Linguistics, 24:613-632.
    • (1998) Computational Linguistics , vol.24 , pp. 613-632
    • Johnson, Mark1
  • 17
    • 0043094969 scopus 로고    scopus 로고
    • Parsing with treebank grammars: Empirical bounds, theoretical models, and the structure of the Penn treebank
    • Dan Klein and Christopher D. Manning. 2001. Parsing with treebank grammars: Empirical bounds, theoretical models, and the structure of the Penn treebank. In ACL 39/EACL 10.
    • (2001) ACL 39/EACL 10
    • Klein, Dan1    Manning, Christopher D.2
  • 18
    • 85145007596 scopus 로고
    • Statistical decision-tree models for parsing
    • David M. Magerman. 1995. Statistical decision-tree models for parsing. In ACL 33, pages 276-283.
    • (1995) ACL , vol.33 , pp. 276-283
    • Magerman, David M.1


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