• Refine your search:
  • 
    Keyword:
    
    • Computation and Language cs.CL (2)
    • FOS Computer and information sciences (2)
    • Computational Complexity cs.CC (1)
    • Machine Learning cs.LG (1)
  • 
    Creator / Publisher:
    
    • Hahn, Michael (2)
    • Baroni, Marco (1)
    • Futrell, Richard (1)
    • Jurafsky, Dan (1)
  • 
    Year
  • 
    Medium:
    
    • Online (2)
  • 
    Type
  • 
    BLLDB-Access:
    • free (2)
    • subject to license (0)

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 2 of 2 1 Sensitivity as a Complexity Measure for Sequence Classification Tasks ... Hahn, Michael; Jurafsky, Dan; Futrell, Richard. - : arXiv, 2021 BASE Show details 2 Tabula nearly rasa: Probing the Linguistic Knowledge of Character-Level Neural Language Models Trained on Unsegmented Text ... Hahn, Michael; Baroni, Marco. - : arXiv, 2019 Abstract: Recurrent neural networks (RNNs) have reached striking performance in many natural language processing tasks. This has renewed interest in whether these generic sequence processing devices are inducing genuine linguistic knowledge. Nearly all current analytical studies, however, initialize the RNNs with a vocabulary of known words, and feed them tokenized input during training. We present a multi-lingual study of the linguistic knowledge encoded in RNNs trained as character-level language models, on input data with word boundaries removed. These networks face a tougher and more cognitively realistic task, having to discover any useful linguistic unit from scratch based on input statistics. The results show that our "near tabula rasa" RNNs are mostly able to solve morphological, syntactic and semantic tasks that intuitively presuppose word-level knowledge, and indeed they learned, to some extent, to track word boundaries. Our study opens the door to speculations about the necessity of an explicit, rigid word ... : Accepted by Transactions of the Association for Computational Linguistics ... Keyword: Computation and Language cs.CL; FOS Computer and information sciences URL: https://arxiv.org/abs/1906.07285 https://dx.doi.org/10.48550/arxiv.1906.07285 BASE Hide details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 2 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0