메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1671-1676

Efficient HPSG parsing with supertagging and CFG-filtering

Author keywords

[No Author keywords available]

Indexed keywords

KEY TECHNOLOGIES; LEXICAL ENTRIES; PARSE TREES; PARSING ALGORITHM; RECENT RESEARCHES; STRUCTURAL AMBIGUITY;

EID: 84880897667     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (48)

References (17)
  • 1
    • 0003356044 scopus 로고    scopus 로고
    • Supertagging: An approach to almost parsing
    • S. Bangalore and A. K. Joshi. Supertagging: An approach to almost parsing. Computational Linguistics, 25(2):237-265, 1999.
    • (1999) Computational Linguistics , vol.25 , Issue.2 , pp. 237-265
    • Bangalore, S.1    Joshi, A.K.2
  • 2
    • 85119101586 scopus 로고    scopus 로고
    • The importance of supertagging for wide-coverage ccg parsing
    • S. Clark and J. R. Curran. The importance of supertagging for wide-coverage ccg parsing. In Proc. COLING, pages 282-288, 2004.
    • (2004) Proc. COLING , pp. 282-288
    • Clark, S.1    Curran, J.R.2
  • 3
    • 33746385477 scopus 로고    scopus 로고
    • Supertagging for combinatory categorial grammar
    • S. Clark. Supertagging for combinatory categorial grammar. In Proc. TAG+6, pages 19-24, 2002.
    • (2002) Proc. TAG+6 , pp. 19-24
    • Clark, S.1
  • 4
    • 33646057547 scopus 로고    scopus 로고
    • New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron
    • M. Collins and N. Duffy. New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In Proc. ACL, pages 263-270, 2002.
    • (2002) Proc. ACL , pp. 263-270
    • Collins, M.1    Duffy, N.2
  • 6
    • 34447286401 scopus 로고    scopus 로고
    • A context-free approximation of head-driven phrase structure grammar
    • B. Kiefer and H.-U. Krieger. A context-free approximation of head-driven phrase structure grammar. In Proc. IWPT, pages 135-146, 2000.
    • (2000) Proc. IWPT , pp. 135-146
    • Kiefer, B.1    Krieger, H.-U.2
  • 7
    • 84877788764 scopus 로고    scopus 로고
    • A* parsing: Fast exact viterbi parse selection
    • D. Klein and C. D. Manning. A* parsing: Fast exact viterbi parse selection. In Proc. HLT-NAACL, pages 40-47, 2003.
    • (2003) Proc. HLT-NAACL , pp. 40-47
    • Klein, D.1    Manning, C.D.2
  • 8
    • 34249852033 scopus 로고
    • Building a large annotated corpus of english: The Penn Treebank
    • M. P. Marcus, B. Santorini, and M. A. Marcinkiewicz. Building a large annotated corpus of english: The Penn Treebank. Computational Linguistics, 19(2):313-330, 1994.
    • (1994) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.P.1    Santorini, B.2    Marcinkiewicz, M.A.3
  • 9
    • 33750369524 scopus 로고    scopus 로고
    • Probabilistic disambiguation models for wide-coverage HPSG parsing
    • Y. Miyao and J. Tsujii. Probabilistic disambiguation models for wide-coverage HPSG parsing. In Proc. ACL, pages 83-90, 2005.
    • (2005) Proc. ACL , pp. 83-90
    • Miyao, Y.1    Tsujii, J.2
  • 10
    • 26444592920 scopus 로고    scopus 로고
    • Corpus-oriented grammar development for acquiring a head-driven phrase structure grammar from the penn treebank
    • Natural Language Processing - IJCNLP 2004: First International Joint Conference, Revised Selected Papers
    • Y. Miyao, T. Ninomiya, and J. Tsujii. Corpus-oriented grammar development for acquiring a Head-driven Phrase Structure Grammar from the Penn Treebank. In Natural Language Processing - IJCNLP 2004, volume 3248 of LNAI, pages 684-693. Springer-Verlag, 2005. (Pubitemid 41421796)
    • (2005) Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) , vol.3248 , pp. 684-693
    • Miyao, Y.1    Ninomiya, T.2    Tsujii, J.3
  • 11
  • 12
    • 85119092123 scopus 로고    scopus 로고
    • Deterministic dependency parsing of english text
    • J. Nivre and M. Scholz. Deterministic dependency parsing of english text. In Proc. COLING, pages 64-70, 2004.
    • (2004) Proc. COLING , pp. 64-70
    • Nivre, J.1    Scholz, M.2
  • 14
    • 85116932591 scopus 로고    scopus 로고
    • A classifier-based parser with linear run-time complexity
    • K. Sagae and A. Lavie. A classifier-based parser with linear run-time complexity. In Proc. IWPT, pages 125-132, 2005.
    • (2005) Proc. IWPT , pp. 125-132
    • Sagae, K.1    Lavie, A.2
  • 15
    • 85119868843 scopus 로고
    • Using restriction to extend parsing algorithms for complex-feature-based formalisms
    • S. M. Shieber. Using restriction to extend parsing algorithms for complex-feature-based formalisms. In Proc. ACL, pages 145-152, 1985.
    • (1985) Proc. ACL , pp. 145-152
    • Shieber, S.M.1
  • 17
    • 26044449174 scopus 로고    scopus 로고
    • Statistical dependency analysis with support vector machines
    • H. Yamada and Y. Matsumoto. Statistical dependency analysis with support vector machines. In Proc. IWPT, pages 195-206, 2003.
    • (2003) Proc. IWPT , pp. 195-206
    • Yamada, H.1    Matsumoto, Y.2


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