메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 177-184

Trace prediction and recovery with unlexicalized PCFGs and slash features

Author keywords

[No Author keywords available]

Indexed keywords

FILLERS; FORESTRY;

EID: 65349129515     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1220175.1220198     Document Type: Conference Paper
Times cited : (36)

References (11)
  • 1
    • 34748848146 scopus 로고    scopus 로고
    • Using linguistic principles to recover empty categories
    • Barcelona, Spain
    • Richard Campbell. 2004. Using linguistic principles to recover empty categories. In Proceedings of the 42nd Annual Meeting of the ACL, pages 645-652, Barcelona, Spain.
    • (2004) Proceedings of the 42nd Annual Meeting of the ACL , pp. 645-652
    • Campbell, R.1
  • 3
    • 85118152899 scopus 로고    scopus 로고
    • Three generative, lexicalised models for statistical parsing
    • Madrid, Spain
    • Michael Collins. 1997. Three generative, lexicalised models for statistical parsing. In Proceedings of the 35th Annual Meeting of the ACL, Madrid, Spain.
    • (1997) Proceedings of the 35th Annual Meeting of the ACL
    • Collins, M.1
  • 5
    • 85149132341 scopus 로고    scopus 로고
    • Deep syntactic processing by combining shallow methods
    • Sapporo, Japan
    • Péter Dienes and Amit Dubey. 2003b. Deep syntactic processing by combining shallow methods. In Proceedings of the 41st Annual Meeting of the ACL, pages 431-438, Sapporo, Japan.
    • (2003) Proceedings of the 41st Annual Meeting of the ACL , pp. 431-438
    • Dienes, P.1    Dubey, A.2
  • 6
    • 0005921873 scopus 로고    scopus 로고
    • PCFG models of linguistic tree representations
    • Mark Johnson. 1998. PCFG models of linguistic tree representations. Computational Linguistics, 24(4):613-632.
    • (1998) Computational Linguistics , vol.24 , Issue.4 , pp. 613-632
    • Johnson, M.1
  • 7
    • 85149140546 scopus 로고    scopus 로고
    • A simple pattern-matching algorithm for recovering empty nodes and their antecedents
    • Toulouse, France
    • Mark Johnson. 2001. A simple pattern-matching algorithm for recovering empty nodes and their antecedents. In Proceedings of the 39th Annual Meeting of the ACL, pages 136-143, Toulouse, France.
    • (2001) Proceedings of the 39th Annual Meeting of the ACL , pp. 136-143
    • Johnson, M.1
  • 9
    • 85149134023 scopus 로고    scopus 로고
    • Deep dependencies from context-free statistical parsers: Correcting the surface dependency approximation
    • Barcelona, Spain
    • Roger Levy and Christopher D. Manning. 2004. Deep dependencies from context-free statistical parsers: Correcting the surface dependency approximation. In Proceedings of the 42nd Annual Meeting of the ACL, pages 327-334, Barcelona, Spain.
    • (2004) Proceedings of the 42nd Annual Meeting of the ACL , pp. 327-334
    • Levy, R.1    Manning, C.D.2
  • 10
    • 34249852033 scopus 로고
    • Building a large annotated corpus of English: The Penn Treebank
    • June
    • Mitchell 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, June.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.P.1    Santorini, B.2    Marcinkiewicz, M.A.3


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