메뉴 건너뛰기




Volumn 26, Issue 12, 2005, Pages 1896-1906

Wide coverage natural language processing using kernel methods and neural networks for structured data

Author keywords

Convolution kernels; Learning preferences; Natural language; Recursive neural networks

Indexed keywords

GRAPH THEORY; LEARNING ALGORITHMS; LOGIC PROGRAMMING; NEURAL NETWORKS; PATTERN RECOGNITION; VECTORS;

EID: 22944487701     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2005.03.011     Document Type: Conference Paper
Times cited : (11)

References (19)
  • 1
    • 0009626003 scopus 로고    scopus 로고
    • What is the minimal set of fragments that achieves maximal parse accuracy?
    • Bod, R., 2001. What is the minimal set of fragments that achieves maximal parse accuracy? In: Proceedings of ACL
    • (2001) Proceedings of ACL
    • Bod, R.1
  • 4
    • 33646057547 scopus 로고    scopus 로고
    • New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron
    • Collins, M., Duffy, N., 2002. New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In: Proc. of ACL
    • (2002) Proc. of ACL
    • Collins, M.1    Duffy, N.2
  • 6
    • 0024095495 scopus 로고
    • Cross-linguistic differences in parsing: Restrictions on the use of the late closure strategy in Spanish
    • F. Cuetos, and D. Mitchell Cross-linguistic differences in parsing: Restrictions on the use of the late closure strategy in Spanish Cognition 30 1 1988 73 105
    • (1988) Cognition , vol.30 , Issue.1 , pp. 73-105
    • Cuetos, F.1    Mitchell, D.2
  • 7
    • 0032165969 scopus 로고    scopus 로고
    • A general framework for adaptative processing of data structure
    • P. Frasconi, M. Gori, and A. Sperduti A general framework for adaptative processing of data structure IEEE Trans. Neural Networks 9 5 1998 768 786
    • (1998) IEEE Trans. Neural Networks , vol.9 , Issue.5 , pp. 768-786
    • Frasconi, P.1    Gori, M.2    Sperduti, A.3
  • 8
    • 0033281425 scopus 로고    scopus 로고
    • Large margin classification using the perceptron algorithm
    • Y. Freund, and R.E. Schapire Large margin classification using the perceptron algorithm Mach. Learn. 37 3 1999 277 296
    • (1999) Mach. Learn. , vol.37 , Issue.3 , pp. 277-296
    • Freund, Y.1    Schapire, R.E.2
  • 9
    • 0029727454 scopus 로고    scopus 로고
    • Learning task-dependent distributed structure-representations by back-propagation through structure
    • Goller, C., Kuechler, A., 1996. Learning task-dependent distributed structure-representations by back-propagation through structure. In: IEEE International Conference on Neural networks, pp. 347-352
    • (1996) IEEE International Conference on Neural Networks , pp. 347-352
    • Goller, C.1    Kuechler, A.2
  • 10
    • 0004019973 scopus 로고    scopus 로고
    • Convolution Kernels on discrete structures
    • University of California at Santa Cruz
    • Haussler, D., 1999. Convolution Kernels on Discrete Structures, Tech. Rep. UCSC-CLR-99-10, University of California at Santa Cruz
    • (1999) Tech. Rep. , vol.UCSC-CLR-99-10
    • Haussler, D.1
  • 11
    • 0008371352 scopus 로고    scopus 로고
    • Large margin rank boundaries for ordinal regression
    • A. Smola P. Bartlett B. Schölkopf D. Schuurmans MIT Press
    • R. Herbrich, T. Graepel, and K. Obermayer Large margin rank boundaries for ordinal regression A. Smola P. Bartlett B. Schölkopf D. Schuurmans Advances in Large Margin Classifiers 2000 MIT Press
    • (2000) Advances in Large Margin Classifiers
    • Herbrich, R.1    Graepel, T.2    Obermayer, K.3
  • 14
    • 0036358995 scopus 로고    scopus 로고
    • The spectrum Kernel: A string Kernel for SVM protein classification
    • C. Leslie, E. Eskin, and W.S. Noble The spectrum Kernel: A string Kernel for SVM protein classification Pacific Sympos. Biocomput. 2002 566 575
    • (2002) Pacific Sympos. Biocomput. , pp. 566-575
    • Leslie, C.1    Eskin, E.2    Noble, W.S.3
  • 16
    • 33646143462 scopus 로고    scopus 로고
    • Incrementality and lexicalism: A treebank study
    • in press Stevenson, S., Merlo, P. (Eds.) Computational Psycholingusitics Series, John Benjamins
    • Lombardo, V., Sturt, P., in press. Incrementality and lexicalism: A treebank study. In: Stevenson, S., Merlo, P. (Eds.), Lexical Representations in Sentence Processing. Computational Psycholingusitics Series, John Benjamins
    • Lexical Representations in Sentence Processing
    • Lombardo, V.1    Sturt, P.2
  • 17
    • 34249852033 scopus 로고
    • Building a large annotated corpus of English: The Penn Treebank
    • M. Marcus, B. Santorini, and M. Marcinkiewicz Building a large annotated corpus of English: The Penn Treebank Computat. Linguist. 19 1993 313 330
    • (1993) Computat. Linguist. , vol.19 , pp. 313-330
    • Marcus, M.1    Santorini, B.2    Marcinkiewicz, M.3
  • 18
    • 0000111268 scopus 로고
    • Exposure-based models of human parsing: Evidence for the use of coarse-grained (nonlexical) statistical records
    • D. Mitchell, F. Cuetos, M. Corley, and M. Brysbaert Exposure-based models of human parsing: Evidence for the use of coarse-grained (nonlexical) statistical records J. Psycholinguist. Res. 24 6 1995 469 488
    • (1995) J. Psycholinguist. Res. , vol.24 , Issue.6 , pp. 469-488
    • Mitchell, D.1    Cuetos, F.2    Corley, M.3    Brysbaert, M.4
  • 19
    • 0038392958 scopus 로고    scopus 로고
    • Learning first-pass structural attachment preferences with dynamic grammars and recursive neural networks
    • P. Sturt, F. Costa, V. Lombardo, and P. Frasconi Learning first-pass structural attachment preferences with dynamic grammars and recursive neural networks Cognition 88 2 2003 133 169
    • (2003) Cognition , vol.88 , Issue.2 , pp. 133-169
    • Sturt, P.1    Costa, F.2    Lombardo, V.3    Frasconi, P.4


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