메뉴 건너뛰기




Volumn 2, Issue , 2010, Pages 904-912

2D trie for fast parsing

Author keywords

[No Author keywords available]

Indexed keywords

DECODING SPEED; DEPENDENCY PARSING; INDEXING STRUCTURES; MAXIMUM SPANNING TREE; STRUCTURED LEARNING; TEMPLATE BASED METHODS; TRIE STRUCTURES;

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

References (14)
  • 1
    • 0024735522 scopus 로고
    • Efficient digital search algorithm by using a double-array structure
    • DOI 10.1109/32.31365
    • Aoe, Jun'ichi. 1989. An efficient digital search algorithm by using a double-array structure. IEEE Transactions on software andengineering, 15(9):1066-1077. (Pubitemid 20607065)
    • (1989) IEEE Transactions on Software Engineering , vol.15 , Issue.9 , pp. 1066-1077
    • Aoe Jun-ichi1
  • 5
    • 80053433160 scopus 로고    scopus 로고
    • Splitsvm: Fast, space-efficient, non-heuristic, polynomial kernel computation for nlp applications
    • Columbus, Ohio, June. Association for Computational Linguistics
    • Goldberg, Yoav and Michael Elhadad. 2008. splitsvm: Fast, space-efficient, non-heuristic, polynomial kernel computation for nlp applications. In Proceedings of ACL-08: HLT, Short Papers, pages 237-240, Columbus, Ohio, June. Association for Computational Linguistics.
    • (2008) Proceedings of ACL-08: HLT, Short Papers , pp. 237-240
    • Goldberg, Y.1    Elhadad, M.2
  • 13
    • 57649121671 scopus 로고    scopus 로고
    • Adding semantic roles to the Chinese treebank
    • Palmer, Martha and Nianwen Xue. 2009. Adding semantic roles to the Chinese Treebank. Natural Language Engineering, 15(1):143-172.
    • (2009) Natural Language Engineering , vol.15 , Issue.1 , pp. 143-172
    • Palmer, M.1    Xue, N.2


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