메뉴 건너뛰기




Volumn , Issue , 2008, Pages 213-216

Unlexicalised hidden variable models of split dependency grammars

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; FORMAL LANGUAGES;

EID: 84859918636     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1557690.1557751     Document Type: Conference Paper
Times cited : (8)

References (14)
  • 1
    • 85036148712 scopus 로고    scopus 로고
    • A maximum-entropy-inspired parser
    • Eugene Charniak. 2000. A maximum-entropy-inspired parser. In NAACL'00.
    • (2000) NAACL'00
    • Charniak, E.1
  • 3
    • 85116870770 scopus 로고    scopus 로고
    • Parsing with soft and hard constraints on dependency length
    • Jason Eisner and Noah A. Smith. 2005. Parsing with soft and hard constraints on dependency length. In IWPT'05.
    • (2005) IWPT'05
    • Eisner, J.1    Smith, N.A.2
  • 4
    • 0042357353 scopus 로고    scopus 로고
    • Bilexical grammars and their cubic-time parsing algorithms
    • H.Bunt and A. Nijholt, eds., Kluwer Academic Publishers
    • Jason Eisner. 2000. Bilexical grammars and their cubic-time parsing algorithms. In H.Bunt and A. Nijholt, eds., Advances in Probabilistic and Other Parsing Technologies, pages 29-62. Kluwer Academic Publishers.
    • (2000) Advances in Probabilistic and Other Parsing Technologies , pp. 29-62
    • Eisner, J.1
  • 5
    • 85118708235 scopus 로고    scopus 로고
    • Inducing history representations for broad-coverage statistical parsing
    • Jamie Henderson. 2003. Inducing history representations for broad-coverage statistical parsing. In NAACL-HLT'03.
    • (2003) NAACL-HLT'03
    • Henderson, J.1
  • 6
    • 84860503337 scopus 로고    scopus 로고
    • Transforming projective bilexical dependency grammars into efficiently-parsable cfgs with unfold-fold
    • Mark Johnson. 2007. Transforming projective bilexical dependency grammars into efficiently-parsable cfgs with unfold-fold. In ACL'06.
    • (2007) ACL'06
    • Johnson, M.1
  • 7
    • 85146417759 scopus 로고    scopus 로고
    • Accurate unlexicalized parsing
    • Dan Klein and Christopher D. Manning. 2003. Accurate unlexicalized parsing. In ACL'03.
    • (2003) ACL'03
    • Klein, D.1    Manning, C.D.2
  • 8
    • 84859896044 scopus 로고    scopus 로고
    • Probabilistic CFG with latent annotations
    • Takuya Matsuzaki, Yusuke Miyao, and Junichi Tsujii. 2005. Probabilistic CFG with latent annotations. In ACL'05.
    • (2005) ACL'05
    • Matsuzaki, T.1    Miyao, Y.2    Tsujii, J.3
  • 11
    • 85059598488 scopus 로고
    • Inside-outside reestimation form partially bracketed corpora
    • Fernando Pereira and Yves Schabes. 1992. Inside-outside reestimation form partially bracketed corpora. In ACL'92.
    • (1992) ACL'92
    • Pereira, F.1    Schabes, Y.2
  • 12
    • 36348934026 scopus 로고    scopus 로고
    • Learning accurate, compact, and interpretable tree annotation
    • Slav Petrov, Leon Barrett Romain Thibaux, and Dan Klein. 2006. Learning accurate, compact, and interpretable tree annotation. In ACL'06.
    • (2006) ACL'06
    • Petrov, S.1    Thibaux, L.B.R.2    Klein, D.3
  • 13
    • 84859885827 scopus 로고    scopus 로고
    • Head-driven PCFGs with latent-head statistics
    • Detlef Prescher. 2005. Head-driven PCFGs with latent-head statistics. In IWPT'05.
    • (2005) IWPT'05
    • Prescher, D.1
  • 14
    • 26044449174 scopus 로고    scopus 로고
    • Statistical dependency analysis with support vectore machines
    • H. Yamada and Y. Matsumoto. 2003. Statistical dependency analysis with support vectore machines. In IWPT'03.
    • (2003) IWPT'03
    • Yamada, H.1    Matsumoto, Y.2


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