메뉴 건너뛰기




Volumn , Issue , 2003, Pages

Fast exact inference with a factored model for natural language parsing

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; TREES (MATHEMATICS);

EID: 84898970714     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (427)

References (18)
  • 1
    • 85055298846 scopus 로고
    • Structural ambiguity and lexical relations
    • D. Hindle and M. Rooth. Structural ambiguity and lexical relations. Computational Linguistics, 19(1): 103-120, 1993.
    • (1993) Computational Linguistics , vol.19 , Issue.1 , pp. 103-120
    • Hindle, D.1    Rooth, M.2
  • 3
    • 85036148712 scopus 로고    scopus 로고
    • A maximum-entropy-inspired parser
    • E. Charniak. A maximum-entropy-inspired parser. NAACL 1, pp. 132-139, 2000.
    • (2000) NAACL , vol.1 , pp. 132-139
    • Charniak, E.1
  • 4
    • 0009626003 scopus 로고    scopus 로고
    • What is the minimal set of fragments that achieves maximal parse accuracy?
    • R. Bod. What is the minimal set of fragments that achieves maximal parse accuracy? ACL 39, pp. 66-73, 2001.
    • (2001) ACL 39 , pp. 66-73
    • Bod, R.1
  • 6
    • 0008602090 scopus 로고    scopus 로고
    • Training products of experts by minimizing contrastive divergence
    • University College London
    • G. E. Hinton. Training products of experts by minimizing contrastive divergence. Technical Report GCNU TR 2000-004, GCNU, University College London, 2000.
    • (2000) Technical Report GCNU TR 2000-004, GCNU
    • Hinton, G.E.1
  • 8
    • 0005921873 scopus 로고    scopus 로고
    • PCFG models of linguistic tree representations
    • M. Johnson. PCFG models of linguistic tree representations. Computational Linguistics, 24(4): 613-632, 1998.
    • (1998) Computational Linguistics , vol.24 , Issue.4 , pp. 613-632
    • Johnson, M.1
  • 9
    • 85149142007 scopus 로고    scopus 로고
    • Em cient parsing for bilexical context-free grammars and head-automaton grammars
    • J. Eisner and G. Satta. Em cient parsing for bilexical context-free grammars and head-automaton grammars. ACL 37, pp. 457-464, 1999.
    • (1999) ACL 37 , pp. 457-464
    • Eisner, J.1    Satta, G.2
  • 10
    • 0043094969 scopus 로고    scopus 로고
    • Parsing with treebank grammars: Empirical bounds, theoretical models, and the structure of the penn treebank
    • D. Klein and C. D. Manning. Parsing with treebank grammars: Empirical bounds, theoretical models, and the structure of the Penn treebank. ACL 39/EACL 10, pp. 330-337, 2001.
    • (2001) ACL 39/EACL 10 , pp. 330-337
    • Klein, D.1    Manning, C.D.2
  • 15
    • 85145007596 scopus 로고
    • Statistical decision-tree models for parsing
    • D. M. Magerman. Statistical decision-tree models for parsing. ACL 33, pp. 276-283, 1995.
    • (1995) ACL 33 , pp. 276-283
    • Magerman, D.M.1
  • 16
    • 84941301490 scopus 로고    scopus 로고
    • A new statistical parser based on bigram lexical dependencies
    • M. J. Collins. A new statistical parser based on bigram lexical dependencies. ACL 34, pp. 184-191, 1996.
    • (1996) ACL 34 , pp. 184-191
    • Collins, M.J.1
  • 17
    • 26444551655 scopus 로고    scopus 로고
    • Discriminative reranking for natural language parsing
    • M. Collins. Discriminative reranking for natural language parsing. ICML 17, pp. 175-182, 2000.
    • (2000) ICML 17 , pp. 175-182
    • Collins, M.1
  • 18
    • 85149112297 scopus 로고    scopus 로고
    • Parsing algorithms and metrics
    • J. Goodman. Parsing algorithms and metrics. ACL 34, pp. 177-183, 1996.
    • (1996) ACL 34 , pp. 177-183
    • Goodman, J.1


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