The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Colorless Green Recurrent Networks Dream Hierarchically
Open accessAbstract
Kristina Gulordava, Piotr Bojanowski, Edouard Grave, Tal Linzen, Marco Baroni. Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers). 2018.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Elman, J. L. (1990) · Cognitive Science · doi:10.1207/s15516709cog1402_1 · Cited by 11,212
Recurrent neural network based language model
Mikolov, T., Karafiát, M., Burget, L., Černocký, J., & Khudanpur, S. (2010) · Interspeech 2010 · doi:10.21437/interspeech.2010-343 · Cited by 5,390 · cited 1×
“More recently, RNNs have achieved impressive results in large-scale tasks such as language modeling for speech recognition and machine translation, and are by now standard tools for sequential natural language tasks (e.g., Mikolov et al., 2010; Graves, 2012; Wu et al., 2016).”
BackgroundSupervised Sequence Labelling with Recurrent Neural Networks
Graves, A. (2012) · Studies in Computational Intelligence · doi:10.1007/978-3-642-24797-2 · Cited by 3,120
Linguistic Regularities in Continuous Space Word Representations
Mikolov, T., Yih, W.-T., & Zweig, G. (2013) · North American Chapter of the Association for Computational Linguistics · Cited by 2,912
Learning and development in neural networks: the importance of starting small
Elman, J. L. (1993) · Cognition · doi:10.1016/0010-0277(93)90058-4 · Cited by 1,988 · cited 1×
“Early work showed that RNNs can, to a certain degree, handle data generated by context-free and even context-sensitive grammars (e.g., Elman, 1991, 1993; Rohde and Plaut, 1997; Christiansen and Chater, 1999; Gers and Schmidhuber, 2001; Cartling, 2008).”
BackgroundImproved backing-off for M-gram language modeling
Kneser, R., & Ney, H. (2002) · 1995 International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1995.479394 · Cited by 1,473
Distributed representations, simple recurrent networks, and grammatical structure
Elman, J. L. (1991) · Machine Learning · doi:10.1007/bf00114844 · Cited by 1,354
KenLM: Faster and Smaller Language Model Queries
Heafield, K. (2011) · Cited by 1,145
Universal Dependencies v1: A Multilingual Treebank Collection
Nivre, J., de Marneffe, M.-C., Ginter, F., Goldberg, Y., Hajič, J., Manning, C. D., McDonald, R., Petrov, S., Pyysalo, S., Silveira, N., et al. (2016) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/2hnj7od8afy8 · Cited by 1,028
Improvements in Part-of-Speech Tagging with an Application to German
Schmid, H. (1999) · Text, Speech and Language Technology · doi:10.1007/978-94-017-2390-9_2 · Cited by 819
Assessing the Ability of LSTMs to Learn Syntax-Sensitive Dependencies
Linzen, T., Dupoux, E., & Goldberg, Y. (2016) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00115 · Cited by 737
Self-citationLSTM recurrent networks learn simple context-free and context-sensitive languages
Gers, F. A., & Schmidhuber, E. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.963769 · Cited by 722
Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations
Kiperwasser, E., & Goldberg, Y. (2016) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00101 · Cited by 615
Friederici, A. D., Meyer, M., & von Cramon, D. Y. (2000) · Brain and Language · doi:10.1006/brln.2000.2313 · Cited by 573
Toward a connectionist model of recursion in human linguistic performance
Christiansen, M. (1999) · Cognitive Science · doi:10.1016/s0364-0213(99)00003-8 · Cited by 406
Syntax and the Brain: Disentangling Grammar by Selective Anomalies
Moro, A., Tettamanti, M., Perani, D., Donati, C., Cappa, S. F., & Fazio, F. (2001) · NeuroImage · doi:10.1006/nimg.2000.0668 · Cited by 390
IRSTLM: an open source toolkit for handling large scale language models
Federico, M., Bertoldi, N., & Cettolo, M. (2008) · Interspeech 2008 · doi:10.21437/interspeech.2008-271 · Cited by 321
What do Neural Machine Translation Models Learn about Morphology?
Belinkov, Y., Durrani, N., Dalvi, F., Sajjad, H., & Glass, J. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1080 · Cited by 307
Does String-Based Neural MT Learn Source Syntax?
Shi, X., Padhi, I., & Knight, K. (2016) · Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d16-1159 · Cited by 300
Structures, Not Strings: Linguistics as Part of the Cognitive Sciences
Everaert, M. B. H., Huybregts, M. A. C., Chomsky, N., Berwick, R. C., & Bolhuis, J. J. (2015) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2015.09.008 · Cited by 245
Fine-grained Analysis of Sentence Embeddings Using Auxiliary Prediction Tasks
Adi, Y. (2024) · arXiv (Cornell University) · doi:10.57702/tcr06vve · Cited by 212
Formal grammar and information theory: together again?
Pereira, F. M. B. (2000) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2000.0583 · Cited by 110
Dependency Parsing as Head Selection
Zhang, X., Cheng, J., & Lapata, M. (2017) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.18653/v1/e17-1063 · Cited by 108
Johnson, M. A., & Goldberg, A. E. (2012) · Language and Cognitive Processes · doi:10.1080/01690965.2012.717632 · Cited by 101
Incremental Parsing with Minimal Features Using Bi-Directional LSTM
Cross, J., & Huang, L. (2016) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/p16-2006 · Cited by 81
N-gram Language Modeling using Recurrent Neural Network EstimationPreprint
Chelba, C. I., Norouzi, M., & Bengio, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.10724 · Cited by 57
Using Deep Neural Networks to Learn Syntactic Agreement
Bernardy, J.-P., & Lappin, S. (2017) · Linguistic Issues in Language Technology · doi:10.33011/lilt.v15i.1413 · Cited by 45
Simple Recurrent Networks and Natural Language: How Important is Starting Small?
Rohde, D. L. T., & Plaut, D. C. (1997) · Cited by 10
Exploring the Syntactic Abilities of RNNs with Multi-task LearningPreprint
Enguehard, É., Goldberg, Y., & Linzen, T. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.03542 · Cited by 10
Self-citation
Cited by
Universal Language Model Fine-tuning for Text Classification
Howard, J., & Ruder, S. (2018) · Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p18-1031 · Cited by 4,100
“, 2016), hierarchical relations (Gulordava et al., 2018), and sentiment (Radford et al.”
BackgroundRecent Advances in Natural Language Processing via Large Pre-trained Language Models: A Survey
Min, B., Ross, H., Sulem, E., Veyseh, A. P. B., Nguyen, T. H., Sainz, O., Agirre, E., Heintz, I., & Roth, D. (2024) · ACM Computing Surveys · doi:10.1145/3605943 · Cited by 1,387
What Does BERT Look at? An Analysis of BERT’s Attention
Clark, K., Khandelwal, U., Levy, O., & Manning, C. D. (2019) · Proceedings of the 2019 ACL Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP · doi:10.18653/v1/w19-4828 · Cited by 1,373
Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Pruned
Voita, E., Talbot, D., Moiseev, F., Sennrich, R., & Titov, I. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1580 · Cited by 1,146
Right for the Wrong Reasons: Diagnosing Syntactic Heuristics in Natural Language Inference
McCoy, R. T., Pavlick, E., & Linzen, T. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1334 · Cited by 944
Self-citation
Metadata
- Authors
- Gulordava, K., Bojanowski, P., Grave, E., Linzen, T., & Baroni, M.
- Venue
- Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)
- Published
- 2018
- Volume
- 2
- Issue
- 1
- Pages
- 1195-1205
- OpenAlex
- W2795355797
- Cited by
- 465
- References
- 30
- FWCI
- 30.17
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.