메뉴 건너뛰기




Volumn , Issue , 2010, Pages 674-683

Top-down nearly-context-sensitive parsing

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE; DYNAMIC PROGRAMMING ALGORITHM; ERROR REDUCTION; EXPERIMENTAL EVIDENCE; FEATURE SETS; PARSE TREES; STATISTICAL PARSER; SYNTACTIC PARSERS; SYNTACTIC TREES; TOPDOWN;

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

References (21)
  • 1
    • 0040402555 scopus 로고
    • Memory requirements and local ambiguities of parsing strategies
    • Stephen Abney and Mark Johnson. 1991. Memory requirements and local ambiguities of parsing strategies. Journal of Psycholinguistic Research, 20(3):233-250.
    • (1991) Journal of Psycholinguistic Research , vol.20 , Issue.3 , pp. 233-250
    • Abney, S.1    Johnson, M.2
  • 2
    • 0001492549 scopus 로고    scopus 로고
    • Shape Quantization and Recognition with Randomized Trees
    • Y. Amit and D. Geman. 1997. Shape quantization and recognition with randomized trees. Neural Computation, 9:1545-1588. (Pubitemid 127462804)
    • (1997) Neural Computation , vol.9 , Issue.7 , pp. 1545-1588
    • Amit, Y.1    Geman, D.2
  • 4
    • 0035478854 scopus 로고    scopus 로고
    • Random forests
    • Leo Breiman. 2004. Random forests. Machine Learning, 45(1):5-32.
    • (2004) Machine Learning , vol.45 , Issue.1 , pp. 5-32
    • Leo, B.1
  • 5
    • 84859885240 scopus 로고    scopus 로고
    • Coarse-to-fine n-best parsing and MaxEnt discriminative reranking
    • Ann Arbor, Michigan, June. Association for Computational Linguistics
    • Eugene Charniak and Mark Johnson. 2005. Coarse-to-fine n-best parsing and MaxEnt discriminative reranking. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics, pages 173-180, Ann Arbor, Michigan, June. Association for Computational Linguistics.
    • (2005) Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics , pp. 173-180
    • Eugene, C.1    Johnson, M.2
  • 7
    • 85024115120 scopus 로고    scopus 로고
    • An empirical study of smoothing techniques for language modeling
    • Arivind Joshi and Martha Palmer, editors San Francisco. Morgan Kaufmann Publishers
    • Stanley F. Chen and Joshua Goodman. 1996. An empirical study of smoothing techniques for language modeling. In Arivind Joshi and Martha Palmer, editors, Proceedings of the Thirty-Fourth Annual Meeting of the Association for Computational Linguistics, pages 310-318, San Francisco. Morgan Kaufmann Publishers.
    • (1996) Proceedings of the Thirty-fourth Annual Meeting of the Association for Computational Linguistics , pp. 310-318
    • Chen, S.F.1    Goodman, J.2
  • 9
    • 4043082208 scopus 로고    scopus 로고
    • Head-driven statistical models for natural language parsing
    • Michael Collins. 2003. Head-driven statistical models for natural language parsing. Computational Linguistics, 29(4):589-638.
    • (2003) Computational Linguistics , vol.29 , Issue.4 , pp. 589-638
    • Collins, M.1
  • 11
    • 0002076709 scopus 로고
    • An efficient contex-free parsing algorithm
    • Jay Earley. 1970. An efficient contex-free parsing algorithm. Communications of the ACM, 6(8):451-445.
    • (1970) Communications of the ACM , vol.6 , Issue.8 , pp. 451-445
    • Earley, J.1
  • 13
    • 85118708235 scopus 로고    scopus 로고
    • Inducing history representations for broad coverage statistical parsing
    • James Henderson. 2003. Inducing history representations for broad coverage statistical parsing. In Proceedings of HLT-NAACL 2003.
    • (2003) Proceedings of HLT-NAACL 2003
    • Henderson, J.1
  • 14
    • 27744504475 scopus 로고    scopus 로고
    • Compact non-left-recursive grammars using the selective left-corner transform and factoring
    • Mark Johnson and Brian Roark. 2000. Compact non-left-recursive grammars using the selective left-corner transform and factoring. In Proceedings of COLING-2000.
    • (2000) Proceedings of COLING-2000
    • Johnson, M.1    Roark, B.2
  • 16
    • 34249852033 scopus 로고
    • Building a large annotated corpus of english: The penn treebank
    • Michell P. Marcus, Beatrice Santorini, and Mary Ann 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
  • 19
    • 0041079041 scopus 로고    scopus 로고
    • Probabilistic top-down parsing and language modeling
    • DOI 10.1162/089120101750300526
    • Brian Roark. 2001. Probabilistic top-down parsing and language modeling. Computational Linguistics, 27(2):249-276. (Pubitemid 33597448)
    • (2001) Computational Linguistics , vol.27 , Issue.2 , pp. 249-276
    • Roark, B.1


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