메뉴 건너뛰기




Volumn , Issue , 2005, Pages 99-106

Pseudo-projective dependency parsing

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS;

EID: 84859901922     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1219840.1219853     Document Type: Conference Paper
Times cited : (225)

References (32)
  • 1
    • 85149141656 scopus 로고    scopus 로고
    • Long-distance dependency resolution in automatically acquired wide-coverage PCFG-based LFG approximations
    • Cahill, A., Burke, M., O'Donovan, R., Van Genabith, J. and Way, A. 2004. Long-distance dependency resolution in automatically acquired wide-coverage PCFG-based LFG approximations. In Proceedings of ACL.
    • (2004) Proceedings of ACL
    • Cahill, A.1    Burke, M.2    O'donovan, R.3    Van Genabith, J.4    Way, A.5
  • 2
    • 34748848146 scopus 로고    scopus 로고
    • Using linguistic principles to recover empty categories
    • Campbell, R. 2004. Using linguistic principles to recover empty categories. In Proceedings of ACL.
    • (2004) Proceedings of ACL
    • Campbell, R.1
  • 3
  • 6
    • 84930562522 scopus 로고
    • Parsing discontinuous constituents in dependency grammar
    • Covington, M. A. 1990. Parsing discontinuous constituents in dependency grammar. Computational Linguistics, 16:234-236.
    • (1990) Computational Linguistics , vol.16 , pp. 234-236
    • Covington, M.A.1
  • 8
    • 85149132341 scopus 로고    scopus 로고
    • Deep syntactic processing by combining shallow methods
    • Dienes, P. and Dubey, A. 2003. Deep syntactic processing by combining shallow methods. In Proceedings of ACL.
    • (2003) Proceedings of ACL
    • Dienes, P.1    Dubey, A.2
  • 9
    • 18744380468 scopus 로고    scopus 로고
    • Topological dependency trees: A constraint-based account of linear precedence
    • Duchier, D. and Debusmann, R. 2001. Topological dependency trees: A constraint-based account of linear precedence. In Proceedings of ACL.
    • (2001) Proceedings of ACL
    • Duchier, D.1    Debusmann, R.2
  • 10
    • 4043070633 scopus 로고    scopus 로고
    • Three new probabilistic models for dependency parsing: An exploration
    • Eisner, J. M. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proceedings of COLING.
    • (1996) Proceedings of COLING
    • Eisner, J.M.1
  • 11
    • 26844506685 scopus 로고    scopus 로고
    • A broad-coverage parser for German based on defeasible constraints
    • Foth, K., Daum, M. and Menzel, W. 2004. A broad-coverage parser for German based on defeasible constraints. In Proceedings of KONVENS.
    • (2004) Proceedings of KONVENS
    • Foth, K.1    Daum, M.2    Menzel, W.3
  • 12
    • 33645980421 scopus 로고    scopus 로고
    • Serial combination of rules and statistics: A case study in Czech tagging
    • Hajič, J., Krbec, P., Oliva, K., Kveton, P. and Petkevic, V. 2001. Serial combination of rules and statistics: A case study in Czech tagging. In Proceedings of ACL.
    • (2001) Of ACL
    • Hajič, J.1    Krbec, P.2    Oliva, K.3    Kveton, P.4    Petkevic, V.5
  • 14
    • 20444420608 scopus 로고    scopus 로고
    • Building a syntactically annotated corpus: The Prague Dependency Treebank
    • Karolinum
    • Hajič, J. 1998. Building a syntactically annotated corpus: The Prague Dependency Treebank. In Issues of Valency and Meaning, pages 106-132. Karolinum.
    • (1998) Issues of Valency and Meaning , pp. 106-132
    • Hajič, J.1
  • 15
    • 84864083932 scopus 로고    scopus 로고
    • Dependency unification grammar
    • Walter de Gruyter
    • Hellwig, P. 2003. Dependency unification grammar. In Dependency and Valency, pages 593-635. Walter de Gruyter.
    • (2003) Dependency and Valency , pp. 593-635
    • Hellwig, P.1
  • 16
    • 84859906457 scopus 로고    scopus 로고
    • Word-order relaxations and restrictions within a dependency grammar
    • Holan, T., Kuboň, V. and Plátek, M. 2001. Word-order relaxations and restrictions within a dependency grammar. In Proceedings of IWPT.
    • (2001) Proceedings of IWPT
    • Holan, T.1    Kuboň, V.2    Plátek, M.3
  • 17
    • 84859891309 scopus 로고    scopus 로고
    • Tvorba zavislostniho syntaktickeho analyzatoru
    • Holan, T. 2004. Tvorba zavislostniho syntaktickeho analyzatoru. In Proceedings of MIS'2004.
    • (2004) Proceedings of MIS'2004
    • Holan, T.1
  • 18
    • 85010288978 scopus 로고    scopus 로고
    • Enriching the output of a parser using memory-based learning
    • Jijkoun, V. and de Rijke, M. 2004. Enriching the output of a parser using memory-based learning. In Proceedings of ACL.
    • (2004) Proceedings of ACL
    • Jijkoun, V.1    De Rijke, M.2
  • 19
    • 85149140546 scopus 로고    scopus 로고
    • A simple pattern-matching algorithm for recovering empty nodes and their antecedents
    • Johnson, M. 2002. A simple pattern-matching algorithm for recovering empty nodes and their antecedents. In Proceedings of ACL.
    • (2002) Proceedings of ACL
    • Johnson, M.1
  • 20
    • 85149149527 scopus 로고    scopus 로고
    • Pseudoprojectivity: A polynomially parsable non-projective dependency grammar
    • Kahane, S., Nasr, A. and Rambow, O. 1998. Pseudoprojectivity: A polynomially parsable non-projective dependency grammar. In Proceedings of ACL-COLING.
    • (1998) Proceedings of ACL-COLING
    • Kahane, S.1    Nasr, A.2    Rambow, O.3
  • 21
    • 50849134556 scopus 로고    scopus 로고
    • The Danish Dependency Treebank and the DTAG treebank tool
    • Kromann, M. T. 2003. The Danish Dependency Treebank and the DTAG treebank tool. In Proceedings of TLT 2003.
    • (2003) Proceedings of TLT 2003
    • Kromann, M.T.1
  • 22
    • 85149134023 scopus 로고    scopus 로고
    • Deep dependencies from context-free statistical parsers: Correcting the surface dependency approximation
    • Levy, R. and Manning, C. 2004. Deep dependencies from context-free statistical parsers: Correcting the surface dependency approximation. In Proceedings of ACL.
    • (2004) Proceedings of ACL
    • Levy, R.1    Manning, C.2
  • 24
    • 85119092123 scopus 로고    scopus 로고
    • Deterministic dependency parsing of English text
    • Nivre, J. and Scholz, M. 2004. Deterministic dependency parsing of English text. In Proceedings of COLING.
    • (2004) Proceedings of COLING
    • Nivre, J.1    Scholz, M.2
  • 26
    • 33746230843 scopus 로고    scopus 로고
    • An efficient algorithm for projective dependency parsing
    • Nivre, J. 2003. An efficient algorithm for projective dependency parsing. In Proceedings of IWPT.
    • (2003) Proceedings of IWPT
    • Nivre, J.1
  • 28
    • 4043141646 scopus 로고    scopus 로고
    • Dependency parsing with an extended finite-state approach
    • DOI 10.1162/089120103322753338
    • Oflazer, K. 2003. Dependency parsing with an extended finitestate approach. Computational Linguistics, 29:515-544. (Pubitemid 39056496)
    • (2003) Computational Linguistics , vol.29 , Issue.4 , pp. 515-544
    • Oflazer, K.1
  • 32
    • 26044449174 scopus 로고    scopus 로고
    • Statistical dependency analysis with support vector machines
    • Yamada, H. and Matsumoto, Y. 2003. Statistical dependency analysis with support vector machines. In Proceedings of IWPT.
    • (2003) Proceedings of IWPT
    • Yamada, H.1    Matsumoto, Y.2


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