The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Transition-Based Dependency Parsing with Stack Long Short-Term Memory
Open accessAbstract
Chris Dyer, Miguel Ballesteros, Wang Ling, Austin Matthews, Noah A. Smith. Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). 2015.
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
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
Sequence to Sequence Learning with Neural Networks
Sutskever, I., Vinyals, O., & Le, Q. V. (2014) · arXiv · doi:10.48550/arxiv.1409.3215 · Cited by 17,766
(2010) · Cited by 14,134
(2011) · Cited by 6,993
Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank
Socher, R., Perelygin, A., Wu, J., Chuang, J., Manning, C. D., Ng, A., & Potts, C. (2013) · Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d13-1170 · Cited by 6,878
Generating Sequences With Recurrent Neural Networks
Graves, A. (2013) · arXiv · doi:10.48550/arxiv.1308.0850 · Cited by 2,894
Feature-rich part-of-speech tagging with a cyclic dependency network
Toutanova, K., Klein, D., Manning, C. D., & Singer, Y. (2003) · Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - NAACL '03 · doi:10.3115/1073445.1073478 · Cited by 2,844
Generating Typed Dependency Parses from Phrase Structure Parses
de Marneffe, M.-C., MacCartney, B., & Manning, C. D. (2006) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/3wtkaidk6ea8 · Cited by 2,258
A Fast and Accurate Dependency Parser using Neural Networks
Chen, D., & Manning, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1082 · Cited by 1,795
Graves, A., Wayne, G., & Danihelka, I. (2014) · arXiv · doi:10.48550/arxiv.1410.5401 · Cited by 1,058 · cited 1×
“Such an extension of the work would make it an alternative to architectures that have an explicit external memory such as neural Turing machines (Graves et al., 2014) and memory networks (Weston et al., 2015).”
MethodParsing with Compositional Vector Grammars
Socher, R., Bauer, J., Manning, C. D., & Ng, A. Y. (2013) · Cited by 828
Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection
Socher, R., Huang, E., Pennin, J., Manning, C. D., & Ng, A. Y. (2011) · neural information processing systems · Cited by 782
Grounded Compositional Semantics for Finding and Describing Images with Sentences
Socher, R., Karpathy, A., Le, Q. V., Manning, C. D., & Ng, A. Y. (2014) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00177 · Cited by 777
(2014) · International Conference on Learning Representations · Cited by 634
Framewise phoneme classification with bidirectional LSTM networks
Graves, A., & Schmidhuber, J. (2006) · Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005. · doi:10.1109/ijcnn.2005.1556215 · Cited by 618
Statistical Dependency Analysis with Support Vector Machines
Yamada, H., & Matsumoto, Y. (2003) · Cited by 600
An efficient algorithm for projective dependency parsing
Nivre, J. (2003) · Cited by 475
Vinyals, O., Kaiser, L., Koo, T., Petrov, S., Sutskever, I., & Hinton, G. (2014) · arXiv · doi:10.48550/arxiv.1412.7449 · Cited by 464
Algorithms for Deterministic Incremental Dependency Parsing
Nivre, J. (2008) · Computational Linguistics · doi:10.1162/coli.07-056-r1-07-027 · Cited by 435
Two/Too Simple Adaptations of Word2Vec for Syntax Problems
Ling, W., Dyer, C., Black, A. W., & Trancoso, I. (2015) · Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.3115/v1/n15-1142 · Cited by 384
Self-citationA Conditional Random Field Word Segmenter for Sighan Bakeoff 2005
Tseng, H., Chang, P.-C., Andrew, G., Jurafsky, D. S., & Manning, C. D. (2005) · Cited by 329
Multi-dimensional Recurrent Neural Networks
Graves, A., Fernández, S., & Schmidhuber, J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74690-4_56 · Cited by 303
Tailoring Continuous Word Representations for Dependency Parsing
Bansal, M., Gimpel, K., & Livescu, K. (2014) · Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers) · doi:10.3115/v1/p14-2131 · Cited by 290
Incrementality in deterministic dependency parsing
Nivre, J. (2004) · Proceedings of the Workshop on Incremental Parsing Bringing Engineering and Cognition Together - IncrementParsing '04 · doi:10.3115/1613148.1613156 · Cited by 275
Forest Reranking: Discriminative Parsing with Non-Local Features
Huang, L. (2008) · Cited by 246
Bohnet, B., & Nivre, J. (2012) · Cited by 228
Non-projective dependency parsing in expected linear time
Nivre, J. (2009) · Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - ACL-IJCNLP '09 · doi:10.3115/1687878.1687929 · Cited by 225
Structured Training for Neural Network Transition-Based Parsing
Weiss, D., Alberti, C., Collins, M., & Petrov, S. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1032 · Cited by 180
The Role of Syntax in Vector Space Models of Compositional Semantics
Hermann, K. M., & Blunsom, P. (2013) · Oxford University Research Archive (ORA) (University of Oxford) · Cited by 154
Reinforcement Learning Neural Turing MachinesPreprint
Zaremba, W., & Sutskever, I. (2015) · arXiv (Cornell University) · Cited by 113
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
Martins, A. F. T., Smith, N. A., Xing, E. P., Aguiar, P. M. Q., & Figueiredo, M. A. T. (2018) · KiltHub Repository · doi:10.1184/r1/6476417 · Cited by 112
Self-citationSubsymbolic Case‐Role Analysis of Sentences with Embedded Clauses
Miikkulainen, R. P. (1996) · Cognitive Science · doi:10.1016/s0364-0213(99)80002-0 · Cited by 106
Transition-based Dependency Parsing with Selectional Branching
Choi, J. D., & McCallum, A. (2013) · Cited by 96
The Inside-Outside Recursive Neural Network model for Dependency Parsing
Le, P., & Zuidema, W. H. (2014) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1081 · Cited by 73
Constituent Parsing with Incremental Sigmoid Belief Networks
Titov, I., & Henderson, J. (2007) · Cited by 43
Incremental Non-Projective Dependency Parsing
Nivre, J. (2007) · North American Chapter of the Association for Computational Linguistics · Cited by 41
Feature Embedding for Dependency Parsing
Chen, W., Zhang, Y., & Zhang, M. (2014) · doi:10.13140/2.1.4364.1603 · Cited by 37
Transition-based Dependency Parsing Using Recursive Neural Networks
Stenetorp, P. (2013) · Cited by 31
SARDSRN: A Neural Network Shift-Reduce Parser
Mayberry, M. R., & Miikkulainen, R. P. (1999) · CogPrints (University of Southampton) · Cited by 29
MaltOptimizer: Fast and effective parser optimization
Ballesteros, M., & Nivre, J. (2014) · Natural Language Engineering · doi:10.1017/s1351324914000035 · Cited by 15
Self-citation
Cited by
Neural Architectures for Named Entity Recognition
Lample, G., Ballesteros, M., Subramanian, S., Kawakami, K., & Dyer, C. (2016) · Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/n16-1030 · Cited by 4,401
Self-citationRecent Trends in Deep Learning Based Natural Language Processing [Review Article]
Young, T., Hazarika, D., Poria, S., & Cambria, E. (2018) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2018.2840738 · Cited by 2,921
End-to-end Sequence Labeling via Bi-directional LSTM-CNNs-CRF
Ma, X., & Hovy, E. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1101 · Cited by 2,567
“An elegant solution whose effectiveness has been proven by previous work (Dyer et al., 2015) is bi-directional LSTM (BLSTM).”
BackgroundA Survey of the Usages of Deep Learning for Natural Language Processing
Otter, D. W., Medina, J. R., & Kalita, J. K. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2979670 · Cited by 1,836
Long Short-Term Memory-Networks for Machine Reading
Cheng, J., Dong, L., & Lapata, M. (2016) · arXiv · doi:10.48550/arxiv.1601.06733 · Cited by 1,198
Metadata
- Authors
- Dyer, C., Ballesteros, M., Ling, W., Matthews, A., & Smith, N. A.
- Venue
- Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers)
- Published
- 2015
- Pages
- 334-343
- OpenAlex
- W2134036914
- Cited by
- 553
- References
- 41
- FWCI
- 44.70
- Type
- conference paper
- Language
- en
- Open access
- gold
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.