메뉴 건너뛰기




Volumn 71, Issue 16-18, 2008, Pages 3150-3157

Modeling word perception using the Elman network

Author keywords

Authorship; Categorization; Compositional representation; Content addressable memory; Elman network; Linguistic analysis; Personalized code; Polysemous word; Semantic search; Stylistic similarity; Word perception

Indexed keywords

DATA STORAGE EQUIPMENT; INFORMATION THEORY; LINGUISTICS; SEMANTICS; VECTORS;

EID: 56549089658     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2008.04.030     Document Type: Conference Paper
Times cited : (145)

References (26)
  • 2
    • 0142094815 scopus 로고    scopus 로고
    • Questions of authorship: Attribution and beyond, a lecture delivered on the occasion of the Roberto Busa Award, ACH-ALLC 2001, New York
    • J. Burrows Questions of authorship: attribution and beyond, A lecture delivered on the occasion of the Roberto Busa Award, ACH-ALLC 2001, New York Comput. Humanit. 37 2003 5 32
    • (2003) Comput. Humanit. , vol.37 , pp. 5-32
    • Burrows, J.1
  • 6
    • 0001918328 scopus 로고
    • Stemming algorithms
    • W.B. Frakes B.-Y. Ricardo Prentice-Hall Englewood Cliffs, NJ
    • W.B. Frakes Stemming algorithms W.B. Frakes B.-Y. Ricardo Information Retrieval: Data Structures and Algorithms 1992 Prentice-Hall Englewood Cliffs, NJ 131 160
    • (1992) Information Retrieval: Data Structures and Algorithms , pp. 131-160
    • Frakes, W.B.1
  • 7
    • 84967627259 scopus 로고    scopus 로고
    • The evolution of stylometry in humanities scholarship
    • D.I. Holmes The evolution of stylometry in humanities scholarship Lit. Linguist. Comput. 13 1998 111 117
    • (1998) Lit. Linguist. Comput. , vol.13 , pp. 111-117
    • Holmes, D.I.1
  • 8
    • 84938015047 scopus 로고
    • A method for the construction of minimum-redundancy codes
    • D.A. Huffman A method for the construction of minimum-redundancy codes Proc. Inst. Radio Eng. 40 1952 1098 1102
    • (1952) Proc. Inst. Radio Eng. , vol.40 , pp. 1098-1102
    • Huffman, D.A.1
  • 11
    • 0033592606 scopus 로고    scopus 로고
    • Learning the parts of objects by non-negative matrix factorization
    • D.D. Lee, and H.S. Seung Learning the parts of objects by non-negative matrix factorization Nature 401 1999 788 791
    • (1999) Nature , vol.401 , pp. 788-791
    • Lee, D.D.1    Seung, H.S.2
  • 12
    • 33749868445 scopus 로고    scopus 로고
    • Backbone structure of hairy memory
    • Springer, Berlin The 16th International Conference on Artificial Neural Networks, ICANN
    • C.-Y. Liou, Backbone structure of hairy memory, in: The 16th International Conference on Artificial Neural Networks, ICANN, Lecture Notes in Computer Science, Springer, Berlin, vol. 4131, Part I, 2006, pp. 688-697.
    • (2006) Lecture Notes in Computer Science , vol.4131 , Issue.PART I , pp. 688-697
    • Liou, C.-Y.1
  • 14
    • 22144480950 scopus 로고    scopus 로고
    • Geometrical perspective on learning behavior
    • C.-Y. Liou, J.-C. Huang, and Y.-T. Kuo Geometrical perspective on learning behavior J. Inf. Sci. Eng. 21 2005 721 732
    • (2005) J. Inf. Sci. Eng. , vol.21 , pp. 721-732
    • Liou, C.-Y.1    Huang, J.-C.2    Kuo, Y.-T.3
  • 16
    • 31144474148 scopus 로고    scopus 로고
    • Finite memory loading in hairy neurons
    • C.-Y. Liou, and S.-L. Lin Finite memory loading in hairy neurons Natural Comput. 5 2006 15 42
    • (2006) Natural Comput. , vol.5 , pp. 15-42
    • Liou, C.-Y.1    Lin, S.-L.2
  • 18
    • 0033210247 scopus 로고    scopus 로고
    • Error tolerant associative memory
    • C.-Y. Liou, and S.-K. Yuan Error tolerant associative memory Biol. Cybern. 81 1999 331 342
    • (1999) Biol. Cybern. , vol.81 , pp. 331-342
    • Liou, C.-Y.1    Yuan, S.-K.2
  • 19
    • 33750579383 scopus 로고    scopus 로고
    • Authorship identification and computational stylometry
    • Marcel Dekker New York
    • T. McEnery, and M. Oakes Authorship identification and computational stylometry Handbook of Natural Language Processing 2000 Marcel Dekker New York 545 562
    • (2000) Handbook of Natural Language Processing , pp. 545-562
    • McEnery, T.1    Oakes, M.2
  • 20
    • 84948481845 scopus 로고
    • An algorithm for suffix stripping
    • M.F. Porter An algorithm for suffix stripping Program 14 1980 130 137
    • (1980) Program , vol.14 , pp. 130-137
    • Porter, M.F.1
  • 22
    • 0023375195 scopus 로고
    • The neighbor-joining method: A new method for reconstructing phylogenetic trees
    • N. Saitou, and M. Nei The neighbor-joining method: a new method for reconstructing phylogenetic trees Mol. Biol. Evol. 4 1987 406 425
    • (1987) Mol. Biol. Evol. , vol.4 , pp. 406-425
    • Saitou, N.1    Nei, M.2
  • 23
    • 0013132586 scopus 로고    scopus 로고
    • How variable may a constant be measures of lexical richness in perspective?
    • F.J. Tweedie, and R.H. Baayen How variable may a constant be measures of lexical richness in perspective? Comput. Humanit. 32 1998 323 352
    • (1998) Comput. Humanit. , vol.32 , pp. 323-352
    • Tweedie, F.J.1    Baayen, R.H.2
  • 24
    • 0016606093 scopus 로고
    • Mendenhall's studies of word-length distribution in the works of Shakespeare and Bacon
    • C.B. William Mendenhall's studies of word-length distribution in the works of Shakespeare and Bacon Biometrika 62 1975 207 212
    • (1975) Biometrika , vol.62 , pp. 207-212
    • William, C.B.1


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