메뉴 건너뛰기




Volumn , Issue , 2011, Pages 175-185

Efficient parallel CKY parsing on GPUs

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; DYNAMIC PROGRAMMING; GRAPHICS PROCESSING UNIT; NATURAL LANGUAGE PROCESSING SYSTEMS; SYNTACTICS;

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

References (28)
  • 2
    • 84896966941 scopus 로고    scopus 로고
    • Accelerating the CKY parsing using FPGAs
    • J. Bordim, Y. Ito, and K. Nakano. 2002. Accelerating the CKY parsing using FPGAs. In ICHPC’02.
    • (2002) ICHPC’02
    • Bordim, J.1    Ito, Y.2    Nakano, K.3
  • 3
    • 80053251519 scopus 로고    scopus 로고
    • TAG, dynamic programming, and the perceptron for efficient, feature-rich parsing
    • X. Carreras, M. Collins, and T. Koo. 2008. TAG, dynamic programming, and the perceptron for efficient, feature-rich parsing. In CoNLL’08.
    • (2008) CoNLL’08
    • Carreras, X.1    Collins, M.2    Koo, T.3
  • 4
    • 84859885240 scopus 로고    scopus 로고
    • Coarse-to-Fine N-Best Parsing and MaxEnt Discriminative Reranking
    • E. Charniak and M. Johnson. 2005. Coarse-to-Fine N-Best Parsing and MaxEnt Discriminative Reranking. In ACL’05.
    • (2005) ACL’05
    • Charniak, E.1    Johnson, M.2
  • 5
    • 85036148712 scopus 로고    scopus 로고
    • A maximum–entropy–inspired parser
    • E. Charniak. 2000. A maximum–entropy–inspired parser. In NAACL’00.
    • (2000) NAACL’00
    • Charniak, E.1
  • 8
    • 84896960491 scopus 로고    scopus 로고
    • Efficient matrix-encoded grammars and low latency parallelization strategies for CYK
    • A. Dunlop, N. Bodenstab, and B. Roark. 2011. Efficient matrix-encoded grammars and low latency parallelization strategies for CYK. In IWPT’11.
    • (2011) IWPT’11
    • Dunlop, A.1    Bodenstab, N.2    Roark, B.3
  • 9
    • 72449211489 scopus 로고    scopus 로고
    • Efficient, feature-based, conditional random field parsing
    • J. Finkel, A. Kleeman, and C. D. Manning. 2008. Efficient, feature-based, conditional random field parsing. In ACL/HLT’08.
    • (2008) ACL/HLT’08
    • Finkel, J.1    Kleeman, A.2    Manning, C. D.3
  • 10
    • 84911292967 scopus 로고
    • A parallel parser for spoken natural language
    • E. P. Giachin and C. Rullent. 1989. A parallel parser for spoken natural language. In IJCAL’89.
    • (1989) IJCAL’89
    • Giachin, E. P.1    Rullent, C.2
  • 11
    • 0040215413 scopus 로고    scopus 로고
    • Global thresholding and multiple-pass parsing
    • J. Goodman. 1997. Global thresholding and multiple-pass parsing. In EMNLP’97.
    • (1997) EMNLP’97
    • Goodman, J.1
  • 15
    • 84877788764 scopus 로고    scopus 로고
    • A* parsing: Fast exact viterbi parse selection
    • D. Klein and C. Manning. 2003. A* parsing: Fast exact viterbi parse selection. In NAACL’03.
    • (2003) NAACL’03
    • Klein, D.1    Manning, C.2
  • 16
    • 44849137198 scopus 로고    scopus 로고
    • Nvidia tesla: A unified graphics and computing architecture
    • E. Lindholm, J. Nickolls, S. Oberman, and J. Montrym. 2008. Nvidia tesla: A unified graphics and computing architecture. IEEE Micro, 28(2):39–55.
    • (2008) IEEE Micro , vol.28 , Issue.2 , pp. 39-55
    • Lindholm, E.1    Nickolls, J.2    Oberman, S.3    Montrym, J.4
  • 19
    • 78651550268 scopus 로고    scopus 로고
    • Scalable parallel programming with CUDA
    • J. Nickolls, I. Buck, M. Garland, and K. Skadron. 2008. Scalable parallel programming with CUDA. ACM Queue, 6(2):40–53.
    • (2008) ACM Queue , vol.6 , Issue.2 , pp. 40-53
    • Nickolls, J.1    Buck, I.2    Garland, M.3    Skadron, K.4
  • 20
    • 1642298152 scopus 로고    scopus 로고
    • A parallel cky parsing algorithm on large–scale distributed–memory parallel machines
    • T. Ninomiya, K. Torisawa, K. Taura, and J. Tsujii. 1997. A parallel cky parsing algorithm on large–scale distributed–memory parallel machines. In PA-CLING’97.
    • (1997) PA-CLING’97
    • Ninomiya, T.1    Torisawa, K.2    Taura, K.3    Tsujii, J.4
  • 22
    • 84858385794 scopus 로고    scopus 로고
    • Hierarchical search for parsing
    • A. Pauls and D. Klein. 2009. Hierarchical search for parsing. In NAACL-HLT’09.
    • (2009) NAACL-HLT’09
    • Pauls, A.1    Klein, D.2
  • 23
    • 80053422456 scopus 로고    scopus 로고
    • Discriminative log-linear grammars with latent variables
    • S. Petrov and D. Klein. 2007a. Discriminative log-linear grammars with latent variables. In NIPS’07.
    • (2007) NIPS’07
    • Petrov, S.1    Klein, D.2
  • 24
    • 84858380058 scopus 로고    scopus 로고
    • Improved inference for unlexicalized parsing
    • S. Petrov and D. Klein. 2007b. Improved inference for unlexicalized parsing. In NAACL’07.
    • (2007) NAACL’07
    • Petrov, S.1    Klein, D.2
  • 25
    • 36348934026 scopus 로고    scopus 로고
    • Learning accurate, compact, and interpretable tree annotation
    • S. Petrov, L. Barrett, R. Thibaux, and D. Klein. 2006. Learning accurate, compact, and interpretable tree annotation. In ACL’06.
    • (2006) ACL’06
    • Petrov, S.1    Barrett, L.2    Thibaux, R.3    Klein, D.4
  • 26
    • 84897012779 scopus 로고    scopus 로고
    • Natural language processing: A case study
    • E. Pontelli, G. Gupta, J. Wiebe, and D. Farwell. 1998. Natural language processing: A case study. In AAAI ’98.
    • (1998) AAAI , vol.98
    • Pontelli, E.1    Gupta, G.2    Wiebe, J.3    Farwell, D.4
  • 27
    • 84949529545 scopus 로고    scopus 로고
    • Parallel processing of natural language parsers
    • M. P. van Lohuizen. 1999. Parallel processing of natural language parsers. In ParCo’99, pages 17–20.
    • (1999) ParCo’99 , pp. 17-20
    • van Lohuizen, M. P.1
  • 28
    • 49949139581 scopus 로고
    • Recognition and parsing of context-free languages in time n3
    • D.H. Younger. 1967. Recognition and parsing of context-free languages in time n3. Information and Control, 10.
    • (1967) Information and Control , vol.10
    • Younger, D.H.1


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