메뉴 건너뛰기




Volumn , Issue , 2006, Pages 73-80

Constraints on non-projective dependency parsing

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE RUNNING TIME; DEPENDENCY GRAPHS; GRAPH-THEORETIC; NATURALLY OCCURRING; NON-PROJECTIVE DEPENDENCY PARSING; NON-PROJECTIVITY; PRAGUE DEPENDENCY TREEBANK; SEARCH SPACES;

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

References (26)
  • 1
    • 85149141656 scopus 로고    scopus 로고
    • Longdistance dependency resolution in automatically acquired wide-coverage PCFG-based LFG approximations
    • Aoife Cahill, Michael Burke, Ruth O'Donovan, Josef Van Genabith, and Andy Way. 2004. Longdistance dependency resolution in automatically acquired wide-coverage PCFG-based LFG approximations. Proceedings of ACL, pp. 320-327.
    • (2004) Proceedings of ACL , pp. 320-327
    • 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
    • Richard Campbell. 2004. Using linguistic principles to recover empty categories. Proceedings of ACL, pp. 646-653.
    • (2004) Proceedings of ACL , pp. 646-653
    • Campbell, R.1
  • 5
    • 85149132341 scopus 로고    scopus 로고
    • Deep syntactic processing by combining shallow methods
    • Péter Dienes and Amit Dubey. 2003. Deep syntactic processing by combining shallow methods. Proceedings of ACL, pp. 431-438.
    • (2003) Proceedings of ACL , pp. 431-438
    • Dienes, P.1    Dubey, A.2
  • 6
    • 0042357353 scopus 로고    scopus 로고
    • Bilexical grammars and their cubic-time parsing algorithms
    • Harry Bunt and Anton Nijholt, editors Kluwer
    • Jason M. Eisner. 2000. Bilexical grammars and their cubic-time parsing algorithms. In Harry Bunt and Anton Nijholt, editors, Advances in Probabilistic and Other Parsing Technologies, pp. 29-62. Kluwer.
    • (2000) Advances in Probabilistic and Other Parsing Technologies , pp. 29-62
    • Eisner, J.M.1
  • 7
    • 0342961532 scopus 로고
    • Dependency systems and phrase-structure systems
    • Haim Gaifman. 1965. Dependency systems and phrase-structure systems. Information and Control, 8: 304-337.
    • (1965) Information and Control , vol.8 , pp. 304-337
    • Gaifman, H.1
  • 9
    • 20444420608 scopus 로고    scopus 로고
    • Building a syntactically annotated corpus: The prague dependency treebank
    • Karolinum
    • Jan Hajič. 1998. Building a syntactically annotated corpus: The Prague Dependency Treebank. Issues of Valency and Meaning, pp. 106-132. Karolinum.
    • (1998) Issues of Valency and Meaning , pp. 106-132
    • Hajič, J.1
  • 12
    • 85010288978 scopus 로고    scopus 로고
    • Enriching the output of a parser using memory-based learning
    • Valentin Jijkoun and Maarten De Rijke. 2004. Enriching the output of a parser using memory-based learning. Proceedings of ACL, pp. 312-319.
    • (2004) Proceedings of ACL , pp. 312-319
    • Jijkoun, V.1    De Rijke, M.2
  • 13
    • 85149140546 scopus 로고    scopus 로고
    • A simple pattern-matching algorithm for recovering empty nodes and their antecedents
    • Mark Johnson. 2002. A simple pattern-matching algorithm for recovering empty nodes and their antecedents. Proceedings of ACL, pp. 136-143.
    • (2002) Proceedings of ACL , pp. 136-143
    • Johnson, M.1
  • 14
    • 85149149527 scopus 로고    scopus 로고
    • Pseudo-projectivity: A polynomially parsable non-projective dependency grammar
    • Sylvain Kahane, Alexis Nasr and Owen Rambow. Pseudo-Projectivity: A Polynomially Parsable Non-Projective Dependency Grammar. Proceedings of ACL-COLING, pp. 646-652.
    • Proceedings of ACL-COLING , pp. 646-652
    • Kahane, S.1    Nasr, A.2    Rambow, O.3
  • 15
    • 50849134556 scopus 로고    scopus 로고
    • The danish dependency treebank and the DTAG treebank tool
    • Matthias Trautner Kromann. 2003. The Danish Dependency Treebank and the DTAG treebank tool. Proceedings of TLT, pp. 217-220.
    • (2003) Proceedings of TLT , pp. 217-220
    • Kromann, M.T.1
  • 16
    • 85149134023 scopus 로고    scopus 로고
    • Deep dependencies from context-free statistical parsers: Correcting the surface dependency approximation
    • Roger Levy and Christopher Manning. 2004. Deep dependencies from context-free statistical parsers: Correcting the surface dependency approximation. Proceedings of ACL, pp. 328-335.
    • (2004) Proceedings of ACL , pp. 328-335
    • Levy, R.1    Manning, C.2
  • 17
    • 85149132266 scopus 로고
    • Structural disambiguation with constraint propagation
    • Hiroshi Maruyama. 1990. Structural disambiguation with constraint propagation. Proceedings of ACL, pp. 31-38.
    • (1990) Proceedings of ACL , pp. 31-38
    • Maruyama, H.1
  • 18
    • 84859925125 scopus 로고    scopus 로고
    • Online large-margin training of dependency parsers
    • Ryan McDonald, Koby Crammer, and Fernando Pereira. 2005a. Online large-margin training of dependency parsers. Proceedings of ACL, pp. 91-98.
    • (2005) Proceedings of ACL , pp. 91-98
    • McDonald, R.1    Crammer, K.2    Pereira, F.3
  • 19
    • 80053274459 scopus 로고    scopus 로고
    • Non-projective dependency parsing using spanning tree algorithms
    • Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajič. 2005b. Non-projective dependency parsing using spanning tree algorithms. Proceedings of HLT/EMNLP, pp. 523-530.
    • (2005) Proceedings of HLT/EMNLP , pp. 523-530
    • McDonald, R.1    Pereira, F.2    Ribarov, K.3    Hajič, J.4
  • 21
    • 85149138387 scopus 로고    scopus 로고
    • The complexity of recognition of linguistically adequate dependency grammars
    • Peter Neuhaus and Norbert Bröker. 1997. The complexity of recognition of linguistically adequate dependency grammars. Proceedings of ACL-EACL, pages 337-343.
    • (1997) Proceedings of ACL-EACL , pp. 337-343
    • Neuhaus, P.1    Bröker, N.2
  • 22
    • 84859901922 scopus 로고    scopus 로고
    • Pseudo-projective dependency parsing
    • Joakim Nivre and Jens Nilsson. 2005. Pseudo-projective dependency parsing. Proceedings ACL, pp. 99-106.
    • (2005) Proceedings ACL , pp. 99-106
    • Nivre, J.1    Nilsson, J.2
  • 24
    • 84893413119 scopus 로고    scopus 로고
    • Computing the most probably parse for a discontinuous phrase structure grammar
    • Oliver Plaehn. 2000. Computing the most probably parse for a discontinuous phrase structure grammar. Proceedings of IWPT.
    • (2000) Proceedings of IWPT
    • Plaehn, O.1
  • 26
    • 26044449174 scopus 로고    scopus 로고
    • Statistical dependency analysis with support vector machines
    • Hiroyasu Yamada and Yuji Matsumoto. 2003. Statistical dependency analysis with support vector machines. Proceedings of IWPT, pp. 195-206.
    • (2003) Proceedings of IWPT , pp. 195-206
    • Yamada, H.1    Matsumoto, Y.2


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